Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol

Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper investigates the space complexity of a self stabilizing leader election in a mediated population protocol (SS-LE MPP). Cai, Izumi and Wada (2009) showed that SS-LE in a population protocol (SS-LE PP) for n agents requires at least n agent-states, and gave a SS-LE PP with n agent-states for n agents. MPP is a model of distributed computation, introduced by Chatzigiannakis, Michail and Spirakis (2009) as an extension of PP allowing an extra memory on every agents pair. While they showed that MPP is stronger than PP in general, it was not known if a MPP can really reduce the space complexity of SS-LE with respect to agent-states. We in this paper give a SS-LE MPP with (2/3)n agent-states and a single bit memory on every agents pair for n agents. We also show that there is no SS-LE MPP with any constant agent-states and any constant size memory on each agents-pair for general n agents.

Original languageEnglish
Title of host publicationPrinciples of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings
Pages491-503
Number of pages13
DOIs
Publication statusPublished - Dec 1 2010
Event14th International Conference on Principles of Distributed Systems, OPODIS 2010 - Tozeur, Tunisia
Duration: Dec 14 2010Dec 17 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6490 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th International Conference on Principles of Distributed Systems, OPODIS 2010
CountryTunisia
CityTozeur
Period12/14/1012/17/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol'. Together they form a unique fingerprint.

  • Cite this

    Mizoguchi, R., Ono, H., Kijima, S., & Yamashita, M. (2010). Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol. In Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings (pp. 491-503). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6490 LNCS). https://doi.org/10.1007/978-3-642-17653-1_35