Quantized consensus

Akshay Kashyap, Tamer Başar, R. Srikant

Research output: Contribution to journalArticlepeer-review


We study the distributed averaging problem on arbitrary connected graphs, with the additional constraint that the value at each node is an integer. This discretized distributed averaging problem models several problems of interest, such as averaging in a network with finite capacity channels and load balancing in a processor network. We describe simple randomized distributed algorithms which achieve consensus to the extent that the discrete nature of the problem permits. We give bounds on the convergence time of these algorithms for fully connected networks and linear networks.

Original languageEnglish (US)
Pages (from-to)1192-1203
Number of pages12
Issue number7
StatePublished - Jul 2007


  • Clock synchronization
  • Distributed detection
  • Estimation algorithms
  • Quantization
  • Random processes
  • Sensor fusion
  • Stochastic systems

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering


Dive into the research topics of 'Quantized consensus'. Together they form a unique fingerprint.

Cite this