In this paper, a fully distributed averaging algorithm in the presence of adversarial Byzantine agents is proposed. The algorithm is based on a resilient retrieval procedure, where all non-Byzantine nodes send their own initial values and retrieve those of other agents. We establish that the convergence of the proposed algorithm relies on strong robustness of the graph for locally bounded adversaries. A topology analysis in terms of time complexity and relation between connectivity metrics is also presented. Simulation results are provided to verify the effectiveness of the proposed algorithms under prescribed graph conditions.

中文翻译：

---

弹性分布式平均

在本文中，提出了一种在对抗性拜占庭代理存在的情况下的完全分布式平均算法。该算法基于弹性检索程序，其中所有非拜占庭节点发送自己的初始值并检索其他代理的初始值。我们确定所提出算法的收敛性依赖于图对局部有界对手的强大鲁棒性。还提出了在时间复杂度和连接度量之间的关系方面的拓扑分析。仿真结果验证了所提出算法在规定的图形条件下的有效性。