Logarithmic Expected-Time Leader Election in Population Protocol Model
Abstract
In this paper, the leader election problem in the population protocol model is considered. A leader election protocol with logarithmic stabilization time is given. Given a rough knowledge m of the population size n such that m >= 2 n and m=O(log n), the proposed protocol guarantees that exactly one leader is elected from n agents within O(log n) parallel time in expectation and the unique leader is kept forever thereafter. The number of states per agent of the protocol is O(log n).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.