A minimum cut-set vulnerability analysis of power networks

被引：11
|
作者：
Caro-Ruiz, C. [1 ,2 ]
Ma, J. [3 ]
Hill, D. J. [3 ,4 ]
Pavas, A. [1 ]
Mojica-Nava, E. [1 ]
机构：
[1] Univ Nacl Colombia, Dept Elect & Elect Engn, Bogota, Colombia
[2] Univ Manuela Beltran, Dept Elect Engn, Bogota, Colombia
[3] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2006, Australia
[4] Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Peoples R China
来源：
SUSTAINABLE ENERGY GRIDS & NETWORKS | 2020年 / 21卷
关键词：
Cascading failures; Complex networks; Minimum cut-set; Power systems; Target attacks; Vulnerability assessment; CASCADING FAILURES; COMPLEX NETWORK; RELIABILITY EVALUATION; TRANSMISSION; DYNAMICS; IDENTIFICATION; STRATEGIES; ATTACK; GRIDS;
D O I：
10.1016/j.segan.2020.100302
中图分类号：
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号：
0807 ; 0820 ;
摘要：
In this paper, we study the vulnerability of the minimum cut-set (MCS) in power networks by assessing the effect of sequential attacks against the MCS and its corresponding effect on cascading failures triggering. Concepts of flow-networks and the DC power flow are integrated into the system model. Computational algorithms are developed to identify the target set, update power flow solutions, and maintain the system balance during network evolution. A vulnerability metric based on attack efficiency is proposed to compare the network responsible for different target selection. Case studies are used to compare MCS attacks with other network-based and electric-based attacks. The vulnerability of the MCS elements results higher than found for elements identified employing electrically extended measures. (c) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数：13
相关论文
共 50 条
  • [1] AN ALGORITHM FOR GETTING A MINIMUM CUT-SET OF A GRAPH
    ARANY, I
    [J]. LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1986, 84 : 17 - 24
  • [2] Cut-Set Bound for Generalized Networks
    Fong, Silas L.
    Yeung, Raymond W.
    Kramer, Gerhard
    [J]. 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [3] Reliability Analysis of Distribution System Based on The Minimum Cut-Set Method
    Zhou, Zefang
    Gong, Zhean
    Zeng, Bo
    He, Liping
    Ling, Dan
    [J]. 2012 INTERNATIONAL CONFERENCE ON QUALITY, RELIABILITY, RISK, MAINTENANCE, AND SAFETY ENGINEERING (ICQR2MSE), 2012, : 112 - 116
  • [4] Generalized Cut-Set Bounds for Broadcast Networks
    Salimi, Amir
    Liu, Tie
    Cui, Shuguang
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (06) : 2983 - 2996
  • [5] Generalized Cut-Set Bounds for Broadcast Networks
    Salimi, Amir
    Liu, Tie
    Cui, Shuguang
    [J]. 2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 832 - 838
  • [6] Cut-Set Bound for Generalized Networks with Deterministic Channels
    Fong, Silas L.
    [J]. 2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 541 - 545
  • [7] Cut-Set Bound for Generalized Networks with Positive Delay
    Fong, Silas L.
    Yeung, Raymond W.
    [J]. 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [8] CUT-SET SIMULATION
    JACKSON, CA
    TROUPE, RA
    [J]. CHEMICAL ENGINEERING PROGRESS, 1973, 69 (10) : 98 - 99
  • [9] GENERALIZATION OF CUT-SET
    YAU, SS
    [J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1962, 273 (01): : 31 - &
  • [10] Cut-set arguments for source-channel networks
    Gastpar, M
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 34 - 34
12345