Max-flow min-cut for power system security index computation

Oliver Kosut

doi:10.1109/SAM.2014.6882338

Max-flow min-cut for power system security index computation

Oliver Kosut

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

10 Scopus citations

Abstract

The security index problem for false data injection attacks on power systems is considered. In particular, the problem is to find the minimum cost set of bus injection meters and line flow meters that an attacker can seize so as to execute a false data injection. A polynomial-time algorithm is provided to solve this problem in certain settings, based on the principle of max-flow min-cut. The security index problem is shown to be equivalent to a min-cut problem, and that this problem can be solved using a generalization of the classic max-flow min-cut algorithm in which flows are successively augmented until doing so is no longer possible.

Original language	English (US)
Title of host publication	2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014
Publisher	IEEE Computer Society
Pages	61-64
Number of pages	4
ISBN (Print)	9781479914814
DOIs	https://doi.org/10.1109/SAM.2014.6882338
State	Published - Jan 1 2014
Event	2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014 - A Coruna, Spain Duration: Jun 22 2014 → Jun 25 2014

Publication series

Name	Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop
ISSN (Electronic)	2151-870X

Other

Other	2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014
Country/Territory	Spain
City	A Coruna
Period	6/22/14 → 6/25/14

ASJC Scopus subject areas

Signal Processing
Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1109/SAM.2014.6882338

Cite this

Max-flow min-cut for power system security index computation. / Kosut, Oliver.
2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014. IEEE Computer Society, 2014. p. 61-64 6882338 (Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop).

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

Kosut, O 2014, Max-flow min-cut for power system security index computation. in 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014., 6882338, Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop, IEEE Computer Society, pp. 61-64, 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014, A Coruna, Spain, 6/22/14. https://doi.org/10.1109/SAM.2014.6882338

@inproceedings{a110ce1e9663442fb57c8fe132291bcd,

title = "Max-flow min-cut for power system security index computation",

abstract = "The security index problem for false data injection attacks on power systems is considered. In particular, the problem is to find the minimum cost set of bus injection meters and line flow meters that an attacker can seize so as to execute a false data injection. A polynomial-time algorithm is provided to solve this problem in certain settings, based on the principle of max-flow min-cut. The security index problem is shown to be equivalent to a min-cut problem, and that this problem can be solved using a generalization of the classic max-flow min-cut algorithm in which flows are successively augmented until doing so is no longer possible.",

author = "Oliver Kosut",

year = "2014",

month = jan,

day = "1",

doi = "10.1109/SAM.2014.6882338",

language = "English (US)",

isbn = "9781479914814",

series = "Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop",

publisher = "IEEE Computer Society",

pages = "61--64",

booktitle = "2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014",

note = "2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014 ; Conference date: 22-06-2014 Through 25-06-2014",

}

TY - GEN

T1 - Max-flow min-cut for power system security index computation

AU - Kosut, Oliver

PY - 2014/1/1

Y1 - 2014/1/1

N2 - The security index problem for false data injection attacks on power systems is considered. In particular, the problem is to find the minimum cost set of bus injection meters and line flow meters that an attacker can seize so as to execute a false data injection. A polynomial-time algorithm is provided to solve this problem in certain settings, based on the principle of max-flow min-cut. The security index problem is shown to be equivalent to a min-cut problem, and that this problem can be solved using a generalization of the classic max-flow min-cut algorithm in which flows are successively augmented until doing so is no longer possible.

AB - The security index problem for false data injection attacks on power systems is considered. In particular, the problem is to find the minimum cost set of bus injection meters and line flow meters that an attacker can seize so as to execute a false data injection. A polynomial-time algorithm is provided to solve this problem in certain settings, based on the principle of max-flow min-cut. The security index problem is shown to be equivalent to a min-cut problem, and that this problem can be solved using a generalization of the classic max-flow min-cut algorithm in which flows are successively augmented until doing so is no longer possible.

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

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

U2 - 10.1109/SAM.2014.6882338

DO - 10.1109/SAM.2014.6882338

M3 - Conference contribution

AN - SCOPUS:84907383953

SN - 9781479914814

T3 - Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop

SP - 61

EP - 64

BT - 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014

PB - IEEE Computer Society

T2 - 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014

Y2 - 22 June 2014 through 25 June 2014

ER -

Max-flow min-cut for power system security index computation

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this