Digitally Annealed Solution for the Vertex Cover Problem with Application in Cyber Security

Cyber attacks on the power systems can mislead the control center to produce incorrect state and topology estimate. State and topology attacks can have harmful impacts on the operation of a power system. The problem of placing secure phasor measurement units (PMUs) to detect these attacks has been studied in the literature. Specifically, it has been shown that placing secure PMUs to disable undetectable state and topology attacks can enhance the security of the system against cyber attacks. Placing secure PMUs is indeed the minimum vertex cover problem. Since the cost of deploying PMUs is high, it is important to place the secure PMUs efficiently in order to maximize the ability of detecting cyber attacks while reducing the costs. In this paper, we use Digital Annealer to solve the vertex cover problem. Digital Annealer is a hardware architecture for solving combinatorial optimization problems. We have performed numerous numerical experiments and noticed that our approach has an enhanced level of optimality compared to other well-known alternatives in the literature.

[1]  Malte Helmert,et al.  A Stochastic Local Search Approach to Vertex Cover , 2007, KI.

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

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

[4]  Muzammil Khan,et al.  AVSA, Modified Vertex Support Algorithm for Approximation of MVC , 2014 .

[5]  H. Vincent Poor,et al.  Strategic Protection Against Data Injection Attacks on Power Grids , 2011, IEEE Transactions on Smart Grid.

[6]  Sanroku Tsukamoto,et al.  Ising-Model Optimizer with Parallel-Trial Bit-Sieve Engine , 2017, CISIS.

[7]  Bruno Sinopoli,et al.  False Data Injection Attacks in Electricity Markets , 2010, 2010 First IEEE International Conference on Smart Grid Communications.

[8]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[9]  Jun Ma,et al.  An efficient simulated annealing algorithm for the minimum vertex cover problem , 2006, Neurocomputing.

[10]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[11]  Kameshwar Poolla,et al.  Smart grid data integrity attacks: characterizations and countermeasuresπ , 2011, 2011 IEEE International Conference on Smart Grid Communications (SmartGridComm).

[12]  Lang Tong,et al.  On Topology Attack of a Smart Grid: Undetectable Attacks and Countermeasures , 2013, IEEE Journal on Selected Areas in Communications.

[13]  Lang Tong,et al.  Malicious data attack on real-time electricity market , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[14]  Klara Nahrstedt,et al.  Detecting False Data Injection Attacks on DC State Estimation , 2010 .

[15]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[16]  Ewald Speckenmeyer,et al.  Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.

[17]  Lang Tong,et al.  On phasor measurement unit placement against state and topology attacks , 2013, 2013 IEEE International Conference on Smart Grid Communications (SmartGridComm).

[18]  L. Tong,et al.  Malicious Data Attacks on Smart Grid State Estimation: Attack Strategies and Countermeasures , 2010, 2010 First IEEE International Conference on Smart Grid Communications.

[19]  Christof Paar,et al.  Understanding Cryptography: A Textbook for Students and Practitioners , 2009 .

[20]  Khan Imran,et al.  Modified Vertex Support Algorithm: A New approach for approximation of Minimum vertex cover , 2013 .

[21]  S. Balaji,et al.  Optimization of Unweighted Minimum Vertex Cover , 2010 .

[22]  John V. Monaco,et al.  Solving Vertex Cover via Ising Model on a Neuromorphic Processor , 2018, 2018 IEEE International Symposium on Circuits and Systems (ISCAS).

[23]  Lang Tong,et al.  On topology attack of a smart grid , 2013, 2013 IEEE PES Innovative Smart Grid Technologies Conference (ISGT).

[24]  Sanjaya Gajurel,et al.  A Fast Near Optimal Vertex Cover Algorithm (NOVCA) , 2012 .