Abstract
In distributed computing, to select a leader is an essential problem for research discussion. Without a leader, many applications in a distributed system are unable to communicate, take a decision and to achieve a needed goal. To solve this sort of problem leader election algorithm is one of the best approaches. The bully algorithm is one of the safe and simplest methods to select a leader, in which the highest priority identity (ID) number is used to select as a leader if the existing leader has failed. In every distributed leader election algorithm every node has a unique ID which known to every other node in the distributed system. The performance of an algorithm is measured in terms of numbers of messages (communication cost). There is a space to improve this algorithm by reducing the numbers of messages required in election procedures. Therefore this paper seeks to reflect a comparative analysis of bully, modified bully, ring and our proposed bully algorithm. Our proposed algorithm has used O(1) messages complexity for leader election in the best and worst case while uses O(n) messages for to inform all alive nodes in the system that I am a new leader and significantly reduce the number of messages. The results show that our proposed algorithm is a simplest method and outperforms then existing algorithms in terms of time, messages complexity and number of stages.