This book aims at being a comprehensive and pedagogical introduction to the concept of
self-stabilization, introduced by Edsger Wybe Dijkstra in 1973. Self-stabilization …

Dijkstra defined a distributed system to be self-stabilizing if, regardless of the initial state, the
system is guaranteed to reach a legitimate (correct) state in a finite time. Even though the …

Ad hoc networks consist of wireless hosts that communicate with each other in the absence
of a fixed infrastructure. Such networks cannot rely on centralized and organized network …

In this paper, we revisit two fundamental results of the self-stabilizing literature about silent
BFS spanning tree constructions: the Dolev et al. algorithm and the Huang and Chen's …

Given an arbitrary network G of processes with unique IDs and no designated leader, and
given a k-dominating set ICG, we propose a silent self-stabilizing distributed algorithm that …

In wireless ad hoc or sensor networks, a connected dominating set is useful as the virtual
backbone because there is no fixed infrastructure or centralized management. Additionally …

Given two functions f and g mapping nodes to non-negative integers, we give a silent self-
stabilizing algorithm that computes a minimal (f, g)-alliance in an asynchronous network with …

We propose an univesal scheme to design loop-free and super-stabilizing protocols for
constructing spanning trees optimizing any tree metrics (not only those that are isomorphic …

In wireless ad hoc or sensor networks, a connected dominating set (CDS) is useful as the
virtual backbone because there is no fixed infrastructure or centralized management …

We propose a self-stabilizing reset algorithm working in anonymous networks. This
algorithm resets the network in a distributed non-centralized manner, as each process …