@inproceedings{ccd0dfd3e8c04765b149fb210604cc58,

title = "Selecting a leader in a network of finite state machines",

abstract = "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{\textquoteright}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 = ω(1), then no algorithm in this model can solve k-leader selection with a (positive) constant probability.",

keywords = "And phrases stone age model, Asynchronous scheduler, Beeping communication scheme, Kleader selection, Leader election, Randomized finite state machines",

author = "Yehuda Afek and Yuval Emek and Noa Kolikant",

note = "Publisher Copyright: {\textcopyright} Yehuda Afek, Yuval Emek, and Noa Kolikant.; null ; Conference date: 15-10-2018 Through 19-10-2018",

year = "2018",

month = oct,

day = "1",

doi = "10.4230/LIPIcs.DISC.2018.4",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Ulrich Schmid and Josef Widder",

booktitle = "32nd International Symposium on Distributed Computing, DISC 2018",

}