Systems Engineering and Electronics ›› 2023, Vol. 45 ›› Issue (9): 2812-2818.doi: 10.12305/j.issn.1001-506X.2023.09.20

• Systems Engineering • Previous Articles     Next Articles

Network damage maximization algorithm based on topology potential

Jintao YU1,*, Bing XIAO2, Jiajun XIONG2   

  1. 1. Department of Information Countermeasure, Air Force Early Warning Academy, Wuhan 430019, China
    2. Department of Early Warning Intelligence, Air Force Early Warning Academy, Wuhan 430019, China
  • Received:2021-04-08 Online:2023-08-30 Published:2023-09-05
  • Contact: Jintao YU

Abstract:

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.

Key words: complex network, topology potential, damage maximization, cost-effective lazy-forward (CELF) algorithm

CLC Number: 

[an error occurred while processing this directive]