Fast Approximate Counting and Leader Election in Populations

We study the problems of leader election and population size counting for population protocols: networks of finite-state anonymous agents that interact randomly under a uniform random scheduler. We show a protocol for leader election that terminates in O(logm(n) · log2 n) parallel time, where m is a parameter, using O(max{m, logn}) states. By adjusting the… (More)

3 Figures & Tables