This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...