网络抗毁性的点韧性度指标计算方法研究  

Study of computing method to node tenacity index for network invulnerability

作　　者：孙成雨[1] 申卯兴[2] 史向峰[1] 

机构地区：[1]空军工程大学防空反导学院,西安710051 [2]西京学院理学院,西安710123

出　　处：《计算机应用研究》2017年第7期1997-2000,共4页Application Research of Computers

基　　金：全军军事学研究生课题资助项目

摘　　要：为快速获取网络点韧性度以衡量其抗毁性性能,设计基于改进二进制粒子群(BPSO)算法的点韧性度计算方法。改进BPSO算法的概率映射函数和位置更新式以解决算法容易陷入局部最优的不足,对网络节点状态进行编码以获取种群粒子,并设计基于广度优先搜索思想的方法求解剩余网络的适应度函数值;最后综合改进BPSO算法和适应度函数求解算法设计点韧性度计算方法。在两种基本网络和两种实际网络中的仿真分析验证了方法的有效性。For rapid calculation of node tenacity, which can depict the invulnerability performance of network, this paper designed a computational method based on modified binary particle swarm optimization arithmetic. First, to improve astringency of the BPSO arithmetic, the arithmetic adopted an improved bit transfer probability function and location updating formula. Secondly, the network employed binary variable which could indicate network nodes’ condition for population particles, then the residual network gained its fitness function value using algorithm based on the breadth first search ideology. Last, this paper devised the computing method for network node tenacity by colligating the modified BPSO arithmetic and the designed fitness function value. Results of experiment conducted in two basic networks and two realistic networks illustrate that the algorithm is impactful and high-performance to calculate network tenacity.

关 键 词：抗毁性 韧性度 二进制粒子群算法 广度优先搜索算法 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]