### 抄録

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 (PP_{k}). Beauquier et al. (2012) recently introduced the model, and showed a hierarchy of computational powers of PP_{k} with respect to k; a PP_{k+1} is strictly more powerful than a PP_{k}. Motivated by a further understanding of the model, this paper investigates the space complexity of PP_{k} 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., PP_{2}) is exactly n. This paper shows that the space complexity of SS-LE for n agents by a PP_{k} is exactly ⌈(n - 1)/(k - 1)⌉ + 1.

元の言語 | 英語 |
---|---|

ホスト出版物のタイトル | Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings |

ページ | 86-97 |

ページ数 | 12 |

DOI | |

出版物ステータス | 出版済み - 12 1 2013 |

イベント | 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013 - Osaka, 日本 継続期間: 11 13 2013 → 11 16 2013 |

### 出版物シリーズ

名前 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

巻 | 8255 LNCS |

ISSN（印刷物） | 0302-9743 |

ISSN（電子版） | 1611-3349 |

### その他

その他 | 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013 |
---|---|

国 | 日本 |

市 | Osaka |

期間 | 11/13/13 → 11/16/13 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### これを引用

*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); 巻数 8255 LNCS). https://doi.org/10.1007/978-3-319-03089-0_7

**Space complexity of self-stabilizing leader election in population protocol based on k-interaction.** / Xu, Xiaoguang; Yamauchi, Yukiko; Kijima, Shuji; Yamashita, Masafumi.

研究成果: 著書/レポートタイプへの貢献 › 会議での発言

*Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 8255 LNCS, pp. 86-97, 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013, Osaka, 日本, 11/13/13. https://doi.org/10.1007/978-3-319-03089-0_7

}

TY - GEN

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

AU - Xu, Xiaoguang

AU - Yamauchi, Yukiko

AU - Kijima, Shuji

AU - Yamashita, Masafumi

PY - 2013/12/1

Y1 - 2013/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84893904462&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893904462&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-03089-0_7

DO - 10.1007/978-3-319-03089-0_7

M3 - Conference contribution

AN - SCOPUS:84893904462

SN - 9783319030883

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 86

EP - 97

BT - Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings

ER -