This letter develops a new bilevel optimization model to construct false data injection attack based on pre- and post- dispatch. In order to enhance the attack concealment, the proposed bilevel model can minimize the variation of uploaded measurements between pre- and post-attack before dispatching, after which the attack can lead the system to an uneconomic and insecure operating state after dispatching. Simulation results validate the effectiveness of the proposed bilevel model in term of operating cost and network overloads.@en

A topology attack, as a special class of false data injection attacks, tampers with topology information of a system to mislead the decision of the control center. This article conducts an in-depth study on topology attacks that aim to interfere with the judgment in topology information and pose potential damage by tampering with measurement data and protection information on branches, namely, protection-branch measurements-based topology attacks (PBT attacks). To achieve PBT attacks in actual networks, we study the protection settings and mechanisms in term of branches including transformers and transmission lines. Then, for the first time, we develop a bilevel model based on the protection configuration from the perspective of security-constrained economic dispatch. Meanwhile, since a bilevel model is constructed against dc state estimation, a conversion method in constructing attack vectors under PBT attacks against ac power system is proposed, which makes PBT attacks more suitable for actual power systems and more concealed. In a set of case studies on an IEEE 14-bus system, the simulation results verify the effectiveness of the model we proposed, analyze the vulnerability of network under PBT attacks, and then identify some critical branches that are defended to cope with PBT attacks. In addition, the comparison between PBT attacks and traditional cyber-overloaded attacks also shows a stronger threat of the studied attacks.@en

This article offers a novel perspective on identifying the critical branches under load redistribution (LR) attacks. Compared to the existing literature that is largely disruption-driven and based on dc state estimation, we propose to address the threat from LR attacks on a more fundamental level by modeling and analyzing the circulation of false data within the cyber network resulting from the coordinated branch and node measurement manipulation based on ac state estimation. We reveal the underlying mechanism that disturbing the coordinated and reconciled interactions among false data injections can effectively sever the completeness and consistency of the LR attack, thus reducing its damaging effect. We then develop a scalable and computationally efficient critical branch identification approach that evaluates and ranks branches in terms of their criticality according to the graph model of the false data circulation. Case studies are conducted on IEEE 14-, 39-, 118-bus systems and several large-scale models to validate the effectiveness and computational efficiency of the proposed approach. Simulation results show that the proposed approach scales well with the size of the system and can effectively mitigate the damaging effects of the LR attack in terms of operation cost and load shedding.@en

This article offers a novel perspective on identifying the critical branches under load redistribution (LR) attacks. Compared to the existing literature that is largely disruption-driven and based on dc state estimation, we propose to address the threat from LR attacks on a more fundamental level by modeling and analyzing the circulation of false data within the cyber network resulting from the coordinated branch and node measurement manipulation based on ac state estimation. We reveal the underlying mechanism that disturbing the coordinated and reconciled interactions among false data injections can effectively sever the completeness and consistency of the LR attack, thus reducing its damaging effect. We then develop a scalable and computationally efficient critical branch identification approach that evaluates and ranks branches in terms of their criticality according to the graph model of the false data circulation. Case studies are conducted on IEEE 14-, 39-, 118-bus systems and several large-scale models to validate the effectiveness and computational efficiency of the proposed approach. Simulation results show that the proposed approach scales well with the size of the system and can effectively mitigate the damaging effects of the LR attack in terms of operation cost and load shedding.@en