Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering

Abstract : Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with \emph{arbitrary} initial locations and no initial agreement on a global coordinate system, gathering requires that all robots, following their algorithm, reach the exact same but not predetermined location. Gathering is particularly challenging in networks where robots are oblivious (i.e.,~stateless) and direct communication is replaced by observations on their respective locations. Interestingly any algorithm that solves gathering with oblivious robots is inherently self-stabilizing if no assumption is made on the initial distribution of the robots. In this paper, we significantly extend the studies of deterministic gathering feasibility under different assumptions related to synchrony and faults (crash and Byzantine). Unlike prior work, we consider a larger set of scheduling strategies, such as bounded schedulers, and derive interesting lower bounds on these schedulers. In addition, we extend our study to the feasibility of probabilistic self-stabilizing gathering in both fault-free and fault-prone environments.
Type de document :
Pré-publication, Document de travail
This work is under review in Distributed Computing Journal. 2012
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00746087
Contributeur : Maria Potop-Butucaru <>
Soumis le : samedi 27 octobre 2012 - 00:03:07
Dernière modification le : vendredi 31 août 2018 - 09:25:54
Document(s) archivé(s) le : samedi 17 décembre 2016 - 06:00:56

Fichiers

gathering-journal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00746087, version 1
  • ARXIV : 1602.05546

Collections

Citation

Julien Clement, Xavier Défago, Maria Gradinariu Potop-Butucaru, Stephane Messika, Philippe Raipin-Parvedy. Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering. This work is under review in Distributed Computing Journal. 2012. 〈hal-00746087〉

Partager

Métriques

Consultations de la notice

239

Téléchargements de fichiers

174