Paper Info
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.
Year
Venue
Keywords
2009
Fusion
graph theory,iterative methods,multi-agent systems,bounded variance,distributed consensus problem,iterative algorithm,noisy communication links,time-varying topology,zero mean,Consensus,noisy links,time varying network
Field
DocType
Citations 
Consensus,Iterative method,Computer science,Upper and lower bounds,Theoretical computer science,Network topology,Expected value,Artificial intelligence,Uniform consensus,Almost surely,Machine learning,Bounded function
Conference
14
PageRank 
References 
Authors
0.80
20
2
Name
Order
Citations
PageRank
Behrouz Touri117621.12
Angelia Nedic22323148.65