VULNERABILITY OF COMPLEX NETWORKS UNDER MULTIPLE NODE-BASED ATTACKS
We investigate the vulnerability of complex networks under different node-based attacks.The networks considered include scale-free network (SF),WS small-world network model,ER network and two real-world networks (autonomous system network and Italy power grid).The attacks are induced by removing the nodes in the descending order of the four kinds of weights defined in this paper.By measuring the relative size of the giant component and the average efficiency,the simulations demonstrate that,the kshell index-based attack can more effectively break the connectivity and the functionality of SF network and also is more harmful in reducing the efficiency of ER network.WS network shows more sensitive under the degree-based attack.Interestingly,the degree-based attack can more effectively break the connectivity and reduce the efficiency of the two real-world networks,which is similar to WS small-world network.The findings highlight the identification of key nodes in protecting the real-world networks.
vulnerability attacks k-shell betweenness centrality complex networks
Shudong Li Xiaobo Wu Chao Zhu Aiping Li Lixiang Li Yan Jia
College of Mathematics and Information Science,Shandong Institute of Business and Technology,Shandon School of software engineering,Yantai Vocational College,Shandong Yantai 264003 China Computer Science & Technology,Tsinghua University,Beijing 100084,China School of Computer Science,National University of Defense Technology,Hunan Changsha 410073,China Information Security Center,Beijing University of Posts and Telecommunications,P. O. Box 145,Beijing
国际会议
北京
英文
39-44
2013-04-27（万方平台首次上网日期，不代表论文的发表时间）