Sublinear bounds for randomized leader election
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n -node networks that runs in O(1) O ( 1 ) rounds and (with high probability) uses only O ( n log 3 / 2 ? n ) messages to elect a unique leader (with high probability). When considering the explicit variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) O ( 1 ) rounds and O(n) O ( n ) messages. This algorithm is then extended to one solving leader election on any connected non-bipartite n-node graph G  in O(?(G)) O ( ? ( G ) ) time and O ( ? ( G ) n log 3 / 2 ? n ) messages, where ?(G) ? ( G ) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficient deterministic  leader election algorithms. Finally, we present an almost matching lower bound for randomized leader election, showing that ? ( n ) messages are needed for any leader election algorithm that succeeds with probability at least 1/e+? 1 / e + ? , for any small constant ?>0 ? > 0 . We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.
randomization leader election lower bound distributed algorithm