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

多Agent网络中偏置攻击的分布式检测与抑制

Distributed Detection and Mitigation of Biasing Attacks over Multi-Agent Networks

Mohammadreza Doostmohammadian, Houman Zarrabi, Hamid R. Rabiee, Usman A. Khan, Themistoklis Charalambous

摘要:

本文提出了一种分布式攻击检测和缓解技术的基础上分布式估计在多代理网络,代理采取部分系统测量容易受到(可能的)偏见攻击。特别是,我们假设系统是不是局部可观察的,通过在任何代理的直接邻域中的测量。首先,在无攻击的情况下的性能分析,我们证明了所提出的分布式估计是无偏的有界均方差在稳态。然后,我们提出了一个基于残差的策略,本地检测可能的攻击代理。与文献中假设噪声支持上界的确定性阈值相反,我们在概率意义上定义了残差上的阈值。在检测和隔离被攻击的Agent后,提出了一种基于系统有向图的缓解策略,用一个新的观测等价的度量来替换被攻击的Agent,以恢复潜在的可观测性损失.我们采用图论的方法来分类的代理基于他们的测量,恢复系统的秩不足和恢复系统的有向图的输出连接的代理之间的区别。攻击检测/缓解策略,具体描述了每种类型,这是多项式阶复杂的大规模应用程序。说明性的模拟支持我们的理论结果。

英文摘要:

This paper proposes a distributed attack detection and mitigation technique based on distributed estimation over a multi-agent network, where the agents take partial system measurements susceptible to (possible) biasing attacks. In particular, we assume that the system is not locally observable via the measurements in the direct neighborhood of any agent. First, for performance analysis in the attack-free case, we show that the proposed distributed estimation is unbiased with bounded mean-square deviation in steady-state. Then, we propose a residual-based strategy to locally detect possible attacks at agents. In contrast to the deterministic thresholds in the literature assuming an upper bound on the noise support, we define the thresholds on the residuals in a probabilistic sense. After detecting and isolating the attacked agent, a system-digraph-based mitigation strategy is proposed to replace the attacked measurement with a new observationally-equivalent one to recover potential observability loss. We adopt a graph-theoretic method to classify the agents based on their measurements, to distinguish between the agents recovering the system rank-deficiency and the ones recovering output-connectivity of the system digraph. The attack detection/mitigation strategy is specifically described for each type, which is of polynomial-order complexity for large-scale applications. Illustrative simulations support our theoretical results.

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

↑