Network damage maximization algorithm based on topology potential

被引:1
作者
Yu J. [1 ]
Xiao B. [2 ]
Xiong J. [2 ]
机构
[1] Department of Information Countermeasure, Air Force Early Warning Academy, Wuhan
[2] Department of Early Warning Intelligence, Air Force Early Warning Academy, Wuhan
来源
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics | 2023年 / 45卷 / 09期
关键词
complex network; cost-effective lazy-forward (CELF) algorithm; damage maximization; topology potential;
D O I
10.12305/j.issn.1001-506X.2023.09.20
中图分类号
学科分类号
摘要
In view of the problem of network damage with limited resources when the attack cost is equal, the definition of network damage maximization is given. In order to improve the defect that the approximate algorithm suffers high computation complexity when solving network damage maximization problem, the algorithm based on topology potential and cost-effective lazy-forward (TPCELF) is proposed. Experiments with simulated scale-free networks and real network show that the TPCELF algorithm has a greater improvement in calculation speed, and the average damage effect of the network is close to the approximate algorithm. What's more, the TPCELF algorithm is better than other commonly used importance metric ranking algorithms in average network damage effect. The proposed approach can provide a reference for mining key nodes in complex networks from the perspective of network damage. © 2023 Chinese Institute of Electronics. All rights reserved.
引用
收藏
页码:2812 / 2818
页数:6
相关论文
共 31 条
[1]  
WU X T, DONG H R, TSE C K, Et al., Analysis of metro network performance from a complex network perspective, Physica A: Statistical Mechanics and its Applications, 492, pp. 553-563, (2018)
[2]  
MAHMOUD S, YUSEF E, AHMED M., Applications of complex network analysis in electric power systems, Energies, 11, 6, (2018)
[3]  
LIU T L, YANG Z R, ZHANG H, Et al., Modeling and performance analysis of military communication network based on complex network, System Engineering and Electronics, 42, 12, pp. 2892-2898, (2020)
[4]  
ZHAI H M, ZHANG Z Y, ZHAO X L, Et al., Optimization of green infrastructure in Xinyang city based on network structure analysis[J], Journal of Xinyang Normal University (Natural Science Edition), 34, 2, pp. 260-266, (2021)
[5]  
LIU D S., Review on combat system evaluation based on complex network analysis method, Military Operations Research and Systems Engineering, 34, 3, pp. 66-73, (2020)
[6]  
LIU F Z, XIAO B, LI H., Finding key node sets in complex networks based on improved discrete fireworks algorithm, Journal of Systems Science and Complexity, 34, pp. 1014-1027, (2021)
[7]  
SHAO C C, CUI P S, XUN P, Et al., Rank correlation between centrality metrics in complex networks: an empirical study, Open Physics, 16, 1, pp. 1009-1023, (2018)
[8]  
FREEMAN L C., A set of measures of centrality based on betweenness, Sociometry, 40, 1, pp. 35-41, (1977)
[9]  
DU Y X, GAO C, CHEN X, Et al., A new closeness centrality measure via effective distance in complex networks, Chaos, 25, 3, pp. 440-442, (2015)
[10]  
JOONHYUN B, SANGWOOK K., Identifying and ranking influential spreaders in complex networks by neighborhood coreness, Physica A: Statal Mechanics and its Applications, 395, 4, pp. 549-559, (2014)