.png){kind=icon}
返回
Achieving Robust Average Consensus Over Lossy Wireless Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2018.2800407.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Average consensus over unreliable wireless networks can be impaired by losses. In this paper, we study a novel method to compensate for the lost information, when packet collisions cause transmitter-based random failures. This compensation makes the network converge to the average of the initial states of the network by modifying the weights of the links to accommodate for the topology changes due to packet losses. Additionally, a gain is used to increase the convergence speed, and an analysis of the stability of the network is performed, leading to a criterion to choose such gain to guarantee network stability. For the implementation of the compensation method, we propose a new distributed algorithm, which uses both synchronous and asynchronous mechanisms to achieve consensus and to deal with uncertainty in packet delivery. The theoretical results are then confirmed by simulations.
Keyword:
Cooperative systems
packet loss
wireless communication
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5
论文数:
1.7K
被引数:
5.8K
机构
引用论文
.png){kind=icon}
分享收藏Consistency and complexity of response sequences as a function of schedules of noncontingent reward.
PREAI
分享收藏
查看更多内容