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.
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00709074
Contributeur : Anissa Lamani <>
Soumis le : dimanche 17 juin 2012 - 15:22:29
Dernière modification le : jeudi 11 janvier 2018 - 06:14:33
Document(s) archivé(s) le : mardi 18 septembre 2012 - 02:22:21

Fichiers

TechnicalReport.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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

Collections

LIP6 | UPMC | LARA

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〉

Partager

Métriques

Consultations de la notice

152

Téléchargements de fichiers

71