Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms

IEEE Transactions on Smart Grid

Volumn 6, Issue 5, 2015, Pages 2189-2199

  Yamaguchi, Yutaro ^a   Ogawa, Anna ^a,b   Takeda, Akiko ^a   Iwata, Satoru ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b KEIO UNIVERSITY   (Japan)

Author keywords

False data injection; hypergraph; minimum cut; power network; security index; state estimation

Indexed keywords

ALGORITHMS; ELECTRIC POWER TRANSMISSION NETWORKS; NETWORK SECURITY; STATE ESTIMATION;

FALSE DATA INJECTION; HYPERGRAPH; MINIMUM CUT; POWER NETWORKS; SECURITY INDICES;

ELECTRIC NETWORK ANALYSIS;

EID: 85027952907     PISSN: 19493053     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSG.2015.2394791     Document Type: Article

References (18)

1. A. Abur, Power System State Estimation: Theory and Implementation. Boca Raton, FL, USA: CRC Press, 2004.
2. J. M. Hendrickx, K. M. Johansson, R. M. Jungers, H. Sandberg, and K. C. Sou, "Efficient computations of a security index for false data attacks in power networks," IEEE Trans. Auto. Cont., vol. 59, no. 12, pp. 3194-3208, Aug. 2014
3. D. R. Karger, "Random sampling in cut, flow, and network design problems," Math. Oper. Res., vol. 24, no. 2, pp. 383-413, 1999.
4. R. Klimmek and F. Wagner, "A simple hypergraph min cut algorithm," Internal Rep. B 96-02, Bericht FU Berlin Fachbereich Mathematik und Informatik, Freie Universität Berlin, 1996.
5. J.-M. Lin and H.-Y. Pan, "A static state estimation approach including bad data detection and identification in power systems," in Proc. IEEE Power Eng. Soc. Gen. Meeting, Tampa, FL, USA, Jun. 2007, pp. 1-7.
6. Y. Liu, P. Ning, and M. K. Reiter, "False data injection attacks against state estimation in electric power grids," in Proc. 16th ACM Conf. Comput. Commun. Security, Chicago, IL, USA, Nov. 2009, pp. 21-32.
7. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
8. H. Nagamochi and T. Ibaraki, "Computing edge-connectivity in multigraphs and capacitated graphs," SIAM J. Discrete Math., vol. 5, no. 1, pp. 54-66, Feb. 1992.
9. H. Nagamochi, K. Nishimura, and T. Ibaraki, "Computing all small cuts in an undirected network," SIAM J. Discrete Math., vol. 10, no. 3, pp. 469-481, Aug. 1997.
10. M. Nagata et al., "Phase-model analysis of supply stability in power grid of Eastern Japan," in Proc. Int. Symp. Nonlinear Theory Appl., 2013, pp. 69-72.
11. J. B. Orlin, "Max flows in O(nm) time, or better," in Proc. 45th Annu. ACM Symp. Theory Comput., 2013, pp. 765-774.
12. J. Pistorius and M. Minoux, "An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications," Int. Trans. Oper. Res., vol. 10, no. 1, pp. 1-11, 2003.
13. H. Sandberg, A. Teixeira, and K. H. Johansson, "On security indices for state estimators in power networks," in Proc. 1st Workshop Secure Control Syst. (CPSWEEK), Stockholm, Sweden, 2010. [Online]. Available: https://www.truststc.org/conferences/10/CPSWeek/program.htm
14. K. C. Sou, H. Sandberg, and K. H. Johansson, "Electric power network security analysis via minimum cut relaxation," in Proc. 50th IEEE Conf. Decis. Control Eur. Control Conf. (CDC-ECC), Orlando, FL, USA, Dec. 2011, pp. 4054-4059.
15. K. C. Sou, H. Sandberg, and K. H. Johansson, "On the exact solution to a smart grid cyber-security analysis problem," IEEE Trans. Smart Grid, vol. 4, no. 2, pp. 856-865, Jun. 2013.
16. H. H. Yang and D. F. Wong, "Efficient network flow based min-cut balanced partitioning," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 15, no. 12, pp. 1533-1540, Dec. 1996.
17. R. D. Zimmerman, C. E. Murillo-Sánchez, and R. J. Thomas, "MATPOWER: Steady-state operations, planning, and analysis tools for power systems research and education," IEEE Trans. Power Syst., vol. 26, no. 1, pp. 12-19, Feb. 2011.
18. S. Zonouz et al., "SCPST: Security-oriented cyber-physical state estimation for power grid critical infrastructures," IEEE Trans. Smart Grid, vol. 3, no. 4, pp. 1790-1799, Dec. 2012.