A leader election algorithm for dynamic networks with causal clocks Academic Article uri icon

abstract

  • 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 occurs, if topology changes cease, then eventually every connected component contains a unique leader. The algorithm combines ideas from the Temporally Ordered Routing Algorithm for mobile ad hoc networks (Park and Corson in Proceedings of the 16th IEEE Conference on Computer Communications (INFOCOM), pp. 1405-1413 (1997) with a wave algorithm (Tel in Introduction to distributed algorithms, 2nd edn. Cambridge University Press, Cambridge, MA, 2000), all within the framework of a height-based mechanism for reversing the logical direction of communication topology links (Gafni and Bertsekas in IEEE Trans Commun C-29(1), 11-18 1981). Moreover, a generic representation of time is used, which can be implemented using totally-ordered values that preserve the causality of events, such as logical clocks and perfect clocks. A correctness proof for the algorithm is provided, and it is ensured that in certain well-behaved situations, a new leader is not elected unnecessarily, that is, the algorithm satisfies a stability condition. 2013 Springer-Verlag Berlin Heidelberg.

published proceedings

  • DISTRIBUTED COMPUTING

altmetric score

  • 6

author list (cited authors)

  • Ingram, R., Radeva, T., Shields, P., Viqar, S., Walter, J. E., & Welch, J. L.

citation count

  • 17

complete list of authors

  • Ingram, Rebecca||Radeva, Tsvetomira||Shields, Patrick||Viqar, Saira||Walter, Jennifer E||Welch, Jennifer L

publication date

  • April 2013