Attack vulnerability of self-organizing networks

There are several self-organizing networks in the real world, and these networks severely affect the development of the modern society. This paper investigates the vulnerability of self-organizing networks subject to malicious attacks according to a new framework. Assuming the initial load of node i   as Li=αki+(1-α)∑j∈ΓikjLi=αki+(1-α)∑j∈Γikj with ki and Γi being the degree and the set of neighbor nodes of the node i, where α is a tunable parameter and control the strength of the initial loads of nodes. The node with the maximum degree is considered as the attacked node, and with the changes of the parameter α, cascading failures will be investigated in this paper. Local redistribution rule has been adopted to study the cascading breakdowns of the US power grid and IEEE-118 networks. Additionally, the capacity of the node i is defined as Ci = (1 + β)Li, the critical threshold βc of the US power grid and IEEE-118 networks will be obtained from the evolutional process of cascading failures. Finally, an optimal design of US power grid network is given in this paper.

► The local load redistribution rule is adopted in this paper.
► The larger the network is, the easier the cascading failures occur.
► The larger the load of the node is, the easier the cascading failures occur.
► An optimal design is given to decrease the probability of cascading failures.