2020/01/20 by Aritra Mitra, Mitra, Aritra, Faiq Ghawash +5 · 2 citations
Engineering · #FOS: Electrical engineering #FOS: Mathematics #Infrastructure Resilience and Vulnerability Analysis #Optimization and Control (math.OC) #Smart Grid Security and Resilience #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2001.07056
openalex publication_date 2020/01/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We address the problem of distributed state estimation of a linear dynamical\nprocess in an attack-prone environment. Recent attempts to solve this problem\nimpose stringent redundancy requirements on the measurement and communication\nresources of the network. In this paper, we take a step towards alleviating\nsuch strict requirements by exploring two complementary directions: (i) making\na small subset of the nodes immune to attacks, or "trusted", and (ii)\nincorporating diversity into the network. We define graph-theoretic constructs\nthat formally capture the notions of redundancy, diversity, and trust. Based on\nthese constructs, we develop a resilient estimation algorithm and demonstrate\nthat even relatively sparse networks that either exhibit node-diversity, or\ncontain a small subset of trusted nodes, can be just as resilient to\nadversarial attacks as more dense networks. Finally, given a finite budget for\nnetwork design, we focus on characterizing the complexity of (i) selecting a\nset of trusted nodes, and (ii) allocating diversity, so as to achieve a desired\nlevel of robustness. We establish that, unfortunately, each of these problems\nis NP-complete.\n