Self-stabilizing robots in highly dynamic environments

This paper deals with the classical problem of exploring a ring by a cohort of synchronous robots. We focus on the perpetual version of this problem in which it is required that each node of the ring is visited by a robot infinitely often. The challenge in this paper is twofold. First, we assume tha...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2019-06, Vol.772, p.88-110
Hauptverfasser:	Bournat, Marjorie, Datta, Ajoy K., Dubois, Swan
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science Distributed, Parallel, and Cluster Computing Evolving graphs Fully synchronous robots Highly dynamic graphs Perpetual exploration Self-stabilizing algorithm
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!