计算机科学 ›› 2012, Vol. 39 ›› Issue (8): 224-227.

• 人工智能 • 上一篇    下一篇

基于代价的复杂网络抗攻击性研究

吴泓润,覃 俊,郑波尽   

  1. (中南民族大学计算机科学学院 武汉430074)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Anti-attach Ability Based on Costs in Complex Networks

  • Online:2018-11-16 Published:2018-11-16

摘要: 目前的复杂网络抗攻击性研究大多基于“无代价”条件,而这一假设下的大多数复杂网络面对的选择性攻击都非常脆弱,这与现实网络相矛盾。针对这一矛盾,提出代价下影响复杂网络杭攻击性的关键指标—网络紧致系数、平均度;基于网络紧致系数、平均度建立了代价下面向节点的选择性攻击模型,定性分析了网络紧致系数、平均度与复杂网络抗攻击性间的关系。仿真结果证实了所提度量指标的有效性:网络紧致系数越大、平均度越大,则网络越鲁棒;相同平均度下,网络紧致系数越大,则网络越鲁棒。

关键词: 复杂网络,网络紧致系数,平均度,代价

Abstract: Current researches on anti-attack of complex networks arc 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 indexes, i. c.,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 ctualitative 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 arc 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.

Key words: Complex networks, Network compactness index, Average degrees, Cost

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!