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(n 2) asynchronous rounds.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-00934132
Contributor : Sébastien Tixeuil <>
Submitted on : Tuesday, January 21, 2014 - 3:46:54 PM
Last modification on : Tuesday, May 14, 2019 - 10:14:33 AM

Links full text

Identifiers

Citation

Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil. Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection. Mathematical Foundations of Computer Science, Aug 2012, Bratislava, Slovakia. pp.542-553, ⟨10.1007/978-3-642-32589-2_48⟩. ⟨hal-00934132⟩

Share

Metrics

Record views

576