On the Exact Solution to a Smart Grid Cyber-Security Analysis Problem
- 7 March 2013
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 4 (2) , 856-865
Abstract
This paper considers a smart grid cyber-security problem analyzing the vulnerabilities of electric power networks to false data attacks. The analysis problem is related to a constrained cardinality minimization problem. The main result shows that an relaxation technique provides an exact optimal solution to this cardinality minimization problem. The proposed result is based on a polyhedral combinatorics argument. It is different from well-known results based on mutual coherence and restricted isometry property. The results are illustrated on benchmarks including the IEEE 118-bus, IEEE 300-bus, and the Polish 2383-bus and 2736-bus systems.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Computing Critical $k$-Tuples in Power NetworksIEEE Transactions on Power Systems, 2012
- Smart grid data integrity attacks: characterizations and countermeasuresπ2011
- Strategic Protection Against Data Injection Attacks on Power GridsIEEE Transactions on Smart Grid, 2011
- MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and EducationIEEE Transactions on Power Systems, 2010
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and ImagesSIAM Review, 2009
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008
- The restricted isometry property and its implications for compressed sensingComptes Rendus Mathématique, 2008
- Sparse representations in unions of basesIEEE Transactions on Information Theory, 2003
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993