Method for evaluating the importance of power grid nodes based on PageRank algorithm

Cascading failures can easily occur and cause a major blackout in power grid when an important node breaks down. It is an essential problem to evaluate the importance of nodes in power system planning and operation. In this study, a method for evaluating the importance of power grid nodes based on PageRank (PR) algorithm is proposed. First, according to the comparison of the internet and power grid topology, a directed graph is established. Second, based on the directed graph, an index is proposed to estimate the importance of power grid nodes based on PR algorithm. Then, according to the characteristics of power grid, a modified algorithm, which takes the importance of nodal load, nodal load capacity and network topology into account, is proposed. Finally, case study shows the necessity of considering the factors to evaluate the importance of power grid nodes and the effective of index and algorithm to identify critical nodes in this study.

[1]  Massimo Franceschet,et al.  PageRank , 2010, Commun. ACM.

[2]  Massimo Marchiori,et al.  Model for cascading failures in complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[4]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  S Arianos,et al.  Power grid vulnerability: a complex network approach. , 2008, Chaos.

[6]  Chen Shi-yong.  An Extended PageRank Algorithm Based on Page-Level , 2010 .

[7]  Enrico Zio,et al.  Analyzing the topological, electrical and reliability characteristics of a power transmission system for identifying its critical elements , 2012, Reliab. Eng. Syst. Saf..

[8]  A. Ebrahimi,et al.  Constructing the Bayesian Network for components reliability importance ranking in composite power systems , 2012 .

[9]  Lei Guo,et al.  Power transmission risk assessment considering component condition , 2014, ENERGYO.

[10]  Martin Suter,et al.  Small World , 2002 .

[11]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[12]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[13]  Changhong Deng,et al.  Evaluation of the Importance of Network Nodes Based on Weighted Network Model , 2009, 2009 Asia-Pacific Power and Energy Engineering Conference.

[14]  Geoffrey Debnam,et al.  The analysis of power , 1984 .

[15]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[16]  Philip S. Yu,et al.  Top 10 algorithms in data mining , 2007, Knowledge and Information Systems.

[17]  Quan Xiao,et al.  A Method for Measuring Node Importance in Hypernetwork Model , 2013 .

[18]  Fei Xue,et al.  Structural vulnerability of power systems: A topological approach , 2011 .

[19]  Enrico Nardelli,et al.  Finding the most vital node of a shortest path , 2003, Theor. Comput. Sci..

[20]  Taher H. Haveliwala.  Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search , 2003, IEEE Trans. Knowl. Data Eng..

[21]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[22]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[23]  Han Pingping,et al.  Vulnerability Assessment to Small-world Power Grid Based on Weighted Topological Model , 2008 .

[24]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[25]  V. E. Lynch,et al.  Critical points and transitions in an electric power transmission model for cascading failure blackouts. , 2002, Chaos.

[26]  Yi Zhao,et al.  Bringing PageRank to the citation analysis , 2008, Inf. Process. Manag..