On the Self-stabilization of Mobile Robots in Graphs - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2007

On the Self-stabilization of Mobile Robots in Graphs

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


Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic autonomous biologic entities. The contribution of this paper is threefold. First, we present a new model for studying mobile entities in networks subject to transient faults. Our model differs from the classical robot model because robots have constraints about the paths they are allowed to follow, and from the classical agent model because the number of agents remains fixed throughout the execution of the protocol. Second, in this model, we study the possibility of designing self-stabilizing algorithms when those algorithms are run by mobile robots (or agents) evolving on a graph. We concentrate on the core building blocks of robot and agents problems: naming and leader election. Not surprisingly, when no constraints are given on the network graph topology and local execution model, both problems are impossible to solve. Finally, using minimal hypothesis with respect to impossibility results, we provide deterministic and probabilistic solutions to both problems, and show equivalence of these problems by an algorithmic reduction mechanism.
Fichier principal
Vignette du fichier
RR-6266.pdf (208.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00166547 , version 1 (07-08-2007)
inria-00166547 , version 2 (08-08-2007)


  • HAL Id : inria-00166547 , version 2
  • ARXIV : 0708.0909


Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil. On the Self-stabilization of Mobile Robots in Graphs. [Research Report] RR-6266, INRIA. 2007, pp.23. ⟨inria-00166547v2⟩
324 View
389 Download



Gmail Facebook Twitter LinkedIn More