Identifying Vulnerable Nodes of Complex Networks in Cascading Failures Induced by Node-Based Attacks

Abstract EN

In the research on network security, distinguishing the vulnerable components of networks is very important for protecting infrastructures systems.

Here, we probe how to identify the vulnerable nodes of complex networks in cascading failures, which was ignored before.

Concerned with random attack (RA) and highest load attack (HL) on nodes, we model cascading dynamics of complex networks.

Then, we introduce four kinds of weighting methods to characterize the nodes of networks including Barabási-Albert scale-free networks (SF), Watts-Strogatz small-world networks (WS), Erdos-Renyi random networks (ER), and two real-world networks.

The simulations show that, for SF networks under HL attack, the nodes with small value of the fourth kind of weight are the most vulnerable and the ones with small value of the third weight are also vulnerable.

Also, the real-world autonomous system with power-law distribution verifies these findings.

Moreover, for WS and ER networks under both RA and HL attack, when the nodes have low tolerant ability, the ones with small value of the fourth kind of weight are more vulnerable and also the ones with high degree are easier to break down.

The results give us important theoretical basis for digging the potential safety loophole and making protection strategy.