Distributed consensus over network with noisy links

Behrouz Touri, Angelia Nedich

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

28 Citations (Scopus)

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 - 2009
Externally publishedYes
Event2009 12th International Conference on Information Fusion, FUSION 2009 - Seattle, WA, United States
Duration: Jul 6 2009Jul 9 2009

Other

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

Fingerprint

Telecommunication links
Topology
Statistics
Communication

Keywords

  • Consensus
  • Noisy links
  • Time varying network

ASJC Scopus subject areas

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

Cite this

Touri, B., & Nedich, A. (2009). Distributed consensus over network with noisy links. In 2009 12th International Conference on Information Fusion, FUSION 2009 (pp. 146-154). [5203882]

Distributed consensus over network with noisy links. / Touri, Behrouz; Nedich, Angelia.

2009 12th International Conference on Information Fusion, FUSION 2009. 2009. p. 146-154 5203882.

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

Touri, B & Nedich, A 2009, Distributed consensus over network with noisy links. in 2009 12th International Conference on Information Fusion, FUSION 2009., 5203882, pp. 146-154, 2009 12th International Conference on Information Fusion, FUSION 2009, Seattle, WA, United States, 7/6/09.
Touri B, Nedich A. Distributed consensus over network with noisy links. In 2009 12th International Conference on Information Fusion, FUSION 2009. 2009. p. 146-154. 5203882
Touri, Behrouz ; Nedich, Angelia. / Distributed consensus over network with noisy links. 2009 12th International Conference on Information Fusion, FUSION 2009. 2009. pp. 146-154
@inproceedings{79dce0d798244fdda7bd5c8537f9f7c1,
title = "Distributed consensus over network with noisy links",
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.",
keywords = "Consensus, Noisy links, Time varying network",
author = "Behrouz Touri and Angelia Nedich",
year = "2009",
language = "English (US)",
isbn = "9780982443804",
pages = "146--154",
booktitle = "2009 12th International Conference on Information Fusion, FUSION 2009",

}

TY - GEN

T1 - Distributed consensus over network with noisy links

AU - Touri, Behrouz

AU - Nedich, Angelia

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Consensus

KW - Noisy links

KW - Time varying network

UR - http://www.scopus.com/inward/record.url?scp=70449356565&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449356565&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:70449356565

SN - 9780982443804

SP - 146

EP - 154

BT - 2009 12th International Conference on Information Fusion, FUSION 2009

ER -