计算机应用 ›› 2014, Vol. 34 ›› Issue (6): 1666-1670.

• 计算机安全 • 上一篇    下一篇

基于社团划分的复杂网络级联抗毁攻击策略

丁超1,姚宏2,杜军1,彭兴钊1,李浩敏1   

  1. 1. 空军工程大学 航空航天工程学院,西安 710038
    2. 空军工程大学 理学院,西安 710051
  • 收稿日期:2013-12-09 修回日期:2014-01-29 出版日期:2014-06-01 发布日期:2014-07-02
  • 通讯作者: 丁超
  • 作者简介:丁超(1989-),男,河南商丘人,硕士研究生,主要研究方向:复杂网络数据挖掘;姚宏(1963-),女,陕西西安人,教授,博士生导师,主要研究方向:复杂系统非线性动力学;杜军(1973-),男,山西太原人,副教授,博士,主要研究方向:智能故障诊断;彭兴钊(1987-),男,河南封丘人,博士研究生,主要研究方向:复杂网络;李浩敏(1989-),男,河南新郑人,硕士研究生,主要研究方向:复杂网络抗毁性。〖JP〗
  • 基金资助:

    陕西省自然科学基金资助项目;航空科学基金资助项目

Cascading invulnerability attack strategy of complex network via community detection

DING Chao1,YAO Hong2,DU Jun1,PENG Xingzhao1,LI Minhao1   

  1. 1. College of Aeronautics and Astronautics Engineering, Air Force Engineering University, Xi'an Shaanxi 710038, China
    2. College of Science, Air Force Engineering University, Xi’an Shaanxi 710051, China
  • Received:2013-12-09 Revised:2014-01-29 Online:2014-06-01 Published:2014-07-02
  • Contact: DING Chao

摘要:

为研究在社团划分基础上复杂网络的级联抗毁攻击策略,采用节点及其邻居节点介数定义初始负荷,这种定义方式综合考虑了节点的信息,采用局部择优分配策略处理故障节点负荷,研究了网络耦合强度,WS(Watts-Strogatz)小世界网络、BA(Barabási-Albert)无标度网络、ER(Erds-Rényi)随机网络、局域世界(WL)网络在社团划分攻击策略下抗毁性,以及不同攻击策略下具有重叠和非重叠社团结构网络的抗毁性。仿真结果表明,网络的耦合强度与抗毁性成负相关;不同类型网络在快速分裂算法识别社团前提下,攻击介数最大节点时网络抗毁性最弱;具有重叠社团结构的网络在集团渗流算法(CPM)识别后,采用攻击重叠部分介数最大节点的策略时网络抗毁性最弱。结论表明采用社团划分的攻击策略可以最大规模破坏网络。

Abstract:

In order to investigate the cascading invulnerability attack strategy of complex network via community detection, the initial load of the node was defined by the betweenness of the node and its neighbors, this defining method comprehensively considered the information of the nodes, and the load on the broken nodes were redistributed to its neighbors according to the local preferential probability. When the network being intentionally attacked based on community detection, the couple strength, the invulnerability of Watts-Strogatz (WS) network, Barabási-Albert (BA) network, Erds-Rényi (ER) network and World-Local (WL) network, as well as network with overlapping and non-overlapping community under differet attack strategies were studied. The results show that the network's cascading invulnerability is negatively related with couple strength; as to different types of networks, under the premise that fast division algorithm correctly detects community structure, the networks invulnerability is lowest when the node with largest betweenness was attacked; after detecting overlapping community using the Clique Percolation Method (CPM), the network invulnerability is lowest when the overlapping node with largest betweenness was attacked. It comes to conclusion that the network will be largest destoryed when using the attack strategy of complex network via community detection.