Document Open Access Logo

Selecting a Leader in a Network of Finite State Machines

Authors Yehuda Afek, Yuval Emek, Noa Kolikant

PDF
Thumbnail PDF

File

LIPIcs.DISC.2018.4.pdf
  • Filesize: 0.51 MB
  • 17 pages

Document Identifiers

Author Details

Yehuda Afek
  • Tel Aviv University, Tel Aviv, Israel
Yuval Emek
  • Technion - Israel Institute of Technology, Haifa, Israel
Noa Kolikant
  • Tel Aviv University, Tel Aviv, Israel

Funding

  • Afek, Yehuda: The work of Y. Afek was partially supported by a grant from the Blavatnik Cyber Security Council and the Blavatnik Computer Science Research Fund.
  • Emek, Yuval: The work of Y. Emek was supported in part by an Israeli Science Foundation grant number 1016/17.

Cite AsGet BibTex

Yehuda Afek, Yuval Emek, and Noa Kolikant. Selecting a Leader in a Network of Finite State Machines. In 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 121, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.DISC.2018.4

Abstract

This paper studies a variant of the leader election problem under the stone age model (Emek and Wattenhofer, PODC 2013) that considers a network of n randomized finite automata with very weak communication capabilities (a multi-frequency asynchronous generalization of the beeping model's communication scheme). Since solving the classic leader election problem is impossible even in more powerful models, we consider a relaxed variant, referred to as k-leader selection, in which a leader should be selected out of at most k initial candidates. Our main contribution is an algorithm that solves k-leader selection for bounded k in the aforementioned stone age model. On (general topology) graphs of diameter D, this algorithm runs in O~(D) time and succeeds with high probability. The assumption that k is bounded turns out to be unavoidable: we prove that if k = omega (1), then no algorithm in this model can solve k-leader selection with a (positive) constant probability.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed computing models
Keywords
  • stone age model
  • beeping communication scheme
  • leader election
  • k-leader selection
  • randomized finite state machines
  • asynchronous scheduler

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Karl R. Abrahamson, Andrew Adler, Lisa Higham, and David G. Kirkpatrick. Probabilistic solitude verification on a ring. In Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), pages 161-173, 1986. Google Scholar
  2. Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, and Fabian Kuhn. Beeping a maximal independent set. In Proceedings of International Symposium on Distributed Computing (DISC), pages 32-50, 2011. Google Scholar
  3. Yehuda Afek and Yossi Matias. Elections in anonymous networks. Inf. Comput., 113(2):312-330, 1994. Google Scholar
  4. Dana Angluin. Local and global properties in networks of processors (extended abstract). In Proceedings of ACM SIGACT Symposium on Theory of Computing (STOC), pages 82-93, 1980. Google Scholar
  5. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4):235-253, 2006. Google Scholar
  6. James Aspnes and Eric Ruppert. An Introduction to Population Protocols, pages 97-120. Springer Berlin Heidelberg, 2009. Google Scholar
  7. Hagit Attiya, Marc Snir, and Manfred K. Warmuth. Computing on an anonymous ring. J. ACM, 35(4):845-875, 1988. Google Scholar
  8. Baruch Awerbuch. Complexity of network synchronization. J. ACM, 32(4):804-823, 1985. Google Scholar
  9. Baruch Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In Proceedings of ACM SIGACT Symposium on Theory of Computing (STOC), pages 230-240, 1987. Google Scholar
  10. Sarah Cannon, Joshua J. Daymude, Dana Randall, and Andréa W. Richa. A Markov chain algorithm for compression in self-organizing particle systems. In Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), pages 279-288, 2016. Google Scholar
  11. Alejandro Cornejo and Fabian Kuhn. Deploying wireless networks with beeps. In Proceedings of International Symposium on Distributed Computing (DISC), pages 148-162, 2010. Google Scholar
  12. Joshua J. Daymude, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andréa W. Richa, Christian Scheideler, and Thim Strothmann. On the runtime of universal coating for programmable matter. Natural Computing, 17(1):81-96, 2018. Google Scholar
  13. Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, and Thim Strothmann. An algorithmic framework for shape formation problems in self-organizing particle systems. In Proceedings of International Conference on Nanoscale Computing and Communication (NANOCOM), pages 21:1-21:2, 2015. Google Scholar
  14. Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, and Thim Strothmann. Universal shape formation for programmable matter. In Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 289-299, 2016. Google Scholar
  15. Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann, and Shimrit Tzur-David. Infinite object coating in the Amoebot model. CoRR, abs/1411.2356, 2014. URL: http://arxiv.org/abs/1411.2356.
  16. Zahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida Bazzi, Andréa W. Richa, and Christian Scheideler. Leader election and shape formation with self-organizing programmable matter. In Proceedings of International Conference on DNA Computing and Molecular Programming (DNA), pages 117-132, 2015. Google Scholar
  17. Shlomi Dolev, Robert Gmyr, Andréa W. Richa, and Christian Scheideler. Ameba-inspired self-organizing particle systems. CoRR, abs/1307.4259, 2013. URL: http://arxiv.org/abs/1307.4259.
  18. David Doty. Timing in chemical reaction networks. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 772-784, 2014. Google Scholar
  19. Yuval Emek and Jara Uitto. Dynamic networks of finite state machines. In Proceedings of International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 19-34, 2016. Google Scholar
  20. Yuval Emek and Roger Wattenhofer. Stone age distributed computing. In Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), pages 137-146, 2013. Google Scholar
  21. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, 1985. Google Scholar
  22. Greg N. Frederickson and Nancy A. Lynch. Electing a leader in a synchronous ring. J. ACM, 34(1):98-115, 1987. Google Scholar
  23. Robert G. Gallager, Pierre A. Humblet, and Philip M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst., 5(1):66-77, 1983. Google Scholar
  24. M. Gardner. The fantastic combinations of John Conway’s new solitaire game `life'. Scientific American, 223(4):120-123, 1970. Google Scholar
  25. Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, and Jonni Virtema. Weak models of distributed computing, with connections to modal logic. Distributed Computing, 28(1):31-53, 2015. Google Scholar
  26. Alon Itai and Michael Rodeh. Symmetry breaking in distributed networks. Inf. Comput., 88(1):60-87, 1990. Google Scholar
  27. Laurent Keller and Peter Nonacs. The role of queen pheromones in social insects: queen control or queen signal? Animal Behaviour, 45(4):787-794, 1993. Google Scholar
  28. Jennie J. Kuzdzal-Fick, David C. Queller, and Joan E. Strassmann. An invitation to die: initiators of sociality in a social amoeba become selfish spores. Biology letters, 6(6):800-802, 2010. Google Scholar
  29. Ivan Lavallée and Christian Lavault. Spanning tree construction for nameless networks. In Proceedings of International Workshop on Distributed Algorithms (WDAG), pages 41-56, 1990. Google Scholar
  30. Othon Michail, Ioannis Chatzigiannakis, and Paul G. Spirakis. New Models for Population Protocols. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, 2011. Google Scholar
  31. John Von Neumann. Theory of Self-Reproducing Automata. University of Illinois Press, Champaign, IL, USA, 1966. Google Scholar
  32. David Peleg. Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000. Google Scholar
  33. Baruch Schieber and Marc Snir. Calling names on nameless networks. Inf. Comput., 113(1):80-101, 1994. Google Scholar
  34. Joanna M. Setchell, Marie Charpentier, and E. Jean Wickings. Mate guarding and paternity in mandrills: factors influencing alpha male monopoly. Animal Behaviour, 70(5):1105-1120, 2005. Google Scholar
  35. Jonathan M.W. Slack. Essential developmental biology. John Wiley &Sons, 2009. Google Scholar
  36. NSF workshop on self-organizing particle systems (SOPS). http://sops2014.cs.upb.de/, 2014.
  37. Stephen Wolfram. A New Kind of Science. Wolfram Media Inc., Champaign, Ilinois, US, United States, 2002. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact