On the Exact Solution to a Smart Grid Cyber-Security Analysis Problem
Artikel i vetenskaplig tidskrift, 2013

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.

Författare

Kin Cheong Sou

Göteborgs universitet

Chalmers, Matematiska vetenskaper, Matematik

Henrik Sandberg

Karl Henrik Johansson

IEEE Transactions on Smart Grid

1949-3053 (ISSN)

Vol. 4 2 856-865

Styrkeområden

Informations- och kommunikationsteknik

Energi

Ämneskategorier

Beräkningsmatematik

Reglerteknik

DOI

10.1109/TSG.2012.2230199