Advertisement

Distributed Computing

, Volume 25, Issue 6, pp 451–460 | Cite as

On space complexity of self-stabilizing leader election in mediated population protocol

  • Ryu Mizoguchi
  • Hirotaka Ono
  • Shuji KijimaEmail author
  • Masafumi Yamashita
Article

Abstract

Chatzigiannakis et al. (Lect Notes Comput Sci 5734:56–76, 2009) extended the Population Protocol (PP) of Angluin et al. (2004) and introduced the Mediated Population Protocol (MPP) by introducing an extra memory on every agent-to-agent communication link (i.e., edge), in order to model more powerful networks of mobile agents with limited resources. For a general distributed system of autonomous agents, Leader Election (LE) plays a key role in their efficient coordination. A Self-Stabilizing (SS) protocol has ideal properties required for distributed systems of huge numbers of not highly reliable agents typically modeled by PP or MPP; it does not require any initialization and tolerates a finite number of transient failures. Cai et al. (2009) showed that for a system of \(n\) agents, any PP for SS-LE requires at least \(n\) agent-states, and gave a PP with \(n\) agent-states for SS-LE. In this paper, we show, for a system of \(n\) agents, any MPP for SS-LE with 2 edge-states (i.e., 1 bit memory) on every edge requires at least \((1/2) \lg {n}\) agent-states, and give an MPP for SS-LE with \((2/3)n\) agent-states and 2 edge-states on every edge. Furthermore, we show that a constant number of edge-states on every edge do not help in designing an MPP for SS-LE with a constant number of agent-states, and that there is no MPP for SS-LE with 2 agent-states, regardless of the number of edge-states; the edge-state is not a complete alternative of the agent-state, although it can help in reducing the number of agent-states, when solving SS-LE.

Keywords

Population protocols Mediated population protocols  Leader election Self-stabilization Space complexity 

Notes

Acknowledgments

The authors thank the associate editor and the anonymous reviewers for their serious and valuable comments. The authors are supported by Grants-in-Aid for Scientific Research.

References

  1. 1.
    Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. Lec. Notes Comput. Sci. 3560, 63–74 (2005)CrossRefGoogle Scholar
  2. 2.
    Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18, 235–253 (2006)CrossRefGoogle Scholar
  3. 3.
    Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distrib. Comput. 21, 183–199 (2008)CrossRefGoogle Scholar
  4. 4.
    Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. ACM Trans. Autonom. Adapt. Syst. 3 (2008), Article 13Google Scholar
  5. 5.
    Aspnes, J., Ruppert, E.: An introduction to population protocols. Bull. EATCS 93, 98–117 (2007)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Beauquier, J., Clement, J., Messika, S., Rosaz, L., Rozoy, B.: Self-stabilizing counting in mobile sensor networks. Proc. PODC, 396–397 (2007)Google Scholar
  7. 7.
    Cai, S., Izumi, T., Wada, K.: How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model. Theory Comput. Syst. 50, 433–445 (2012)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Canepa, D., Potop-Butucaru, M.G.: Stabilizing Leader Election in Population Protocols. INRIA Rocquencourt, RR-6269, 2007. Available from http://hal.inria.fr/inria-00166632/en/
  9. 9.
    Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Mediated population protocols. Theor. Comput. Sci. 412, 2434–2450 (2011) Google Scholar
  10. 10.
    Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Recent advances in population protocols. Lect. Notes Comput. Sci. 5734, 56–76 (2009)Google Scholar
  11. 11.
    Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Commun. Assoc. Comput. Mach. 17, 643–644 (1974)zbMATHGoogle Scholar
  12. 12.
    Fischer, M.J., Jiang, H.: Self-stabilizing leader election in networks of finite-state anonymous agent. Lect. Notes Comput. Sci. 4305, 395–409 (2006)CrossRefGoogle Scholar
  13. 13.
    Gouda, M.G.: The theory of weak stabilization. Lect. Notes Comput. Sci. 2194, 114–123 (2001)CrossRefGoogle Scholar
  14. 14.
    Guerraoui, R., Ruppert, E.: Names trump malice: tiny mobile agents can tolerate byzantine failures. Lect. Notes Comput. Sci. 5556, 484–495 (2009)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Mediated population protocols. Theor. Comput. Sci. 412, 2434–2450 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Mizoguchi, R., Ono, H., Kijima, S., Yamashita, M.: Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol. Lect. Notes Comput. Sci. 6490, 491–503 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2012

Authors and Affiliations

  • Ryu Mizoguchi
    • 1
  • Hirotaka Ono
    • 2
  • Shuji Kijima
    • 1
    Email author
  • Masafumi Yamashita
    • 1
  1. 1.Department of InformaticsKyushu UniversityFukuokaJapan
  2. 2.Department of Economic EngineeringKyushu UniversityFukuokaJapan

Personalised recommendations