Abstract
In this paper, we present a leader election protocol in the population protocol model that stabilizes within O(log n) parallel time in expectation with O(log n) states per agent, where n is the number of agents. Given a rough knowledge m of the population size n such that m = log2 n and m=O(log n), this protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter.
Author supplied keywords
Cite
CITATION STYLE
Sudo, Y., Ooshita, F., Izumi, T., Kakugawa, H., & Masuzawa, T. (2019). Brief announcement: Logarithmic expected-time leader election in population protocol model. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 60–62). Association for Computing Machinery. https://doi.org/10.1145/3293611.3331585
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
