Space complexity of self-stabilizing leader election in population protocol based on k-interaction

Xiaoguang Xu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

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

8 Citations (Scopus)

Abstract

Population protocol (PP) is a distributed computing model for passively mobile systems, in which a computation is executed by interactions between two agents. This paper is concerned with an extended model, population protocol based on interactions of at most k agents (PPk). Beauquier et al. (2012) recently introduced the model, and showed a hierarchy of computational powers of PPk with respect to k; a PPk+1 is strictly more powerful than a PPk. Motivated by a further understanding of the model, this paper investigates the space complexity of PPk for self-stabilizing leader election (SS-LE), which is a fundamental problem for a distributed system. Cai et al. (2012) showed that the space complexity of SS-LE for n agents by a PP (i.e., PP2) is exactly n. This paper shows that the space complexity of SS-LE for n agents by a PPk is exactly ⌈(n - 1)/(k - 1)⌉ + 1.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings
Pages86-97
Number of pages12
DOIs
Publication statusPublished - Dec 1 2013
Event15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013 - Osaka, Japan
Duration: Nov 13 2013Nov 16 2013

Publication series

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

Other

Other15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013
CountryJapan
CityOsaka
Period11/13/1311/16/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Space complexity of self-stabilizing leader election in population protocol based on k-interaction'. Together they form a unique fingerprint.

  • Cite this

    Xu, X., Yamauchi, Y., Kijima, S., & Yamashita, M. (2013). Space complexity of self-stabilizing leader election in population protocol based on k-interaction. In Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings (pp. 86-97). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8255 LNCS). https://doi.org/10.1007/978-3-319-03089-0_7