Abstract
Packet loss is a serious issue in wireless consensus networks, as even few failures might prevent a network to converge to the correct value. However, it is possible to compensate for the errors caused by packet collisions, by modifying the updating weights. Such a modification compensates for the loss of information in an unreliable network, but results in a reduced convergence speed. In this paper, we propose a faster method — based on a suitable gain in the consensus dynamics — to solve the unreliable average consensus problem. We find a sufficient condition for the gain to preserve stability of the network. Simulations are used to discuss the choice of the gain, and to compare our method with the literature.
| Original language | English |
|---|---|
| Pages | 3569 - 3574 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 12 Dec 2017 |
| Event | 56th IEEE Annual Conference on Decision and Control, CDC 2017 - Melbourne Convention Center, Melbourne, Australia Duration: 12 Dec 2017 → 15 Dec 2017 Conference number: 56 http://cdc2017.ieeecss.org/ |
Conference
| Conference | 56th IEEE Annual Conference on Decision and Control, CDC 2017 |
|---|---|
| Abbreviated title | CDC 2017 |
| Country/Territory | Australia |
| City | Melbourne |
| Period | 12/12/17 → 15/12/17 |
| Internet address |
Fingerprint
Dive into the research topics of 'Using a linear gain to accelerate average consensus over unreliable networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver