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
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 -