Reducing power grid cascading failure propagation by minimizing algebraic connectivity in edge addition
Affiliation(s): State Key Lab of CAD & CG, Zhejiang University, Hangzhou 310058, China; College of Computer Science and Technology, Zhejiang University, Hangzhou 310058, China; School of Mathematical Science, Zhejiang University, Hangzhou 310058, China; State Key Laboratory of Power Grid Safety and Energy Conservation, China Electric Power Research Institute, Beijing 100192, China; less
Received: 2020-11-02
Accepted: 2022-03-22
Available online: 2022-03-22
Abstract
Analyzing under various circumstances is generally regarded as a challenging problem. Robustness against failure is one of the essential properties of large-scale dynamic network systems such as s, transportation systems, communication systems, and computer networks. Due to the network diversity and complexity, many topological features have been proposed to capture specific system properties. For s, a popular process for improving a network’s structural robustness is via the topology design. However, most of existing methods focus on localized network metrics, such as node connectivity and edge connectivity, which do not encompass a global perspective of cascading propagation in a . In this paper, we use an informative global metric because it is sensitive to the connectedness in a broader spectrum of graphs. Our process involves decreasing the in a by minimizing the increase in its . We propose a topology-based greedy strategy to optimize the robustness of the . To evaluate the , we calculate the using MATCASC to simulate cascading line outages in s. Experimental results illustrate that our proposed method outperforms existing techniques.
京公网安备 11010502051620号
