Gathering an even number of robots in an odd ring without global multiplicity detection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2012

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.
Fichier principal
Vignette du fichier
TechnicalReport.pdf (232.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00709074 , version 1 (17-06-2012)

Identifiers

Cite

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⟩
113 View
94 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More