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 l1 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 and 300-bus systems.
@article{arxiv.1201.5019,
title = {On the Exact Solution to a Smart Grid Cyber-Security Analysis Problem},
author = {Kin Cheong Sou and Henrik Sandberg and Karl Henrik Johansson},
journal= {arXiv preprint arXiv:1201.5019},
year = {2012}
}