arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.07056eess.SYcs.SYmath.OC
收藏

冗余、多样性和信任对弹性分布式状态估计的影响

On the Impacts of Redundancy, Diversity, and Trust in Resilient Distributed State Estimation

Aritra Mitra, Faiq Ghawash, Shreyas Sundaram, Waseem Abbas

摘要:

本文研究了易受攻击环境下线性动态过程的分布式状态估计问题。最近试图解决这个问题强加了严格的冗余要求的测量和网络的通信资源。在本文中,我们采取了一个步骤,以减轻这种严格的要求,探索两个互补的方向:(i)使一小部分的节点免疫攻击,或“可信”,(ii)将多样性纳入网络。我们定义了图论的结构,正式捕获冗余,多样性和信任的概念。基于这些结构,我们开发了一个弹性估计算法,并证明了即使是相对稀疏的网络,无论是表现出节点多样性,或包含一个小的子集的可信节点,可以作为更密集的网络对抗性攻击的弹性。最后,在网络设计预算有限的情况下,我们重点研究了(i)选择一组可信节点和(ii)分配多样性的复杂性,以达到所需的鲁棒性水平。不幸的是,我们确定这些问题中的每一个都是NP完全的。

英文摘要:

We address the problem of distributed state estimation of a linear dynamical process in an attack-prone environment. Recent attempts to solve this problem impose stringent redundancy requirements on the measurement and communication resources of the network. In this paper, we take a step towards alleviating such strict requirements by exploring two complementary directions: (i) making a small subset of the nodes immune to attacks, or "trusted", and (ii) incorporating diversity into the network. We define graph-theoretic constructs that formally capture the notions of redundancy, diversity, and trust. Based on these constructs, we develop a resilient estimation algorithm and demonstrate that even relatively sparse networks that either exhibit node-diversity, or contain a small subset of trusted nodes, can be just as resilient to adversarial attacks as more dense networks. Finally, given a finite budget for network design, we focus on characterizing the complexity of (i) selecting a set of trusted nodes, and (ii) allocating diversity, so as to achieve a desired level of robustness. We establish that, unfortunately, each of these problems is NP-complete.

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

↑