Self-Stabilizing Leader Election in Dynamic Networks

Two silent self-stabilizing asynchronous distributed algorithms are given for the leader election problem in a dynamic network with unique IDs. A leader is elected for each connected component of the network. A BFS DAG, rooted at the leader, is constructed in each component. The construction takes O(Diam) rounds, where Diam is the maximum diameter of any component. Both algorithms are self-stabilizing, silent, and work under the unfair daemon, but use one unbounded integer variable. Algorithm DLE selects an arbitrary process to be the leader of each component. Algorithm DLEND (Distributed Leader Election No Dithering) has the incumbency property and the no dithering property. If the configuration is legitimate and a topological fault occurs, each component will elect, if possible, an incumbent to be its leader, i.e., a process which was a leader before the fault. Furthermore, during this computation, no process will change its choice of leader more than once.

[1]  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.

[2]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[3]  Ajoy Kumar Datta,et al.  Self-stabilizing leader election in optimal space under an arbitrary scheduler , 2011, Theor. Comput. Sci..

[4]  Ajoy Kumar Datta,et al.  Self-Stabilizing Leader Election in Dynamic Networks , 2010, Theory of Computing Systems.

[5]  Shay Kutten,et al.  Time Optimal Self-Stabilizing Spanning Tree Algorithms , 1993, FSTTCS.

[6]  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..

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

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

[9]  Ajoy Kumar Datta,et al.  An O(n)-time self-stabilizing leader election algorithm , 2011, J. Parallel Distributed Comput..

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

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

[12]  Anish Arora,et al.  Distributed Reset , 1994, IEEE Trans. Computers.

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

[14]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

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

[16]  Jennifer L. Welch,et al.  A leader election algorithm for dynamic networks with causal clocks , 2013, Distributed Computing.

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

[18]  Boaz Patt-Shamir,et al.  A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock , 2007, IEEE Transactions on Dependable and Secure Computing.

[19]  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.

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

[21]  Shlomi Dolev,et al.  SuperStabilizing protocols for dynamic distributed systems , 1995, PODC '95.

[22]  Yehuda Afek,et al.  Self-stabilizing unidirectional network algorithms by power-supply , 1997, SODA '97.

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

[24]  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).

[25]  Moti Yung,et al.  The Local Detection Paradigm and Its Application to Self-Stabilization , 1997, Theor. Comput. Sci..

[26]  Ajoy Kumar Datta,et al.  Self-Stabilizing Leader Election in Optimal Space , 2008, SSS.

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

[28]  Ho-Lin Chen,et al.  Self-Stabilizing Leader Election , 2019, PODC.

[29]  Jennifer L. Welch,et al.  An asynchronous leader election algorithm for dynamic networks , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[30]  Boaz Patt-Shamir,et al.  Time optimal self-stabilizing synchronization , 1993, STOC.

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

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

[33]  Mohamed G. Gouda,et al.  Stabilizing Communication Protocols , 1991, IEEE Trans. Computers.