Optimization Algorithms for Catching Data Manipulators in Power System Estimation Loops
Mang Liao, Aranya Chakrabortty

TL;DR
This paper introduces algorithms to detect and identify malicious data manipulators in distributed power system estimation loops, enhancing the robustness of oscillation mode estimation against large and covert attacks.
Contribution
The paper develops four novel iterative algorithms that detect and identify compromised estimators in distributed power system models without requiring system model information.
Findings
Algorithms successfully detect malicious estimators in simulations.
Effective against both large and covert attacks.
Applicable to large power system models like IEEE 68-bus.
Abstract
In this paper we develop a set of algorithms that can detect the identities of malicious data-manipulators in distributed optimization loops for estimating oscillation modes in large power system models. The estimation is posed in terms of a consensus problem among multiple local estimators that jointly solve for the characteristic polynomial of the network model. If any of these local estimates are compromised by a malicious attacker, resulting in an incorrect value of the consensus variable, then the entire estimation loop can be destabilized. We present four iterative algorithms by which this instability can be quickly detected, and the identities of the compromised estimators can be revealed. The algorithms are solely based on the computed values of the estimates, and do not need any information about the model of the power system. Both large and covert attacks are considered.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSmart Grid Security and Resilience · Power System Optimization and Stability · Optimal Power Flow Distribution
