Consensus with quantized information updates

Akshay Kashyap, T. Basar, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 averaging in a network with finite capacity channels (and in this form has applications to the computation of sufficient statistics in various sensing problems) 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 obtain bounds on the convergence time of these algorithms for fully connected networks and linear networks.

Original languageEnglish (US)
Title of host publicationProceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2728-2733
Number of pages6
ISBN (Print)1424401712, 9781424401710
DOIs
StatePublished - Jan 1 2006
Event45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States
Duration: Dec 13 2006Dec 15 2006

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other45th IEEE Conference on Decision and Control 2006, CDC
Country/TerritoryUnited States
CitySan Diego, CA
Period12/13/0612/15/06

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Consensus with quantized information updates'. Together they form a unique fingerprint.

Cite this