Abstract
Many reliable distributed services rely on an eventual leader election to coordinate actions. The eventual leader detector has been proposed as a way to implement such an abstraction. It ensures that, eventually, each process in the system will be provided by an unique leader, elected among the set of correct processes in spite of crashes and uncertainties. A number of eventual leader election protocols were suggested. Nonetheless, as far as we are aware of, no one of these protocols tolerates a free pattern of node mobility. This paper proposes a new protocol for this scenario of dynamic and mobile unknown networks. © 2013 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Arantes, L., Greve, F., Sens, P., & Simon, V. (2013). Eventual leader election in evolving mobile networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8304 LNCS, pp. 23–37). https://doi.org/10.1007/978-3-319-03850-6_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
