Self-stabilizing Deterministic Gathering - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2009

Self-stabilizing Deterministic Gathering

Résumé

In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a deterministic self-stabilizing algorithm solving GP for n robots if, and only if, n is odd.
Fichier principal
Vignette du fichier
paper.pdf (169.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00381582 , version 1 (05-05-2009)

Identifiants

  • HAL Id : inria-00381582 , version 1
  • ARXIV : 0905.0747

Citer

Yoann Dieudonné, Franck Petit. Self-stabilizing Deterministic Gathering. [Research Report] 2009. ⟨inria-00381582⟩
255 Consultations
329 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More