Enhancing network robustness against malicious attacks
Top Cited Papers
Open Access
- 27 June 2012
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 85 (6), 066130
- https://doi.org/10.1103/physreve.85.066130
Abstract
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 (), we propose a link-robustness index (). We show that solely enhancing cannot guarantee the improvement of . Moreover, the structure of an -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 and 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.
Keywords
Funding Information
- National Science Foundation
This publication has 33 references indexed in Scilit:
- Mitigation of malicious attacks on networksProceedings of the National Academy of Sciences of the United States of America, 2011
- Catastrophic cascade of failures in interdependent networksNature, 2010
- Optimal synchronization on strongly connected directed networksZeitschrift für Physik B Condensed Matter, 2010
- Missing and spurious interactions and the reconstruction of complex networksProceedings of the National Academy of Sciences of the United States of America, 2009
- Optimal tree for both synchronizability and converging timeEurophysics Letters, 2009
- Synchronization in complex networksPhysics Reports, 2008
- Maps of random walks on complex networks reveal community structureProceedings of the National Academy of Sciences of the United States of America, 2008
- Network robustness to targeted attacks. The interplay of expansibility and degree distributionZeitschrift für Physik B Condensed Matter, 2006
- Stochastic opinion formation in scale-free networksPhysical Review E, 2005
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000