Faculté des sciences

Enhancing network robustness against malicious attacks

Zeng, An ; Liu, Weiping

In: Physical Review E - Statistical, Nonlinear and Soft Matter Physics, 2012, vol. 85, no. 6, p. 066130

In a recent work [ Schneider et al. Proc. Natl. Acad. Sci. USA 108 3838 (2011)], the authors proposed a simple measure for network robustness under malicious attacks on nodes. Using a greedy algorithm, they found that the optimal structure with respect to this quantity is an onion structure in which high-degree nodes form a core surrounded by rings of nodes with decreasing degree. However, in... Plus

Ajouter à la liste personnelle
    Summary
    In a recent work [ Schneider et al. Proc. Natl. Acad. Sci. USA 108 3838 (2011)], the authors proposed a simple measure for network robustness under malicious attacks on nodes. Using a greedy algorithm, they found that the optimal structure with respect to this quantity is an onion structure in which high-degree nodes form a core surrounded by rings of nodes with decreasing degree. However, in real networks the failure can also occur in links such as dysfunctional power cables and blocked airlines. Accordingly, complementary to the node-robustness measurement (Rn), we propose a link-robustness index (Rl). We show that solely enhancing Rn cannot guarantee the improvement of Rl. Moreover, the structure of an Rl-optimized network is found to be entirely different from that of an onion network. In order to design robust networks that are resistant to a more realistic attack condition, we propose a hybrid greedy algorithm that takes both the Rn and Rl into account. We validate the robustness of our generated networks against malicious attacks mixed with both nodes and links failure. Finally, some economical constraints for swapping the links in real networks are considered, and significant improvement in both aspects of robustness is still achieved.