# Exclusive perpetual ring exploration without chirality

4 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : In this paper, we study the exclusive perpetual exploration problem with mobile anonymous and oblivious robots in a discrete space. Our results hold for the most generic settings: robots are asynchronous and are not given any sense of direction, so the left and right sense (\emph{i.e.} chirality) is decided by the adversary that schedules robots for execution, and may change between invocations of a particular robots (as robots are oblivious). We investigate both the minimal and the maximal number of robots that are necessary and sufficient to solve the exclusive perpetual exploration problem. On the minimal side, we prove that three deterministic robots are necessary and sufficient, provided that the size $n$ of the ring is at least $10$, and show that no protocol with three robots can exclusively perpetually explore a ring of size less than $10$. On the maximal side, we prove that $k=n-5$ robots are necessary and sufficient to exclusively perpetually explore a ring of size $n$ when $n$ is co-prime with $k$.
Keywords :
Type de document :
Rapport
[Research Report] Université d'Evry Val d'Essonne. 2010, pp.17
Domaine :

Littérature citée [8 références]

https://hal.inria.fr/inria-00464206
Contributeur : Maria Potop-Butucaru <>
Soumis le : mardi 16 mars 2010 - 14:14:41
Dernière modification le : vendredi 31 août 2018 - 09:25:54
Document(s) archivé(s) le : vendredi 19 octobre 2012 - 10:00:19

### Fichier

perpetual-last.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : inria-00464206, version 1

### Citation

Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil. Exclusive perpetual ring exploration without chirality. [Research Report] Université d'Evry Val d'Essonne. 2010, pp.17. 〈inria-00464206〉

### Métriques

Consultations de la notice

## 457

Téléchargements de fichiers