Cyber security analysis of power networks by hypergraph cut algorithms

2014 IEEE International Conference on Smart Grid Communications, SmartGridComm 2014

Volumn , Issue , 2015, Pages 824-829

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

^a UNIVERSITY OF TOKYO   (Japan)

^b KEIO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC POWER TRANSMISSION NETWORKS; NETWORK SECURITY;

APPROXIMATE SOLUTION; COMBINATORIAL ALGORITHM; CYBER SECURITY; ELECTRIC POWER NETWORKS; EXACT SOLUTION; FALSE DATA INJECTION ATTACKS; MEASUREMENT POINTS; POWER NETWORKS;

ELECTRIC NETWORK ANALYSIS;

EID: 84922470041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SmartGridComm.2014.7007750     Document Type: Conference Paper

References (17)

1. A. Abur: Power System State Estimation: Theory and Implementation, 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, arXiv:1204. 6174, 2012.
3. D. R. Karger: Random sampling in cut, flow, and network design problems. Mathematics of Operations Research, 24 (1999), 583-614.
4. R. Klimmek and F. Wagner: A simple hypergraph min cut algorithm. Internal Report B 96-02, Bericht FU Berlin Fachbereich Mathematik und Informatik, 1996.
5. J.-M. Lin and H.-Y. Pan: A static state estimation approach including bad data detection and identification in power systems. Proceedings of the IEEE Power Engineering Society General Meeting, 1-7, 2007.
6. Y. Liu, P. Ning and M. K. Reiter: False data injection attacks against state estimation in electric power grids. Proceedings of the 16th ACM Conference on Computer and Communications Security, 21-32, 2009.
7. S. G. Mallat and Z. Zhang: Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing, 3397-3415, 1993.
8. H. Nagamochi and T. Ibaraki: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Mathematics, 5 (1992), 54-66.
9. H. Nagamochi, K. Nishimura and T. Ibaraki: Computing all small cuts in an undirected network. SIAM J. Discrete Mathematics, 10 (1997), 469-481.
10. J. B. Orlin: Max flows in O(nm) time, or better. Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), 765-774, 2013.
11. J. Pistorius and M. Minoux: An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications. International Transactions in Operational Research, 10 (2003), 1-11.
12. H. Sandberg, A. Teixeira and K. H. Johansson: On security indices for state estimators in power networks. First Workshop on Secure Control Systems, 2010.
13. K. C. Sou, H. Sandberg and K. H. Johansson: Electric power network security analysis via minimum cut relaxation. Proceedings of 50th IEEE Conference on Decision and Control and European Control Conference, 4054-4059, 2011.
14. K. C. Sou, H. Sandberg and K. H. Johansson: On the exact solution to a smart grid cyber-security analysis problem. IEEE Transactions on Smart Grid, 4 (2013), 856-865.
15. Y. Yamaguchi, A. Ogawa, A. Takeda, S. Iwata: Cyber security analysis of power networks by hypergraph cut algorithms. Mathematical Engineering Technical Reports, METR 2014-12, University of Tokyo, 2014.
16. H. H. Yang and D. F. Wong: Efficient network flow based min-cut balanced partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuit and Systems, 15 (1996), 1533-1540.
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 Transactions on Power Systems, 26 (2011), 12-19.