A polynomial-time method to find the sparsest unobservable attacks in power networks

Yue Zhao; Andrea Goldsmith; H. Vincent Poor

doi:10.1109/ACC.2016.7524928

A polynomial-time method to find the sparsest unobservable attacks in power networks

Yue Zhao, Andrea Goldsmith, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

Power injection attacks that alter generation and loads at buses in power networks are studied. The system operator employs Phasor Measurement Units (PMUs) to detect such physical attacks, while attackers devise attacks that are unobservable by such PMU networks. Unalterable buses, whose power injections cannot be changed, are also considered in our model. It is shown that, given the PMU locations, the minimum sparsity of unobservable attacks has a simple form with probability one, namely, equation, where equation is defined as the vulnerable vertex connectivity of an augmented graph. The constructive proof allows one to find the entire set of the sparsest unobservable attacks in polynomial time.

Original language	English (US)
Title of host publication	2016 American Control Conference, ACC 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	276-282
Number of pages	7
ISBN (Electronic)	9781467386821
DOIs	https://doi.org/10.1109/ACC.2016.7524928
State	Published - Jul 28 2016
Event	2016 American Control Conference, ACC 2016 - Boston, United States Duration: Jul 6 2016 → Jul 8 2016

Publication series

Name	Proceedings of the American Control Conference
Volume	2016-July
ISSN (Print)	0743-1619

Other

Other	2016 American Control Conference, ACC 2016
Country/Territory	United States
City	Boston
Period	7/6/16 → 7/8/16

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

10.1109/ACC.2016.7524928

Cite this

Zhao, Y., Goldsmith, A., & Poor, H. V. (2016). A polynomial-time method to find the sparsest unobservable attacks in power networks. In 2016 American Control Conference, ACC 2016 (pp. 276-282). Article 7524928 (Proceedings of the American Control Conference; Vol. 2016-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ACC.2016.7524928

@inproceedings{5194cf4b7a434d88919271d61652d58c,

title = "A polynomial-time method to find the sparsest unobservable attacks in power networks",

abstract = "Power injection attacks that alter generation and loads at buses in power networks are studied. The system operator employs Phasor Measurement Units (PMUs) to detect such physical attacks, while attackers devise attacks that are unobservable by such PMU networks. Unalterable buses, whose power injections cannot be changed, are also considered in our model. It is shown that, given the PMU locations, the minimum sparsity of unobservable attacks has a simple form with probability one, namely, equation, where equation is defined as the vulnerable vertex connectivity of an augmented graph. The constructive proof allows one to find the entire set of the sparsest unobservable attacks in polynomial time.",

author = "Yue Zhao and Andrea Goldsmith and Poor, {H. Vincent}",

note = "Publisher Copyright: {\"i}¿½ 2016 American Automatic Control Council (AACC).; 2016 American Control Conference, ACC 2016 ; Conference date: 06-07-2016 Through 08-07-2016",

year = "2016",

month = jul,

day = "28",

doi = "10.1109/ACC.2016.7524928",

language = "English (US)",

series = "Proceedings of the American Control Conference",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "276--282",

booktitle = "2016 American Control Conference, ACC 2016",

address = "United States",

}

Zhao, Y, Goldsmith, A & Poor, HV 2016, A polynomial-time method to find the sparsest unobservable attacks in power networks. in 2016 American Control Conference, ACC 2016., 7524928, Proceedings of the American Control Conference, vol. 2016-July, Institute of Electrical and Electronics Engineers Inc., pp. 276-282, 2016 American Control Conference, ACC 2016, Boston, United States, 7/6/16. https://doi.org/10.1109/ACC.2016.7524928

A polynomial-time method to find the sparsest unobservable attacks in power networks. / Zhao, Yue; Goldsmith, Andrea ; Poor, H. Vincent.
2016 American Control Conference, ACC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 276-282 7524928 (Proceedings of the American Control Conference; Vol. 2016-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A polynomial-time method to find the sparsest unobservable attacks in power networks

AU - Zhao, Yue

AU - Goldsmith, Andrea

AU - Poor, H. Vincent

PY - 2016/7/28

Y1 - 2016/7/28

N2 - Power injection attacks that alter generation and loads at buses in power networks are studied. The system operator employs Phasor Measurement Units (PMUs) to detect such physical attacks, while attackers devise attacks that are unobservable by such PMU networks. Unalterable buses, whose power injections cannot be changed, are also considered in our model. It is shown that, given the PMU locations, the minimum sparsity of unobservable attacks has a simple form with probability one, namely, equation, where equation is defined as the vulnerable vertex connectivity of an augmented graph. The constructive proof allows one to find the entire set of the sparsest unobservable attacks in polynomial time.

AB - Power injection attacks that alter generation and loads at buses in power networks are studied. The system operator employs Phasor Measurement Units (PMUs) to detect such physical attacks, while attackers devise attacks that are unobservable by such PMU networks. Unalterable buses, whose power injections cannot be changed, are also considered in our model. It is shown that, given the PMU locations, the minimum sparsity of unobservable attacks has a simple form with probability one, namely, equation, where equation is defined as the vulnerable vertex connectivity of an augmented graph. The constructive proof allows one to find the entire set of the sparsest unobservable attacks in polynomial time.

UR - http://www.scopus.com/inward/record.url?scp=84992026467&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84992026467&partnerID=8YFLogxK

U2 - 10.1109/ACC.2016.7524928

DO - 10.1109/ACC.2016.7524928

M3 - Conference contribution

AN - SCOPUS:84992026467

T3 - Proceedings of the American Control Conference

SP - 276

EP - 282

BT - 2016 American Control Conference, ACC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 American Control Conference, ACC 2016

Y2 - 6 July 2016 through 8 July 2016

ER -

A polynomial-time method to find the sparsest unobservable attacks in power networks

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this