TY - GEN
T1 - Selecting a leader in a network of finite state machines
AU - Afek, Yehuda
AU - Emek, Yuval
AU - Kolikant, Noa
N1 - Publisher Copyright:
© Yehuda Afek, Yuval Emek, and Noa Kolikant.
PY - 2018/10/1
Y1 - 2018/10/1
N2 - 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 Õ(D) time and succeeds with high probability. The assumption that k is bounded turns out to be unavoidable: we prove that if k = ω(1), then no algorithm in this model can solve k-leader selection with a (positive) constant probability.
AB - 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 Õ(D) time and succeeds with high probability. The assumption that k is bounded turns out to be unavoidable: we prove that if k = ω(1), then no algorithm in this model can solve k-leader selection with a (positive) constant probability.
KW - And phrases stone age model
KW - Asynchronous scheduler
KW - Beeping communication scheme
KW - Kleader selection
KW - Leader election
KW - Randomized finite state machines
UR - http://www.scopus.com/inward/record.url?scp=85059612891&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.DISC.2018.4
DO - 10.4230/LIPIcs.DISC.2018.4
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85059612891
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 32nd International Symposium on Distributed Computing, DISC 2018
A2 - Schmid, Ulrich
A2 - Widder, Josef
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 32nd International Symposium on Distributed Computing, DISC 2018
Y2 - 15 October 2018 through 19 October 2018
ER -