Self-stabilizing Deterministic Gathering - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2009

Self-stabilizing Deterministic Gathering

(1, 2) , (1, 3)
1
2
3

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

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

Cite

Yoann Dieudonné, Franck Petit. Self-stabilizing Deterministic Gathering. [Research Report] 2009. ⟨inria-00381582⟩
253 View
311 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More