P2P网络节点信任路径优化算法仿真.docxVIP

第 31 卷第 2 期计 算 机 仿 真2014 年 2 月文章编号: 1006 － 9348( 2014) 02 － 0362 － 04P2P 网络节点信任路径优化算法仿真鹃( 齐齐哈尔大学计算机与控制工程学院，黑龙江 齐齐哈尔 161006 )摘要: 关于网络通信节点优化问题针对 P2P 网络系统中由于节点频繁退出易造成网络系统稳定性下降、节点信任评估较难 问题，通过将差分进化算法引入 P2P 网络节点信任路径的粒子群进化问题求解过程，对种群的个体活性进行半协同变异， 提出了半协同进化的 P2P 网络节点信任路径优化算法，首先利用基于粒距和权系数修正的改进粒子群算法，对 P2P 网络节 点信任路径进行初次迭代优化求解，按照平均适应度生成优势子群和普通子群; 然后对优势子群继续用改进的粒子群算法 进行更新，对普通子群利用差分进化算法进行变异，生成具有高活性的子群; 最后利用混合的差分进化算法进行个群更新， 并对节点的推荐信任度进行加权计算。仿真结果证明，改进算法具有良好的鲁棒性，同时执行效率高，当节点跳级数较少 时，可保证系统的信任度可靠。关键词: 网络; 差分进化; 粒子群; 信任度; 推荐信任中图分类号: TP393. 01文献标识码: ASimulation of Algorithm for P2P NetworkNode Trust Path OptimizationDU Juan( Qiqihar University，College of Computer and Control Engineering，Heilongjiang Qiqihar 161006，China)ABSTＲACT: In this paper，the problem of network communication nodes optimization was investigated． In P2P net-work system，frequent exiting of nodes can easily lead to decline in the stability of the network system and cause the trust evaluation of nodes more difficult． To solve the problem，a half coevolution algorithm was introduced to the process of particle swarm evolution for solving of P2P network nodes trust path to make half coevolution mutant for the individual activity of the population． The optimization algorithm for P2P network node trust pathwas proposed based on half coevolution． In this algorithm，firstly，we used the improved particle swarm algorithm based on seed spacing and weight coefficient modification to make initial iterative optimization solution for P2P network node trust path，and generated preponderant subgroup and normal subgroup according to average fitness． Then，the improved particle swarm optimization was used to continually update the preponderant subgroup; the differential evolution algorithm was used to make mutant for normal subgroup to generate a high activity subgroup． Finally，the hybrid differential evolu-tion algorithm was applied to update individual group，and the recommended trust of nodes was made by weighted cal-culation． Simulation result