Sublinear bounds for randomized leader election

Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson*, Amitabh Trehan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

22 Citations (Scopus)


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) rounds and (with high probability) uses only O(√ √nlog<sup>3/2</sup>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) rounds and 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)) time and O(τ(G)n√log<sup>3/2</sup>n) messages, where τ(. 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+. ε, for any small constant ε. >. 0. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Original languageEnglish
Pages (from-to)134-143
Number of pages10
JournalTheoretical Computer Science
Issue numberPart B
Early online date22 Feb 2014
Publication statusPublished - 04 Jan 2015

Bibliographical note

Special Issue on Distributed Computing and Networking


  • Distributed algorithm
  • Leader election
  • Lower bound
  • Randomization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Sublinear bounds for randomized leader election'. Together they form a unique fingerprint.

Cite this