### 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 language | English (US) |
---|---|

Title of host publication | 2009 12th International Conference on Information Fusion, FUSION 2009 |

Pages | 146-154 |

Number of pages | 9 |

State | Published - 2009 |

Externally published | Yes |

Event | 2009 12th International Conference on Information Fusion, FUSION 2009 - Seattle, WA, United States Duration: Jul 6 2009 → Jul 9 2009 |

### Other

Other | 2009 12th International Conference on Information Fusion, FUSION 2009 |
---|---|

Country | United States |

City | Seattle, WA |

Period | 7/6/09 → 7/9/09 |

### Fingerprint

### Keywords

- Consensus
- Noisy links
- Time varying network

### ASJC Scopus subject areas

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

### Cite this

*2009 12th International Conference on Information Fusion, FUSION 2009*(pp. 146-154). [5203882]

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -