Abstract
In this paper, we present the first leader election protocol in the population protocol model that stabilizes within (Formula presented) parallel time in expectation with (Formula presented) states per agent, where n is the number of agents. Given a rough knowledge m of the population size n such that (Formula presented) and (Formula presented), the proposed protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter.
Cite
CITATION STYLE
Sudo, Y., Ooshita, F., Izumi, T., Kakugawa, H., & Masuzawa, T. (2019). Logarithmic Expected-Time Leader Election in Population Protocol Model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11914 LNCS, pp. 323–337). Springer. https://doi.org/10.1007/978-3-030-34992-9_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
