Byzantine-resilient distributed observers for LTI systems
Byzantine-resilient distributed observers for LTI systems
复制标题
DOI：
10.1016/j.automatica.2019.06.039
复制
发表时间：
2018-02
期刊：
影响因子：
--
通讯作者：
A. Mitra;S. Sundaram
中科院分区：
文献类型：
--
作者：
A. Mitra;S. Sundaram
考虑由传感器网络监控的线性时不变（LTI）动态系统，传感器网络被建模为底层有向通信图的节点。我们研究的问题，协同估计系统的状态时，某些节点受到对手。具体来说，我们考虑拜占庭对手模型，其中受损节点拥有完整的知识的系统动态和网络，可以任意偏离任何规定的算法的规则。我们首先描述了任何分布式状态估计算法的测量和通信结构的节点的某些基本限制。然后，我们开发了一个攻击弹性，可证明正确的状态估计算法，承认一个完全分布式的实现。为了表征可行的网络拓扑结构，保证我们所提出的技术的成功，我们引入了一个概念的“强鲁棒性”，捕获测量和通信冗余。最后，通过绘制连接到引导渗流理论，我们认为，给定一个LTI系统和一个相关的传感器网络，“强鲁棒性”的属性可以在多项式时间内检查。
Consider a linear time-invariant (LTI) dynamical system monitored by a network of sensors, modeled as nodes of an underlying directed communication graph. We study the problem of collaboratively estimating the state of the system when certain nodes are compromised by adversaries. Specifically, we consider a Byzantine adversary model, where a compromised node possesses complete knowledge of the system dynamics and the network, and can deviate arbitrarily from the rules of any prescribed algorithm. We first characterize certain fundamental limitations of any distributed state estimation algorithm in terms of the measurement and communication structure of the nodes. We then develop an attack-resilient, provably correct state estimation algorithm that admits a fully distributed implementation. To characterize feasible network topologies that guarantee success of our proposed technique, we introduce a notion of ‘strong-robustness’ that captures both measurement and communication redundancy. Finally, by drawing connections to bootstrap percolation theory, we argue that given an LTI system and an associated sensor network, the ‘strong-robustness’ property can be checked in polynomial time.