论文标题
与多跳交流的弹性共识
Resilient Consensus with Multi-hop Communication
论文作者
论文摘要
在本文中，我们研究了一个多代理网络的弹性共识问题，其中一些节点可能是对抗性的，试图通过传输错误值来防止共识。我们的方法基于所谓的加权平均子序列减少（W-MSR）算法的方法，其特殊重点是它在能够与多跳邻居通信的代理中使用。 MSR算法是在最小的网络结构要求下实现溶解的共识的强大工具，其特征在于稳健图的类别。我们的分析强调，通过多跳通信，可以降低网络连接，尤其是与常见的单跳通信案例相比。此外，我们分析了具有通信延迟的多跳W-MSR算法，因为来自不同多跳的邻居的值可能会在不同的时间步骤到达代理。
In this paper, we study the problem of resilient consensus for a multi-agent network where some of the nodes might be adversarial, attempting to prevent consensus by transmitting faulty values. Our approach is based on that of the so-called weighted mean subsequence reduced (W-MSR) algorithm with a special emphasis on its use in agents capable to communicate with multi-hop neighbors. The MSR algorithm is a powerful tool for achieving resilient consensus under minimal requirements for network structures, characterized by the class of robust graphs. Our analysis highlights that through multi-hop communication, the network connectivity can be reduced especially in comparison with the common one-hop communication case. Moreover, we analyze the multi-hop W-MSR algorithm with delays in communication since the values from different multi-hop neighbors may arrive at the agents at different time steps.
