子网
中间性中心性
正确性
分拆(数论)
计算机科学
级联故障
网络分区
生存能力
节点(物理)
复杂网络
电网
算法
分布式计算
功率(物理)
数学
电力系统
计算机网络
中心性
工程类
万维网
结构工程
组合数学
量子力学
物理
标识
DOI:10.3389/fphy.2021.790218
摘要
Based on the community discovery method in complex network theory, a power grid partition method considering generator nodes and network weightings is proposed. Firstly, the weighted network model of a power system is established, an improved Fast-Newman hierarchical algorithm and a weighted modular Q function index are introduced, and the partitioning algorithm process is practically improved combined with the characteristics of the actual power grid. Then, the partition results of several IEEE test systems with the improved algorithm and with the Fast-Newman algorithm are compared to demonstrate its effectiveness and correctness. Subsequently, on the basis of subnet partition, two kinds of network attack strategies are proposed. One is attacking the maximum degree node of each subnet, and the other is attacking the maximum betweenness node of each subnet. Meanwhile, considering the two traditional intentional attack strategies, that is, attacking the maximum degree nodes or attacking the maximum betweenness nodes of the whole network, the cascading fault survivability of different types of networks under four attack strategies is simulated and analyzed. It was found that the proposed two attack strategies based on subnet partition are better than the two traditional intentional attack strategies.
科研通智能强力驱动
Strongly Powered by AbleSci AI