Eventual Leader Election in Evolving Mobile Networks

  • Luciana Arantes
  • Fabíola Greve
  • Pierre Sens
  • Véronique Simon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8304)


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.


Fault-tolerant leader election dynamic networks process mobility asynchronous systems 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. JACM 43(2), 225–267 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Mostefaoui, A., Raynal, M., Travers, C.: Time-free and timer-based assumptions can be combined to obtain eventual leadership. IEEE TPDS 17(7), 656–666 (2006)Google Scholar
  3. 3.
    Larrea, M., Fernandez, A., Arévalo, S.: Optimal implementation of the weakest failure detector for solving consensus. In: SRDS 2000, pp. 334–334 (2000)Google Scholar
  4. 4.
    Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Stable leader election. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 108–122. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing omega with weak reliability and synchrony assumptions. In: PODC 2003, pp. 306–314. ACM Press (2003)Google Scholar
  6. 6.
    Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: PODC 2004, pp. 328–337 (July 2004)Google Scholar
  7. 7.
    Malkhi, D., Oprea, F., Zhou, L.: O meets paxos: Leader election and stability without eventual timely links. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 199–213. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Hutle, M., Malkhi, D., Schmid, U., Zhou, L.: Chasing the weakest system model for implementing omega and consensus. IEEE Transactions on Dependable and Secure Computing 6, 269–281 (2009)CrossRefGoogle Scholar
  9. 9.
    Fernandez, A., Jimenez, E., Raynal, M.: Eventual leader election with weak assumptions on initial knowledge, communication reliability, and synchrony. Journal of Computer Science and Technology 25(6), 1267–1281 (2010)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Tucci-Piergiovanni, S., Baldoni, R.: Eventual leader election in infinite arrival message-passing system model with bounded concurrency. In: EDCC 2010, pp. 127–134 (2010)Google Scholar
  11. 11.
    Masum, S.M., Ali, A.A., Touhid-youl Islam Bhuiyan, M.: Asynchronous leader election in mobile ad hoc networks. In: AINA Conference, pp. 827–831 (2006)Google Scholar
  12. 12.
    Cao, J., Raynal, M., Travers, C., Wu, W.: The eventual leadership in dynamic mobile networking environments. In: PRDC Conference, pp. 123–130 (2007)Google Scholar
  13. 13.
    Melit, L., Badache, N.: An Ω-based leader election algorithm for mobile ad hoc networks. In: 4th Networked Digital Technologies Conf., pp. 483–490 (2012)Google Scholar
  14. 14.
    Gomez-Calzado, C., Larrea, M., Raynal, M.: Fault-tolerant leader election in mobile dynamic distributed systems. Technical report, University of the Basque Country UPV/EHU (2013)Google Scholar
  15. 15.
    Mostefaoui, A., Mourgaya, E., Raynal, M.: Asynchronous implementation of failure detectors. In: DSN Conference, pp. 351–360 (2003)Google Scholar
  16. 16.
    Jiménez, E., Arévalo, S., Fernandez, A.: Implementing unreliable failure detectors with unknown membership. Inf. Process. Lett. 100(2), 60–63 (2006)CrossRefzbMATHGoogle Scholar
  17. 17.
    Aguilera, M.K.: A pleasant stroll through the land of infinitely many creatures. SIGACT News 35(2), 36–59 (2004)CrossRefGoogle Scholar
  18. 18.
    Larrea, M., Raynal, M., Soraluze, I., Cortiñas, R.: Specifying and implementing an eventual leader service for dynamic systems. Int. J. Web Grid Serv. 8(3), 204–224 (2012)CrossRefGoogle Scholar
  19. 19.
    Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: Adhoc-Now Conference, pp. 346–359 (2011)Google Scholar
  20. 20.
    Min-Te, S., Lifei, H., Arora, A., Ten-Hwang, A.L.: Reliable mac layer multicast in ieee 802.11 wireless networks. In: ICPP Conference, pp. 527–536 (2002)Google Scholar
  21. 21.
    Koo, C.Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: PODC 2004, pp. 275–282 (2004)Google Scholar
  22. 22.
    Mostefaoui, A., Raynal, M., Travers, C., Patterson, S., Agrawal, D., Abbadi, A.: From static distributed systems to dynamic systems. In: SRDS 2005, pp. 109–118 (2005)Google Scholar
  23. 23.
    Bhandari, V., Vaidya, N.H.: Reliable broadcast in radio networks with locally bounded failures. IEEE TPDS 21, 801–811 (2010)Google Scholar

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