Presentation 2016-12-21
A Loosely-Stabilizing Population Protocol for Maximal Independent Set
Seiken Kiyosu, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Self–stabilizing population protocols are impossible to design for some problems. For example, leader election on complete graphs cannot allow a self–stabilizing solution without knowing the exact number of nodes. To circumvent the impossibility, we previously introduced the concept of loose–stabilization, which relaxes the closure requirement of self–stabilization: a loosely–stabilizing protocol reaches a legitimate configuration in short time even when starting from any initial configuration and stays in legitimate configurations for sufficiently long time (but not forever). Sudo et al. proposed loosely–stabilizing leader election (LE) protocols first for complete graphs and then for arbitrary graphs using the upper bound N of graph size. In this paper, we propose a loosely–stabilizing protocol for the maximal independent set (MIS) on arbitrary graphs, which is another generalization of the first LE protocol concerning the graph topology, since the LE is equivalent to the MIS problem in complete graphs. Our protocol achieves better performance than that for the LE in arbitrary graphs, which is based on the following fact; the MIS is a local problem while the LE is a global problem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Loosely-stabilization / Population protocols / Maximal independent set
Paper # ISEC2016-78,COMP2016-39
Date of Issue 2016-12-14 (ISEC, COMP)

Conference Information
Committee COMP / ISEC
Conference Date 2016/12/21(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Hiroshima University
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Hiroo Itoh(Univ. of Electro-Comm.) / Masahiro Mambo(Kanazawa Univ.)
Vice Chair Yuushi Uno(Osaka Pref. Univ.) / Kazuto Ogawa(NHK) / Atsushi Fujioka(Kanagawa Univ.)
Secretary Yuushi Uno(Seikei Univ.) / Kazuto Ogawa(Kobe Univ.) / Atsushi Fujioka(Toshiba)
Assistant / Toshihiro Ohigashi(Tokai Univ.) / Yuuji Suga(IIJ) / Atsuo Inomata(Tokyo Denki Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing / Technical Committee on Information Security
Language ENG-JTITLE
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Loosely-Stabilizing Population Protocol for Maximal Independent Set
Sub Title (in English)
Keyword(1) Loosely-stabilization
Keyword(2) Population protocols
Keyword(3) Maximal independent set
1st Author's Name Seiken Kiyosu
1st Author's Affiliation Osaka University(Osaka Univ.)
2nd Author's Name Yuichi Sudo
2nd Author's Affiliation Osaka University(Osaka Univ.)
3rd Author's Name Hirotsugu Kakugawa
3rd Author's Affiliation Osaka University(Osaka Univ.)
4th Author's Name Toshimitsu Masuzawa
4th Author's Affiliation Osaka University(Osaka Univ.)
Date 2016-12-21
Paper # ISEC2016-78,COMP2016-39
Volume (vol) vol.116
Number (no) ISEC-380,COMP-381
Page pp.pp.43-49(ISEC), pp.43-49(COMP),
#Pages 7
Date of Issue 2016-12-14 (ISEC, COMP)