Efficient leader election in complete networks

Leader election is a fundamental problem in distributed computing and it has been studied assuming various computation models and network topologies. This paper analyzes the algorithms for leader election in complete networks using asynchronous communication channels. We present a novel algorithm that reduces the information necessary to select a leader compared with other leader election algorithms for complete networks. In this paper, the algorithm works without sense of direction. And, it does not require to know the number of nodes in the system. Our proposal requires O(n) messages and O(n) time, where n is the number of nodes in the system, to elect a leader.