An Asynchronous Leader Election Algorithm for Dynamic Networks Conference Paper

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 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. 2009 IEEE.

name of conference

• 2009 IEEE International Symposium on Parallel & Distributed Processing

authors

• Welch, Jennifer

published proceedings

• 2009 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-5

author list (cited authors)

• Ingram, R., Shields, P., Walter, J. E., & Welch, J. L.

citation count

• 52

complete list of authors

• Ingram, Rebecca||Shields, Patrick||Walter, Jennifer E||Welch, Jennifer L

publication date

• January 2009

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS  Journal

Digital Object Identifier (DOI)

• 10.1109/ipdps.2009.5161028

International Standard Book Number (ISBN) 13

• 978-1-4244-3751-1

start page

• 512

end page

• +

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fipdps.2009.5161028