An asynchronous leader election algorithm for dynamic networks

An algorithm for electing a leader in an asynchronous network with dynamically changing communication topology is presented. The algorithm ensures that, no matter what pattern of topology changes occur, if topology changes cease, then eventually every connected component contains a unique leader. The algorithm combines ideas from the Temporally Ordered Routing Algorithm (TORA) for mobile ad hoc networks [16] with a wave algorithm [21], all within the framework of a height-based mechanism for reversing the logical direction of communication links [6]. It is proved that in certain well-behaved situations, a new leader is not elected unnecessarily.

[1]  Scott D. Stoller.  Leader Election in Distributed Systems with Crash Failures , 1999 .

[2]  Orhan Dagdeviren,et al.  A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks , 2008, ICCS.

[3]  Hongyi Wu,et al.  Replication-based efficient data delivery scheme (red) for delay/fault-tolerant mobile sensor network (DFT-MSN) , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[4]  Oksam Chae,et al.  Performance analysis of Leader Election Algorithms in Mobile Ad hoc Networks , 2008 .

[5]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[6]  Joost-Pieter Katoen,et al.  Design and analysis of dynamic leader election protocols in broadcast networks , 1993, Distributed Computing.

[7]  Flaviu Cristian,et al.  A Highly Available Local Leader Election Service , 1999, IEEE Trans. Software Eng..

[8]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[9]  Vijay Kumar,et al.  An Efficient Leader Election Algorithm for Mobile Ad Hoc Networks , 2004, ICDCIT.

[10]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[11]  Salahuddin Mohammad Masum,et al.  Asynchronous leader election in mobile ad hoc networks , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[12]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[13]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[14]  Nadjib Badache,et al.  A Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks , 2008, IEEE Transactions on Parallel and Distributed Systems.

[15]  Donald F. Towsley,et al.  Design and analysis of a leader election algorithm for mobile ad hoc networks , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[16]  Yi Pan,et al.  A fault-tolerant protocol for election in chordal-ring networks with fail-stop processor failures , 1997 .

[17]  Gurdip Singh,et al.  Leader Election in the Presence of Link Failures , 1996, IEEE Trans. Parallel Distributed Syst..

[18]  Bernard Mans,et al.  Optimal Elections in Faulty Loop Networks and Applications , 1998, IEEE Trans. Computers.

[19]  Christian Scheideler,et al.  A jamming-resistant MAC protocol for single-hop wireless networks , 2008, PODC '08.

[20]  Ye Xia,et al.  Optimal Leader Election Scheme for Peer-to-Peer Applications , 2007, Sixth International Conference on Networking (ICN'07).

[21]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[22]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.

[23]  Scott D. Stoller.  Leader Election in Asynchronous Distributed Systems , 2000, IEEE Trans. Computers.

[24]  Paul G. Spirakis,et al.  Fundamental control algorithms in mobile networks , 1999, SPAA '99.