期刊文献+

边权重的混合攻击策略 被引量:3

Hybrid Attack Strategy Based on Edge Weight
下载PDF
导出
摘要 鉴于当前网络攻击策略多样化和复杂化的现状,提出了以边权重作为度量复杂网络中边重要性的指标,并与传统的边介数度量指标进行了对比分析。通过4种类型的仿真网络,论证了边权重的合理性和有效性,并在边攻击策略的基础上提出了一种混合攻击策略。将新的攻击策略与传统的点攻击策略和边攻击策略进行对比分析,仿真结果表明:所提出的混合攻击策略对网络造成的破坏程度明显大于传统的点、边攻击策略。当网络崩溃时,混合攻击策略的攻击次数几乎为点攻击策略的一半。 For the diversification and complexity of current network attack strategy,edge weight as a measure of the importance of edge in complex network was proposed and compared with the traditional edge betweenness measure. Through four different types of simulation network,the edge weight was demonstrated to be reasonable and effective. Meanwhile a hybrid attack strategy was proposed based on the edge attack strategy. Moreover the new attack strategy was compared with the traditional point attack strategy and edge attack strategy respectively. The simulation results show that the destructiveness of hybrid attack strategy is significantly larger than the traditional point or edge attack strategy. When the network crashes,the attack times of hybrid attack strategy is almost half of the point attack strategy.
出处 《河南科技大学学报(自然科学版)》 CAS 北大核心 2017年第6期38-43,共6页 Journal of Henan University of Science And Technology:Natural Science
基金 国家自然科学基金项目(71372135 71140015) 中央高校基本科研业务费专项基金项目(2015-zy-115)
关键词 复杂网络 边权重 边介数 鲁棒性 混合攻击 complex network edge weight edge betweeness robustness hybrid attack
  • 相关文献

参考文献7

二级参考文献99

  • 1谭跃进,吴俊,邓宏钟,朱大智.复杂网络抗毁性研究综述[J].系统工程,2006,24(10):1-5. 被引量:63
  • 2谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:257
  • 3汪小帆,李翔,陈关荣.复杂网络理论与应用[M].北京:清华大学出版社,2006:25-78.
  • 4田炜,邓贵仕,武佩剑,车文娇.世界航运网络复杂性分析[J].大连理工大学学报,2007,47(4):605-609. 被引量:42
  • 5CHUNG F,LU L Y, VU V. Spectra of random graphs with given expected degrees [J]. Proceedings of the National Academy of Sciences of the United States of America,2003,100 (11) :6313 - 6318.
  • 6FREEMAN L C. A set of measures of centrality based upon betweenness [J]. Sociometry, 1997, 40 ( 1 ) : 35 - 41.
  • 7TSEN F S P,SUNG T Y, LIN M Y, et al. Finding the most vital edges with respect to the number of spanning trees[J]. IEEE Transcations on reliability, 1994, 43 (4):600 - 602.
  • 8NEWMAN M E J, STROGATZ S H, WATTS D J. Random graphs with arbitrary degree distributions and their applications [J]. Physical Review E, 2001, 64 (2) :026118.
  • 9CALLAWAY D S,NEWMAN M E J, STROGATZ S H, et al. Network robustness and fragility: percolation on random graphs[J]. Phys Rev Lett, 2000,85 (25): 5468 - 5471.
  • 10MOLLOY M, REED B. A critical point for random graphs with a given degree sequence [J]. Random Structures and Algorithms, 1995,6 (2): 161 - 179.

共引文献82

同被引文献51

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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