.png){kind=icon}
Return
Distributed Sparse Undetectable Attacks Against State Estimation
.png){kind=icon}
PRE
AI
DOI：10.1109/TCNS.2021.3112774.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article studies a class of distributed attack strategies against state estimation of wireless sensor networks. The attack objective is to corrupt the least numbers of sensors so that the state estimate error approaches a target bias while avoiding being detected and high attacking is lost. First, with precise knowledge of the measurement model and applying a sparsity projection operation with average linear complexity rather than the popular brute force search and approximation techniques, a distributed optimization scheme is proposed which provides an exact and low-complexity algorithmic solution to finding the optimal attack strategy. Furthermore, by introducing dead-zone type projection and region projection operators, a distributed optimization algorithm for robust sparse undetectable attacks is proposed with imprecise model knowledge. A distinguishing point of the proposed algorithms is that a tradeoff between computational complexity and an attack's impact can be achieved by properly designing a cost function. Simulation results on an unmanned ground vehicle are presented to substantiate the algorithm.
Keywords:
Distributed optimization (DO)
state estimation
undetectable attacks
wireless sensor networks
Journal
IF:
5
Papers:
1.7K
Citations:
5.8K
Organization
Cited Papers
Switched projected gradient descent algorithms for secure state estimation under sparse sensor attacks.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveDistributed secure state estimation for cyber-physical systems under sensor attacksAUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more