A Novel Method for Leader Election Algorithm

In many distributed systems, we need a leader for coordinating other's members. In this structure, when the leader is crashed, other nodes must elect another leader. Many algorithms for leader election have proposed. In this paper, we introduce a new algorithm for leader election that reduces number of messages rather than other algorithms.