Self-stabilizing leader election
Journal
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Pages
53-59
Date Issued
2019
Author(s)
Chen, H.-P.
Abstract
In this paper, we study the self-stabilizing leader election (SSLE) problem in population protocols. We construct a non-deterministic population protocol that can solve SSLE on directed rings of all sizes. Our algorithm uses a constant number of states and can be converted to a deterministic population protocol on undirected rings using previous techniques [8]. Furthermore, we extend our algorithm to perform SSLE on directed and undirected tori of arbitrary sizes.
SDGs
Type
conference paper