Robust average consensus over packet dropping links: Analysis via coefficients of ergodicity

Nitin H. Vaidya; Christoforos N. Hadjicostis; Alejandro D. Dominguez-Garcia

doi:10.1109/CDC.2012.6426252

Robust average consensus over packet dropping links: Analysis via coefficients of ergodicity

Nitin H. Vaidya, Christoforos N. Hadjicostis, Alejandro D. Dominguez-Garcia

Research output: Contribution to journal › Conference article › peer-review

Abstract

We consider a networked system in which each component (node) iteratively exchanges information with its neighbors according to an arbitrary, possibly directed topology. Based on an iterative exchange of (local and possibly directed) information, we develop an average-consensus distributed algorithm that is robust to unreliable (packet-dropping) communication links. By introducing virtual nodes, we show that the execution of the proposed algorithm is mathematically equivalent to a finite inhomogenous Markov chain. Then, by using coefficients of ergodicity, we can prove convergence of the robust distributed algorithm to the exact average, in the presence of packet drops and under a very broad set of conditions.

Original language	English (US)
Article number	6426252
Pages (from-to)	2761-2766
Number of pages	6
Journal	Proceedings of the IEEE Conference on Decision and Control
DOIs	https://doi.org/10.1109/CDC.2012.6426252
State	Published - 2012
Event	51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States Duration: Dec 10 2012 → Dec 13 2012

ASJC Scopus subject areas

Control and Systems Engineering
Modeling and Simulation
Control and Optimization

Online availability

10.1109/CDC.2012.6426252

Library availability

Discover UIUC Full Text

Cite this

@article{94ce5a3cad6040c5a29e8624651567c5,

title = "Robust average consensus over packet dropping links: Analysis via coefficients of ergodicity",

abstract = "We consider a networked system in which each component (node) iteratively exchanges information with its neighbors according to an arbitrary, possibly directed topology. Based on an iterative exchange of (local and possibly directed) information, we develop an average-consensus distributed algorithm that is robust to unreliable (packet-dropping) communication links. By introducing virtual nodes, we show that the execution of the proposed algorithm is mathematically equivalent to a finite inhomogenous Markov chain. Then, by using coefficients of ergodicity, we can prove convergence of the robust distributed algorithm to the exact average, in the presence of packet drops and under a very broad set of conditions.",

author = "Vaidya, {Nitin H.} and Hadjicostis, {Christoforos N.} and Dominguez-Garcia, {Alejandro D.}",

year = "2012",

doi = "10.1109/CDC.2012.6426252",

language = "English (US)",

pages = "2761--2766",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "51st IEEE Conference on Decision and Control, CDC 2012 ; Conference date: 10-12-2012 Through 13-12-2012",

}

TY - JOUR

T1 - Robust average consensus over packet dropping links

T2 - 51st IEEE Conference on Decision and Control, CDC 2012

AU - Vaidya, Nitin H.

AU - Hadjicostis, Christoforos N.

AU - Dominguez-Garcia, Alejandro D.

PY - 2012

Y1 - 2012

N2 - We consider a networked system in which each component (node) iteratively exchanges information with its neighbors according to an arbitrary, possibly directed topology. Based on an iterative exchange of (local and possibly directed) information, we develop an average-consensus distributed algorithm that is robust to unreliable (packet-dropping) communication links. By introducing virtual nodes, we show that the execution of the proposed algorithm is mathematically equivalent to a finite inhomogenous Markov chain. Then, by using coefficients of ergodicity, we can prove convergence of the robust distributed algorithm to the exact average, in the presence of packet drops and under a very broad set of conditions.

AB - We consider a networked system in which each component (node) iteratively exchanges information with its neighbors according to an arbitrary, possibly directed topology. Based on an iterative exchange of (local and possibly directed) information, we develop an average-consensus distributed algorithm that is robust to unreliable (packet-dropping) communication links. By introducing virtual nodes, we show that the execution of the proposed algorithm is mathematically equivalent to a finite inhomogenous Markov chain. Then, by using coefficients of ergodicity, we can prove convergence of the robust distributed algorithm to the exact average, in the presence of packet drops and under a very broad set of conditions.

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

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

U2 - 10.1109/CDC.2012.6426252

DO - 10.1109/CDC.2012.6426252

M3 - Conference article

AN - SCOPUS:84874253281

SN - 0191-2216

SP - 2761

EP - 2766

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

M1 - 6426252

Y2 - 10 December 2012 through 13 December 2012

ER -

Robust average consensus over packet dropping links: Analysis via coefficients of ergodicity

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this