Using graph models to analyze the vulnerability of electric power networks

被引:244
作者
Holmgren, Ake J. [1 ]
机构
[1] Royal Inst Technol, Div Safety Res, SE-10044 Stockholm, Sweden
关键词
electric power system; graph theory; intentional attack; network analysis; random failure; vulnerability;
D O I
10.1111/j.1539-6924.2006.00791.x
中图分类号
R1 [预防医学、卫生学];
学科分类号
1004 ; 120402 ;
摘要
In this article, we model electric power delivery networks as graphs, and conduct studies of two power transmission grids, i.e., the Nordic and the western states (U.S.) transmission grid. We calculate values of topological (structural) characteristics of the networks and compare their error and attack tolerance (structural vulnerability), i.e., their performance when vertices are removed, with two frequently used theoretical reference networks (the Erdos-Renyi random graph and the Barabasi-Albert scale-free network). Further, we perform a structural vulnerability analysis of a fictitious electric power network with simple structure. In this analysis, different strategies to decrease the vulnerability of the system are evaluated. Finally, we present a discussion on the practical applicability of graph modeling.
引用
收藏
页码:955 / 969
页数:15
相关论文
共 28 条
[1]   Structural vulnerability of the North American power grid [J].
Albert, R ;
Albert, I ;
Nakarado, GL .
PHYSICAL REVIEW E, 2004, 69 (02) :025103-1
[2]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[3]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[4]   Classes of small-world networks [J].
Amaral, LAN ;
Scala, A ;
Barthélémy, M ;
Stanley, HE .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (21) :11149-11152
[5]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[6]  
Barefoot C., 1987, J Comb Math Comb Comput, V1, P12
[7]  
Bollobas B, 1985, RANDOM GRAPHS
[8]   Graph structure in the Web [J].
Broder, A ;
Kumar, R ;
Maghoul, F ;
Raghavan, P ;
Rajagopalan, S ;
Stata, R ;
Tomkins, A ;
Wiener, J .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6) :309-320
[9]  
Chen Q, 2002, IEEE INFOCOM SER, P608, DOI 10.1109/INFCOM.2002.1019306
[10]  
Criado R., 2005, J MATH MODELLING ALG, V4, P307, DOI DOI 10.1007/S10852-005-9006-1