eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-10-04
4:1
4:17
10.4230/LIPIcs.DISC.2018.4
article
Selecting a Leader in a Network of Finite State Machines
Afek, Yehuda
1
Emek, Yuval
2
Kolikant, Noa
1
Tel Aviv University, Tel Aviv, Israel
Technion - Israel Institute of Technology, Haifa, Israel
This paper studies a variant of the leader election problem under the stone age model (Emek and Wattenhofer, PODC 2013) that considers a network of n randomized finite automata with very weak communication capabilities (a multi-frequency asynchronous generalization of the beeping model's communication scheme). Since solving the classic leader election problem is impossible even in more powerful models, we consider a relaxed variant, referred to as k-leader selection, in which a leader should be selected out of at most k initial candidates. Our main contribution is an algorithm that solves k-leader selection for bounded k in the aforementioned stone age model. On (general topology) graphs of diameter D, this algorithm runs in O~(D) time and succeeds with high probability. The assumption that k is bounded turns out to be unavoidable: we prove that if k = omega (1), then no algorithm in this model can solve k-leader selection with a (positive) constant probability.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol121-disc2018/LIPIcs.DISC.2018.4/LIPIcs.DISC.2018.4.pdf
stone age model
beeping communication scheme
leader election
k-leader selection
randomized finite state machines
asynchronous scheduler