On the self-stabilization of mobile oblivious robots in uniform rings

Abstract : We investigate self-stabilizing algorithms for anonymous and oblivious robots in uniform ring networks, that is, we focus on algorithms that can start from any initial configuration (including those with multiplicity points). First, we show that no probabilistic self-stabilizing gathering algorithm exists in the asynchronous (ASYNC) model or if only global-weak and local-strong multiplicity detection is available. This impossibility result implies that a common assumption about initial configurations (no two robots share a node initially) is a very strong one. On the positive side, we give a probabilistic self-stabilizing algorithm for the gathering and orientation problems in the semi-synchronous (SSYNC) model with global-strong multiplicity detection. With respect to impossibility results, those are the weakest system hypotheses. In addition, as an application of the previous algorithm, we provide a self-stabilizing algorithm for the set formation problem. Our results imply that any static set formation can be realized in a self-stabilizing manner in this model.
Complete list of metadatas

Contributor : Sébastien Tixeuil <>
Submitted on : Thursday, March 5, 2015 - 11:58:33 AM
Last modification on : Wednesday, May 15, 2019 - 3:49:04 AM



Fukuhito Ooshita, Sébastien Tixeuil. On the self-stabilization of mobile oblivious robots in uniform rings. Theoretical Computer Science, Elsevier, 2015, 568, pp.84-96. ⟨10.1016/j.tcs.2014.12.008⟩. ⟨hal-01123668⟩



Record views