Self-stabilizing Deterministic Gathering

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.
Document type :
Reports
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00381582
Contributor : Yoann Dieudonné <>
Submitted on : Tuesday, May 5, 2009 - 11:13:11 PM
Last modification on : Wednesday, July 10, 2019 - 9:54:29 AM
Long-term archiving on : Thursday, June 10, 2010 - 10:47:58 PM

Files

paper.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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

Share

Metrics

Record views

372

Files downloads

378