奇数長リング上で偶数台ロボットを集結させる局所弱多重度検出のみのプロトコル
Gathering an even number of robots in an odd ring without global multiplicity detection
奇数個のノードからなるリング上で、偶数台の匿名・忘却型ロボットを非同期CORDAモデルで集結させるプロトコルを提案。対称だが非周期的な初期配置を許容し、局所的な弱い多重度検出のみを用いる。
著者: Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil
分類: cs.DC, cs.RO
原文アブストラクト
We propose a gathering protocol for an even number of robots in a ring-shaped network that allows symmetric but not periodic configurations as initial configurations, yet uses only local weak multiplicity detection. Robots are assumed to be anonymous and oblivious, and the execution model is the non- atomic CORDA model with asynchronous fair scheduling. In our scheme, the number of robots k must be greater than 8, the number of nodes n on a network must be odd and greater than k+3. The running time of our protocol is O(n2) asynchronous rounds.
