.png){kind=icon}
.png){kind=icon}
Return
Secure Distributed Dynamic State Estimation Against Sparse Integrity Attack via Distributed Convex Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2024.3397158.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we study the problem of distributed estimation of discrete-time LTI systems with bounded noise against sparse integrity attacks. A malicious adversary can corrupt an unknown set with $p$ out of $m$ sensors and manipulate their observations arbitrarily. We propose a general secure estimation framework by decomposing a centralized linear observer into local ones and fusing the local estimates by minimizing specially designed convex functions. The optimization problem can be solved with a linear convergence rate in a distributed manner by widely used proximal gradient descent+consensus iterations aligned with local malicious detectors. Moreover, we do not require solving the optimization problem exactly. We propose a hot-starting mechanism with state predictions, which combined with linear convergence, can guarantee stable estimation with fixed numbers of iterations at each time instant, both under and without attack. Thus, with bounded computation and communication complexity, the proposed algorithm obtains a secure estimation at each sensor as long as the network is connected and the observability redundancy condition is satisfied, of which the latter is proved to be equivalent to 2p-sparse observability if system matrix A has unitary geometric multiplicity. Furthermore, numerical simulations on the IEEE 68-bus system corroborate our proposed algorithm.
Keywords:
Estimation
Sensors
Noise
Observability
Sparse matrices
Optimization
Convergence
Distributed state estimation
fault tolerant systems
optimization
sensor networks
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W