Distributed Computing

, Volume 28, Issue 4, pp 221–232 | Cite as

Knowledge, level of symmetry, and time of leader election

Article

Abstract

We study the time needed for deterministic leader election in the \(\mathcal{LOCAL}\) model, where in every round a node can exchange any messages with its neighbors and perform any local computations. The topology of the network is unknown and nodes are unlabeled, but ports at each node have arbitrary fixed labelings which, together with the topology of the network, can create asymmetries to be exploited in leader election. We consider two versions of the leader election problem: strong LE in which exactly one leader has to be elected, if this is possible, while all nodes must terminate declaring that leader election is impossible otherwise, and weak LE, which differs from strong LE in that no requirement on the behavior of nodes is imposed, if leader election is impossible. We show that the time of leader election depends on three parameters of the network: its diameter \(D\), its size \(n\), and its level of symmetry\(\lambda \), which, when leader election is feasible, is the smallest depth at which some node has a unique view of the network. It also depends on the knowledge by the nodes, or lack of it, of parameters \(D\) and \(n\).

Keywords

Leader election Anonymous network  Level of symmetry 

References

  1. 1.
    Angluin, D.: Local and global properties in networks of processors (Extended Abstract). In: Proceeding of the 12th Annual ACM Symposium on Theory of Computing (STOC 1980), pp. 82–93Google Scholar
  2. 2.
    Attiya, H., Snir, M., Warmuth, M.: Computing on an anonymous ring. J. ACM 35, 845–875 (1988)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Attiya, H., Snir, M.: Better computing on the anonymous ring. J. Algorithms 12, 204–238 (1991)Google Scholar
  4. 4.
    Boldi, P., Shammah, S., Vigna, S., Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks: characterizations. In: Proceedings of the 4th Israel Symposium on Theory of Computing and Systems, (ISTCS 1996), pp. 16–26Google Scholar
  5. 5.
    Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 181–188 (1999)Google Scholar
  6. 6.
    Burns, J.E.: A formal model for message passing systems. Technical Report TR-91, Computer Science Department, Indiana University, Bloomington, September (1980)Google Scholar
  7. 7.
    Chalopin, J.: Local computations on closed unlabelled edges: the election problem and the naming problem. In: Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, pp. 82–91Google Scholar
  8. 8.
    Chalopin, J., Mazurkiewicz, A.W., Métivier, Y.: Labelled (Hyper) graphs, negotiations and the naming problem. In: Proceedings of the 4th International Conference on Graph Transformations (ICGT 2008), pp. 54–68Google Scholar
  9. 9.
    Chalopin, J., Métivier, Y.: Election and local computations on edges. In: Proceedings of the Foundations of Software Science and Computation Structures (FoSSaCS 2004), pp. 90–104Google Scholar
  10. 10.
    Dereniowski, D., Kosowski, A., Pajak, D.: Distinguishing views in symmetric networks: a tight lower bound. Technical Report hal-00875370, version 2, Inria, October (2013)Google Scholar
  11. 11.
    Diks, K., Kranakis, E., Malinowski, A., Pelc, A.: Anonymous wireless rings. Theor. Comput. Sci. 145, 95–109 (1995)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Dobrev, S., Pelc, A.: Leader election in rings with nonunique labels. Fundam. Inform. 59, 333–347 (2004)MathSciNetMATHGoogle Scholar
  13. 13.
    Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F.L., Santoro, N.: Sorting and election in anonymous asynchronous rings. J. Parallel Distrib. Comput. 64(2), 254–265 (2004)CrossRefMATHGoogle Scholar
  14. 14.
    Fredrickson, G.N., Lynch, N.A.: Electing a leader in a synchronous ring. J. ACM 34, 98–115 (1987)CrossRefGoogle Scholar
  15. 15.
    Fusco, E., Pelc, A.: How much memory is needed for leader election. Distrib. Comput. 24, 65–78 (2011)CrossRefMATHGoogle Scholar
  16. 16.
    Haddar, M.A., Kacem, A.H., Métivier, Y., Mosbah, M., Jmaiel, M.: Electing a leader in the local computation model using mobile agents. In: Proceedings of the 6th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA 2008), pp. 473–480Google Scholar
  17. 17.
    Hendrickx, J.M.: Views in a graph: To which depth must equality be checked? IEEE Trans. Parallel Distrib. Syst. 25, 1907–1912 (2014)Google Scholar
  18. 18.
    Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema-finding in circular configurations of processes. Commun. ACM 23, 627–628 (1980)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Efficient algorithms for leader election in radio networks. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 51–57Google Scholar
  20. 20.
    Kowalski, D., Pelc, A.: Leader election in ad hoc radio networks: a keen ear helps. J. Comput. Syst. Sci. 79, 1164–1180 (2013)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Kranakis, E.: Symmetry and computability in anonymous networks: a brief survey. In: Proceedings of the 3rd International Conference on Structural Information and Communication Complexity, pp. 1–16 (1997)Google Scholar
  22. 22.
    Kranakis, E., Krizanc, D., van der Berg, J.: Computing boolean functions on anonymous networks. Inform. Comput. 114, 214–236 (1994)CrossRefMATHGoogle Scholar
  23. 23.
    Le Lann, G.: Distributed systems—towards a formal approach. In: Proceedings of the IFIP Congress, North Holland, pp. 155–160 (1977)Google Scholar
  24. 24.
    Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Trans. Parallel Distrib. Syst. 13, 516–526 (2002)CrossRefGoogle Scholar
  25. 25.
    Norris, N.: Universal covers of graphs: isomorphism to depth \(N-1\) implies isomorphism to all depths. Discret. Appl. Math. 56(1), 61–74 (1995)MathSciNetCrossRefMATHGoogle Scholar
  26. 26.
    Peleg, D.: Distributed computing, a locality-sensitive approach. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2000)Google Scholar
  27. 27.
    Peterson, G.L.: An \(O(n \log n)\) unidirectional distributed algorithm for the circular extrema problem. ACM Trans. Program. Lang. Syst. 4, 758–762 (1982)CrossRefMATHGoogle Scholar
  28. 28.
    Sakamoto, N.: Comparison of initial conditions for distributed algorithms on anonymous networks. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing (PODC 1999), pp. 173–179Google Scholar
  29. 29.
    Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15, 468–477 (1986)MathSciNetCrossRefMATHGoogle Scholar
  30. 30.
    Yamashita, M., Kameda, T.: Computing on anonymous networks. In: Proceedings of the 7th ACM Symposium on Principles of Distributed Computing (PODC 1988), pp. 117–130Google Scholar
  31. 31.
    Yamashita, M., Kameda, T.: Electing a leader when processor identity numbers are not distinct. In: Proceedings of the 3rd Workshop on Distributed Algorithms, LNCS Vol 392, Springer, (WDAG 1989), 303–314Google Scholar
  32. 32.
    Yamashita, M., Kameda, T.: Computing on anonymous networks: part I–characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7, 69–89 (1996)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Department of Computer, Control, and Management Engineering “Antonio Ruberti”Sapienza University of RomeRomeItaly
  2. 2.Département d’informatiqueUniversité du Québec en OutaouaisGatineauCanada

Personalised recommendations