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 algorithms 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.
Cite
CITATION STYLE
Malpani, N., Welch, J. L., & Vaidya, N. (2000). Leader election algorithms for mobile ad hoc networks. In Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (pp. 96–103). Association for Computing Machinery (ACM). https://doi.org/10.1145/345848.345871
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
