Eventual Leader Election in Evolving Mobile Networks

  • Luciana Arantes
  • Fabíola Greve
  • Pierre Sens
  • Véronique Simon
Conference paper

DOI: 10.1007/978-3-319-03850-6_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8304)
Cite this paper as:
Arantes L., Greve F., Sens P., Simon V. (2013) Eventual Leader Election in Evolving Mobile Networks. In: Baldoni R., Nisse N., van Steen M. (eds) Principles of Distributed Systems. OPODIS 2013. Lecture Notes in Computer Science, vol 8304. Springer, Cham

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.

Keywords

Fault-tolerant leader election dynamic networks process mobility asynchronous systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Luciana Arantes
    • 1
  • Fabíola Greve
    • 2
  • Pierre Sens
    • 1
  • Véronique Simon
    • 1
  1. 1.LIP6, Université Pierre et Marie Curie, Inria, CNRSFrance
  2. 2.DCC - Computer Science DepartmentFederal University of BahiaBrazil

Personalised recommendations