On the Impacts of Redundancy, Diversity, and Trust in Resilient Distributed State Estimation
On the Impacts of Redundancy, Diversity, and Trust in Resilient Distributed State Estimation
复制标题
DOI：
10.1109/tcns.2021.3050032
复制
发表时间：
2020-01
影响因子：
4.2
通讯作者：
A. Mitra;Faiq Ghawash;S. Sundaram;W. Abbas
中科院分区：
文献类型：
--
作者：
A. Mitra;Faiq Ghawash;S. Sundaram;W. Abbas
我们解决了易受攻击的环境中线性动态过程的分布式状态估计问题。最近解决这个问题的尝试对网络的测量和通信资源提出了严格的冗余要求。在本文中，我们通过探索两个互补的方向，朝着减轻此类严格要求迈出了一步：1）使一小部分节点免受攻击，或“可信”； 2) 将多样性纳入网络。我们定义了图论结构，正式捕获了冗余、多样性和信任的概念。基于这些构造，我们开发了一种弹性估计算法，并证明即使是表现出节点多样性或包含一小部分可信节点的相对稀疏的网络，也可以像更密集的网络一样抵御对抗性攻击。最后，给定网络设计的有限预算，我们重点关注（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 article, we take a step toward alleviating such strict requirements by exploring two complementary directions: 1) making a small subset of the nodes immune to attacks, or “trusted;” and 2) 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.