Gathering and Exclusive Searching on Rings under Minimal Assumptions

Gianlorenzo d'Angelo 1 Alfredo Navarra 1 Nicolas Nisse 2, 3
2 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Consider a set of mobile robots with minimal capabilities placed over distinct nodes of a discrete anonymous ring. Asynchronously, each robot takes a snapshot of the ring, determining which nodes are either occupied by robots or empty. Based on the observed configuration, it decides whether to move to one of its adjacent nodes or not. In the first case, it performs the computed move, eventually. The computation also depends on the required task. In this paper, we solve both the well-known Gathering and Exclusive Searching tasks. In the former problem, all robots must simultaneously occupy the same node, eventually. In the latter problem, the aim is to clear all edges of the graph. An edge is cleared if it is traversed by a robot or if both its endpoints are occupied. We consider the exclusive searching where it must be ensured that two robots never occupy the same node. Moreover, since the robots are oblivious, the clearing is perpetual, i.e., the ring is cleared infinitely often. In the literature, most contributions are restricted to a subset of initial configurations. Here, we design two different algorithms and provide a characterization of the initial configurations that permit the resolution of the problems under minimal assumptions.
Document type :
Conference papers
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download
Contributor : Nicolas Nisse <>
Submitted on : Wednesday, January 15, 2014 - 1:55:33 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Tuesday, April 15, 2014 - 10:44:22 PM


Files produced by the author(s)




Gianlorenzo d'Angelo, Alfredo Navarra, Nicolas Nisse. Gathering and Exclusive Searching on Rings under Minimal Assumptions. 15th International Conference on Distributed Computing and Networking (ICDCN), Jan 2014, Coimbatore, India. pp.149-164, ⟨10.1007/978-3-642-45249-9_10⟩. ⟨hal-00931514⟩



Record views


Files downloads