Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
On an improved algorithm for decentralized extrema finding in circular configurations of processors
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Asynchronous Leader Election in Mobile Ad Hoc Networks
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
MASCOTS '07 Proceedings of the 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A merging clustering algorithm for mobile ad hoc networks
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
An efficient leader election algorithm for mobile ad hoc networks
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
A distributed backbone formation algorithm for mobile ad hoc networks
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Trivial solution for a non-trivial problem in MANETs
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
Leader Election is an important problem in mobile ad hoc networks and in distributed computing systems. In this study, we propose a hierarchical, cluster based protocol to elect a leader in a mobile ad hoc network. The initial phase of the protocol employs a clustering algorithm to group nodes of the network after which a leader for a cluster(clusterhead) is elected. The second phase is performed by forming a connected ring of these leaders using the Ring Formation Algorithm. Finally, Chang Roberts Leader Election Algorithmfor rings is employed in the final phase to elect the super-leader among the clusterheads. We provide performance results of this protocol for various mobility parameters and analyze its time and message complexities.