TY - GEN

T1 - Fundamental limits of cyber-physical security in smart power grids

AU - Zhao, Yue

AU - Goldsmith, Andrea

AU - Poor, H. Vincent

N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.

PY - 2013

Y1 - 2013

N2 - Cyber-physical security of power systems under power injection attacks that alter generation and loads is studied. The system operator employs Phasor Measurement Units (PMUs) for detecting such attacks, while attackers devise attacks that are unobservable by such PMU networks. For the NP-hard problem of finding the sparsest unobservable attacks, it is shown that the solution has a simple form with probability one, namely, min (κ(GM),M) + 1, where κ(GM) is the vertex connectivity of an augmented graph, and M is the number of PMUs. The constructive proof allows one to find the entire set of the sparsest unobservable attacks in polynomial time. Furthermore, the geometric interpretation of unobservable attacks leads to a natural characterization of their potential impacts. With optimized PMU deployment, the sparsest unobservable attacks and their potential impact as functions of the number of PMUs are evaluated numerically for IEEE 30, 57, 118, 300-bus systems and Polish 2383, 2737, 3012-bus systems. It is observed that, as more PMUs are added, the maximum potential impact among all the sparsest unobservable attacks drops quickly until it reaches the minimum sparsity.

AB - Cyber-physical security of power systems under power injection attacks that alter generation and loads is studied. The system operator employs Phasor Measurement Units (PMUs) for detecting such attacks, while attackers devise attacks that are unobservable by such PMU networks. For the NP-hard problem of finding the sparsest unobservable attacks, it is shown that the solution has a simple form with probability one, namely, min (κ(GM),M) + 1, where κ(GM) is the vertex connectivity of an augmented graph, and M is the number of PMUs. The constructive proof allows one to find the entire set of the sparsest unobservable attacks in polynomial time. Furthermore, the geometric interpretation of unobservable attacks leads to a natural characterization of their potential impacts. With optimized PMU deployment, the sparsest unobservable attacks and their potential impact as functions of the number of PMUs are evaluated numerically for IEEE 30, 57, 118, 300-bus systems and Polish 2383, 2737, 3012-bus systems. It is observed that, as more PMUs are added, the maximum potential impact among all the sparsest unobservable attacks drops quickly until it reaches the minimum sparsity.

UR - http://www.scopus.com/inward/record.url?scp=84902302956&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902302956&partnerID=8YFLogxK

U2 - 10.1109/CDC.2013.6759882

DO - 10.1109/CDC.2013.6759882

M3 - Conference contribution

AN - SCOPUS:84902302956

SN - 9781467357173

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 200

EP - 205

BT - 2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 52nd IEEE Conference on Decision and Control, CDC 2013

Y2 - 10 December 2013 through 13 December 2013

ER -