Leader election algorithms for mobile ad hoc networks
Top Cited Papers
- 1 August 2000
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
We present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected component of the topology graph has exactly one leader. The algorithms are based on a routing algorithm called TORA [5], which in turn is based on an algorithm by Gafni and Bertsekas [3]. The algorithm require nodes to communicate with only their current neighbors, making it well suited to the ad hoc environment. The first algorithm is for a single topology change and is provided with a proof of correctness. The second algorithm tolerates multiple concurrent topology changes.Keywords
This publication has 3 references indexed in Scilit:
- Multicast operation of the ad-hoc on-demand distance vector routing protocolPublished by Association for Computing Machinery (ACM) ,1999
- Fundamental control algorithms in mobile networksPublished by Association for Computing Machinery (ACM) ,1999
- Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing TopologyIEEE Transactions on Communications, 1981