arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.00164eess.SYcs.SY
收藏

时变网络拓扑下拜占庭弹性分布假设检验

Byzantine-Resilient Distributed Hypothesis Testing With Time-Varying Network Topology

Bo Wu, Steven Carr, Suda Bharadwaj, Zhe Xu, Ufuk Topcu

摘要:

我们研究了在有限的通信和感知范围内的移动代理网络上的分布式假设检验问题,以协同推断真实的假设。特别是,我们考虑的情况下,有一个未知的子集的妥协代理人,可能会故意共享更改信息,以破坏团队的目标。我们提出了两个分布式算法,其中每个代理维护和更新两组信念(即,假设上的概率分布),即局部和实际信念(为了简洁,分别为LB和AB)。在这两种算法中,在每一个时间步,每个代理共享其AB与其他代理在其通信范围内,并作出本地观察更新其LB。在一定条件下,两种算法都可以利用共享信息更新AB。一个要求在每个时刻接收一定数量的共享AB;另一个随着时间的推移累积共享AB,并在共享AB的数量超过规定的阈值后更新。否则,两种算法都依赖于代理的当前LB和AB来更新新的AB。我们证明在温和的假设下,AB为每一个非妥协的代理几乎肯定收敛到真实的假设,而不需要在底层随时间变化的网络拓扑的连接。使用一个模拟的一队无人驾驶飞行器,旨在分类对抗代理之间,我们说明和比较所提出的算法。最后,我们通过实验表明,第二种算法的收敛速度始终优于第一种算法。

英文摘要:

We study the problem of distributed hypothesis testing over a network of mobile agents with limited communication and sensing ranges to infer the true hypothesis collaboratively. In particular, we consider a scenario where there is an unknown subset of compromised agents that may deliberately share altered information to undermine the team objective. We propose two distributed algorithms where each agent maintains and updates two sets of beliefs (i.e., probability distributions over the hypotheses), namely local and actual beliefs (LB and AB respectively for brevity). In both algorithms, at every time step, each agent shares its AB with other agents within its communication range and makes a local observation to update its LB. Then both algorithms can use the shared information to update ABs under certain conditions. One requires receiving a certain number of shared ABs at each time instant; the other accumulates shared ABs over time and updates after the number of shared ABs exceeds a prescribed threshold. Otherwise, both algorithms rely on the agent's current LB and AB to update the new AB. We prove under mild assumptions that the AB for every non-compromised agent converges almost surely to the true hypothesis, without requiring connectivity in the underlying time-varying network topology. Using a simulation of a team of unmanned aerial vehicles aiming to classify adversarial agents among themselves, we illustrate and compare the proposed algorithms. Finally, we show experimentally that the second algorithm consistently outperforms the first algorithm in terms of the speed of convergence.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑