期刊文献+

基于代价的复杂网络抗攻击性研究 被引量:15

Anti-attack Ability Based on Costs in Complex Networks
下载PDF
导出
摘要 目前的复杂网络抗攻击性研究大多基于"无代价"条件,而这一假设下的大多数复杂网络面对的选择性攻击都非常脆弱,这与现实网络相矛盾。针对这一矛盾,提出代价下影响复杂网络抗攻击性的关键指标——网络紧致系数、平均度;基于网络紧致系数、平均度建立了代价下面向节点的选择性攻击模型,定性分析了网络紧致系数、平均度与复杂网络抗攻击性间的关系。仿真结果证实了所提度量指标的有效性:网络紧致系数越大、平均度越大,则网络越鲁棒;相同平均度下,网络紧致系数越大,则网络越鲁棒。 Current researches on anti-attack of complex networks are based on the hypothesis that all the attacks wouldn’t spend any cost.However,most of the complex networks are fragile in confronting selective attack strategies without any cost,which is conflict with real-world networks.Aiming at the contradiction,this paper proposed key in-dexes,i.e.,the network compactness index and average degree,to measure the attack effects with costs.This paper developed the selective node attack strategies model based on the network compactness index,and qualitative analysis of the relation between network compactness index,average degree and anti-attack of complex networks.The detailed simulation results show that the key indexes proposed in the paper are effective:the more compact the network is,and the larger the average degree is,then the more robust the network is;in the same average degrees,the larger the network compactness index is,the more robust the network is.
出处 《计算机科学》 CSCD 北大核心 2012年第8期224-227,255,共5页 Computer Science
基金 广西自然科学基金项目(2011GXNSFB018074)资助
关键词 复杂网络 网络紧致系数 平均度 代价 Complex networks Network compactness index Average degrees Cost
  • 相关文献

参考文献14

  • 1Criado R, Gareia del Amo A. New results on computable effi- ciency and it's stability for complex networks[J]. Journal of Computational and Applied Mathematics, 2006,192 (1) : 59-74.
  • 2Wasserman S, Faust K. Social network analysis: methods and applications [D]. Cambridge University Press, 1994.
  • 3Vazquez A, Pastor-Satorras R, Vespignani A. Large-scale topo- logical and dynamical properties of the internet[J]. Phys. Rev. E, 2002,65 (6) : 066130.
  • 4Adamic L A, Huberman B A. Power-law distribution of the world wide web [J]. Science, 2000,287 (5461) : 2115.
  • 5Sporns O. Network analysis, complexity, and brain function[J]. Complexity, 2002,8 ( 1 ) : 56-60.
  • 6Lew I, Sexton, Thomas R. Network DEA: Efficieney analysis of organizations with complex internal structure[J]. Computersand Operations Research, 2004,31(9) : 1365-1380.
  • 7Xia Yong-xiang. Attack Vulnerability of Complex Communica- tion Networks[J]. IEEE Circuits and Systems, 2008, 55 (1) : 65- 69.
  • 8Schneider C M. The Robustness of Complex Networks[D]. 2011.
  • 9Matthew J F, Shweta B, Lauren A M. Network frailty and the geometry of herd immunity [J]. Proe Biol SCi,2006,273(1602) : 2743-2748.
  • 10Zheng Bo-jin, Huang Dan, Some scale-free networks could be ro- bust under selective node attacks [J]. EPL, 2011, 94:28010- 28015.

同被引文献137

引证文献15

二级引证文献97

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部