考虑成本时拓扑可调无标度网络鲁棒性研究
|
摘要
为了研究无标度网络拓扑结构对网络鲁棒性的影响,结合对复杂网络鲁棒性有重要影响的节点介数和边权重两种指标,提出一种考虑成本的拓扑可调无标度网络攻击方法。该方法在攻击网络中节点(边)时引入了节点(边)的攻击成本因素,以节点介数(边权重)来近似衡量节点(边)的攻击成本,采用不同节点(边)攻击策略对网络进行攻击,并采用最大连通子图相对值作为网络鲁棒性测度指标,利用该方法对无标度网络的幂率指数、平均度与网络鲁棒性的关系分别进行了研究。结果表明,采用蓄意攻击策略时,对于同一节点(边)攻击成本,无标度网络的幂率指数越小或平均度越大,网络的鲁棒性越强。仿真实验验证了该方法的有效性和可行性。
In order to investigate the effects of scale-free network's topology features on network robustness,combining two indexes of node's betweenness and edge's weight,which had important influence on network robustness,this paper proposed a tunable scale-free network attack method with cost. This method considered the attack cost of nodes( edges) when the network was attacked. The method used the node's betweenness( edge's weight) to approximately measure the cost of nodes( edges).This method used different attack strategies of nodes( edges) to attack the network. And this method used the largest component to quantify the network robustness. By using the method,this paper investigated the relation between scale-free network's power-law exponent,average degree and network robustness. When adopting the intentional attack strategy and fixing the cost value of nodes( edges),the experimental results show that the lower the power-law exponent of scale-free networks or the higher the average degree of scale-free networks,the more robust of the network. The simulation results verify the effectiveness and feasibility of the proposed method.
In order to investigate the effects of scale-free network's topology features on network robustness,combining two indexes of node's betweenness and edge's weight,which had important influence on network robustness,this paper proposed a tunable scale-free network attack method with cost. This method considered the attack cost of nodes( edges) when the network was attacked. The method used the node's betweenness( edge's weight) to approximately measure the cost of nodes( edges).This method used different attack strategies of nodes( edges) to attack the network. And this method used the largest component to quantify the network robustness. By using the method,this paper investigated the relation between scale-free network's power-law exponent,average degree and network robustness. When adopting the intentional attack strategy and fixing the cost value of nodes( edges),the experimental results show that the lower the power-law exponent of scale-free networks or the higher the average degree of scale-free networks,the more robust of the network. The simulation results verify the effectiveness and feasibility of the proposed method.
引文
[1] Goh K I,Kahng B,Kim D. Universal behavior of load distribution in scale free networks[J]. Physical Review Letters,2001,87(27):278701.
[2] Hong Chen,He Ning,Lordan O,et al. Efficient calculation of the robustness measure R for complex networks[J]. Physica A:Statistical Mechanics and its Applications,2017,478(7):63-68.
[3] Nie Tingyuan,Guo Zheng,Zhao Kun,et al. New attack strategies for complex networks[J]. Physica A:Statistical Mechanics and its Applications,2015,424(4):248-253.
[4]吴俊,谭索怡,谭跃进,等.基于自然连通度的复杂网络抗毁性分析[J].复杂系统与复杂性科学,2014,11(1):77-86.(Wu Jun,Tan Suoyi,Tan Yuejin,et al. Analysis of invulnerability in complex networks based on natural connectivity[J]. Computer Systems and Complexity Science,2014,11(1):77-86.)
[5]冯慧芳,李彩虹.基于复杂网络的车载自组织网络抗毁性分析[J].计算机应用,2016,36(7):1789-1792,1806.(Feng Huifang,Li Caihong. Invulnerability analysis of vehicular Ad hoc network based on complex network[J]. Journal of Computer Applications,2016,36(7):1789-1792,1806.)
[6]陆靖桥,傅秀芬,蒙在桥.复杂网络的鲁棒性与中心性指标的研究[J].计算机应用与软件,2016,33(4):302-309.(Lu Jingqiao,Fu Xiufen,Meng Zaiqiao. Research on robustness and centrality metrics of complex networks[J]. Computer Applications and Software,2016,33(4):302-309.)
[7]谢逢洁,崔文田.加权快递网络鲁棒性分析及优化[J].系统工程理论与实践,2016,36(9):2391-2399.(Xie Fengjie,Cui Wentian.Analyzing and optimizing the robustness of weighted express networks[J]. Systems Engineering Theory and Practice,2016,36(9):2391-2399.)
[8] Motter A E,Lai Yingcheng. Cascade-based attacks on complex networks[J]. Physical Review E:Statistical Nonlinear and Soft Matter Physics,2002,66(6):065102.
[9]彭兴钊,姚宏,张志浩,等.基于节点蓄意攻击的无标度网络级联抗毁性研究[J].系统工程与电子技术,2013,35(9):1974-1978.(Peng Xingzhao,Yao Hong,Zhang Zhihao,et al. Research on cascading invulnerability of scale-free networks under node-based-attack[J].Systems Engineering and Electronics,2013,35(9):1974-1978.)
[10] Wang Wenxu,Chen Guanrong. Universal robustness characteristic of weighted networks against cascading failure[J]. Physical Review E:Statistical Nonlinear and Soft Matter Physics,2008,77(2):026101.
[11]Mirzasoleiman B,Babaei M,Jalili M,et al. Cascaded failures in weighted networks[J]. Physical Review E:Statistical Nonlinear and Soft Matter Physics,2011,84(2):046114.
[12]Hong Chen,Cao Xianbin,Du Wenbo,et al. The effect of attack cost on network robustness[J]. Physica Scripta,2013,87(5):458-465.
[2] Hong Chen,He Ning,Lordan O,et al. Efficient calculation of the robustness measure R for complex networks[J]. Physica A:Statistical Mechanics and its Applications,2017,478(7):63-68.
[3] Nie Tingyuan,Guo Zheng,Zhao Kun,et al. New attack strategies for complex networks[J]. Physica A:Statistical Mechanics and its Applications,2015,424(4):248-253.
[4]吴俊,谭索怡,谭跃进,等.基于自然连通度的复杂网络抗毁性分析[J].复杂系统与复杂性科学,2014,11(1):77-86.(Wu Jun,Tan Suoyi,Tan Yuejin,et al. Analysis of invulnerability in complex networks based on natural connectivity[J]. Computer Systems and Complexity Science,2014,11(1):77-86.)
[5]冯慧芳,李彩虹.基于复杂网络的车载自组织网络抗毁性分析[J].计算机应用,2016,36(7):1789-1792,1806.(Feng Huifang,Li Caihong. Invulnerability analysis of vehicular Ad hoc network based on complex network[J]. Journal of Computer Applications,2016,36(7):1789-1792,1806.)
[6]陆靖桥,傅秀芬,蒙在桥.复杂网络的鲁棒性与中心性指标的研究[J].计算机应用与软件,2016,33(4):302-309.(Lu Jingqiao,Fu Xiufen,Meng Zaiqiao. Research on robustness and centrality metrics of complex networks[J]. Computer Applications and Software,2016,33(4):302-309.)
[7]谢逢洁,崔文田.加权快递网络鲁棒性分析及优化[J].系统工程理论与实践,2016,36(9):2391-2399.(Xie Fengjie,Cui Wentian.Analyzing and optimizing the robustness of weighted express networks[J]. Systems Engineering Theory and Practice,2016,36(9):2391-2399.)
[8] Motter A E,Lai Yingcheng. Cascade-based attacks on complex networks[J]. Physical Review E:Statistical Nonlinear and Soft Matter Physics,2002,66(6):065102.
[9]彭兴钊,姚宏,张志浩,等.基于节点蓄意攻击的无标度网络级联抗毁性研究[J].系统工程与电子技术,2013,35(9):1974-1978.(Peng Xingzhao,Yao Hong,Zhang Zhihao,et al. Research on cascading invulnerability of scale-free networks under node-based-attack[J].Systems Engineering and Electronics,2013,35(9):1974-1978.)
[10] Wang Wenxu,Chen Guanrong. Universal robustness characteristic of weighted networks against cascading failure[J]. Physical Review E:Statistical Nonlinear and Soft Matter Physics,2008,77(2):026101.
[11]Mirzasoleiman B,Babaei M,Jalili M,et al. Cascaded failures in weighted networks[J]. Physical Review E:Statistical Nonlinear and Soft Matter Physics,2011,84(2):046114.
[12]Hong Chen,Cao Xianbin,Du Wenbo,et al. The effect of attack cost on network robustness[J]. Physica Scripta,2013,87(5):458-465.