Huang, Minyi, Dey, Subhrakanti, Nair, Girish N. and Manton, Jonathan H. (2010) Stochastic consensus over noisy networks with Markovian and arbitrary switches. Automatica, 46 (10). pp. 1571-1583. ISSN 0005-1098
Preview
Available under License Creative Commons Attribution Non-commercial Share Alike.
Download (992kB) | Preview
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
Lyapunov function technique is used to prove convergence. Finally,our method is applied to models with
heterogeneous quantizers and packet losses, and convergence results are proved.
| Item Type: | Article |
|---|---|
| Keywords: | Consensus; Measurement noises; Markovian lossy channels; Stochastic approximation; Quantized data; Packet losses; |
| Academic Unit: | Faculty of Science and Engineering > Electronic Engineering |
| Item ID: | 12714 |
| Identification Number: | 10.1016/j.automatica.2010.06.016 |
| Depositing User: | Subhrakanti Dey |
| Date Deposited: | 07 Apr 2020 09:07 |
| Journal or Publication Title: | Automatica |
| Publisher: | Elsevier |
| Refereed: | Yes |
| Related URLs: | |
| Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Downloads
Downloads per month over past year
Share and Export
Share and Export