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

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

Research output: Contribution to journalArticle

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 languageEnglish (US)
Article number6426252
Pages (from-to)2761-2766
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
DOIs
StatePublished - 2012

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Robust average consensus over packet dropping links: Analysis via coefficients of ergodicity'. Together they form a unique fingerprint.

  • Cite this