Gathering an even number of robots in an odd ring without global multiplicity detection

Abstract : 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.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-00709074
Contributor : Anissa Lamani <>
Submitted on : Sunday, June 17, 2012 - 3:22:29 PM
Last modification on : Thursday, March 21, 2019 - 2:18:24 PM
Long-term archiving on : Tuesday, September 18, 2012 - 2:22:21 AM

Files

TechnicalReport.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00709074, version 1
  • ARXIV : 1207.7241

Citation

Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil. Gathering an even number of robots in an odd ring without global multiplicity detection. [Research Report] 2012. ⟨hal-00709074⟩

Share

Metrics

Record views

195

Files downloads

182