Cyber security analysis of power networks by hypergraph cut algorithms

This paper presents exact solution methods for analyzing vulnerability of electric power networks to a certain kind of undetectable attacks known as false data injection attacks. We show that the problems of finding the minimum number of measurement points to be attacked undetectably reduce to minimum cut problems on hypergraphs, which admit efficient combinatorial algorithms. Experimental results indicate that our exact solution methods run as fast as the previous methods, most of which provide only approximate solutions. We also present the outline of an algorithm for enumerating all small cuts in a hypergraph, which can be used for finding vulnerable sets of measurement points.

[1]  Karl Henrik Johansson,et al.  On the Exact Solution to a Smart Grid Cyber-Security Analysis Problem , 2011, IEEE Transactions on Smart Grid.

[2]  Frank Wagner,et al.  A simple hypergraph min cut algorithm , 1996 .

[3]  Karl Henrik Johansson,et al.  On Security Indices for State Estimators in Power Networks , 2010 .

[4]  James B. Orlin,et al.  Max flows in O(nm) time, or better , 2013, STOC '13.

[5]  R D Zimmerman,et al.  MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education , 2011, IEEE Transactions on Power Systems.

[6]  D. F. Wong,et al.  Efficient network flow based min-cut balanced partitioning , 1994, ICCAD 1994.

[7]  David R. Karger,et al.  Random Sampling in Cut, Flow, and Network Design Problems , 1999, Math. Oper. Res..

[8]  Jeu-Min Lin,et al.  A Static State Estimation Approach Including Bad Data Detection and Identification in Power Systems , 2007, 2007 IEEE Power Engineering Society General Meeting.

[9]  Peng Ning,et al.  False data injection attacks against state estimation in electric power grids , 2011, TSEC.

[10]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[11]  Karl Henrik Johansson,et al.  Electric power network security analysis via minimum cut relaxation , 2011, IEEE Conference on Decision and Control and European Control Conference.

[12]  M. Minoux,et al.  An improved direct labeling method for the max–flow min–cut computation in large hypergraphs and applications , 2003 .

[13]  Gouhei Tanaka,et al.  Phase-Model Analysis of Supply Stability in Power Grid of Eastern Japan , 2014 .

[14]  Toshihide Ibaraki,et al.  Computing All Small Cuts in an Undirected Network , 1997, SIAM J. Discret. Math..

[15]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[16]  A. G. Expósito,et al.  Power system state estimation : theory and implementation , 2004 .

[17]  Karl Henrik Johansson,et al.  Efficient Computations of a Security Index for False Data Attacks in Power Networks , 2012, IEEE Transactions on Automatic Control.

[18]  William H. Sanders,et al.  SCPSE: Security-Oriented Cyber-Physical State Estimation for Power Grid Critical Infrastructures , 2012, IEEE Transactions on Smart Grid.

[19]  Akiko Takeda,et al.  Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms , 2015, IEEE Transactions on Smart Grid.