Almost logarithmic-time space optimal leader election in population protocols



Gąsieniec, Leszek, Stachowiak, Grzegorz and Uznański, Przemysław
(2018) Almost logarithmic-time space optimal leader election in population protocols. [Report]

[img] Text
1802.06867v1.pdf - OA Published Version

Download (253kB)

Abstract

The model of population protocols refers to a large collection of simple indistinguishable entities, frequently called {\em agents}. The agents communicate and perform computation through pairwise interactions. We study fast and space efficient leader election in population of cardinality $n$ governed by a random scheduler, where during each time step the scheduler uniformly at random selects for interaction exactly one pair of agents. We propose the first $o(\log^2 n)$-time leader election protocol. Our solution operates in expected parallel time $O(\log n\log\log n)$ which is equivalent to $O(n \log n\log\log n)$ pairwise interactions. This is the fastest currently known leader election algorithm in which each agent utilises asymptotically optimal number of $O(\log\log n)$ states. The new protocol incorporates and amalgamates successfully the power of assorted {\em synthetic coins} with variable rate {\em phase clocks}.

Item Type: Report
Uncontrolled Keywords: cs.DC, cs.DC
Depositing User: Symplectic Admin
Date Deposited: 05 Mar 2018 07:25
Last Modified: 29 Apr 2022 05:12
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3018607