Journal article

Stochastic consensus over noisy networks with Markovian and arbitrary switches

M Huang, S Dey, GN Nair, JH Manton

Automatica | PERGAMON-ELSEVIER SCIENCE LTD | Published : 2010

Abstract

This paper considers stochastic consensus problems over lossy wireless networks. We first propose a measurement model with a random link gain, additive noise, and Markovian lossy signal reception, which captures uncertain operational conditions of practical networks. For consensus seeking, we apply stochastic approximation and derive a Markovian mode dependent recursive algorithm. Mean square and almost sure (i.e., probability one) convergence analysis is developed via a state space decomposition approach when the coefficient matrix in the algorithm satisfies a zero row and column sum condition. Subsequently, we consider a model with arbitrary random switching and a common stochastic Lyapuno..

View full abstract

University of Melbourne Researchers

Grants

Funding Acknowledgements

This work was partially supported by the Natural Sciences and Engineering Research Council of Canada and the Australian Research Council. This paper was not presented at any IFAC meeting. This paper was recommended for publication in revised form by Associate Editor Hideaki Ishii under the direction of Editor Ian R. Petersen.