Vulnerability of Complex Networks under Neighbor Nodes Attack Strategies

摘要

Currently, for the reason that so multiple measures were deployed to protect the node of the max degree or betweenness, it was difficult to launch the traditional attack strategy which was initiated to destroy the nodes of the max degree or betweenness. As a result, the neighbor nodes of the max degree/betweenness node were become the first nodes to be destroyed by attacker because the protective measures on these neighbor nodes were generally relatively weak. In view of this, two neighbor nodes attack strategies of NND and NNB were proposed. The vulnerability of some complex networks was analyzed including three model networks (Random, Scale-free and Small-world) as well as four real networks (Word adjacencies, NetSience, Polblogs and Football) by using iterative execution. The results of experiment to three model networks and four real networks showed that the NND and NNB attack strategies almost had the same destructiveness to each of these three model networks, but under the same attack strategy, the model networks demonstrated that Scale-free network was the most vulnerable, while Small-world network was the best robustness.