Distributed consensus over network with noisy links

  • Touri B
  • Nedic A
  • 17


    Mendeley users who have this article in their library.
  • 21


    Citations of this article.


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

Author-supplied keywords

  • Consensus
  • noisy links
  • time varying network

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • B. Touri

  • a. Nedic

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free