Distributed consensus over network with noisy links

Behrouz Touri, Angelia Nedić

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

35 Scopus citations

Abstract

We consider a distributed consensus problem where a set of agents want to agree on a common value through local computations and communications. We assume that agents communicate over a network with time-varying topology and noisy communication links. We are interested in the case when the link noise is independent in time, and it has zero mean and bounded variance. We present and study an iterative algorithm with a diminishing stepsize. We show that the algorithm converges in expectation and almost surely to a "random" consensus, and we characterize the statistics of the consensus. In particular, we give the expected value of the consensus and provide an upper bound on its variance.

Original languageEnglish (US)
Title of host publication2009 12th International Conference on Information Fusion, FUSION 2009
Pages146-154
Number of pages9
StatePublished - Nov 18 2009
Externally publishedYes
Event2009 12th International Conference on Information Fusion, FUSION 2009 - Seattle, WA, United States
Duration: Jul 6 2009Jul 9 2009

Publication series

Name2009 12th International Conference on Information Fusion, FUSION 2009

Other

Other2009 12th International Conference on Information Fusion, FUSION 2009
Country/TerritoryUnited States
CitySeattle, WA
Period7/6/097/9/09

Keywords

  • Consensus
  • Noisy links
  • Time varying network

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Information Systems
  • Software

Fingerprint

Dive into the research topics of 'Distributed consensus over network with noisy links'. Together they form a unique fingerprint.

Cite this