期刊文献+

P2P网络节点信息信任度计算模型仿真研究 被引量:5

Research and Simulation on Information Trust Calculation Model of P2P Network Nodes
下载PDF
导出
摘要 P2P网络系统中竹点持有信息的信任度评估是节点安全性能评估的重要指标,P2P网络中由于对中心节点较为依赖和节点频繁退出及加入,会造成的节点能量波动,造成传统的网络节点信任度计算出现偏差,提出了改进量子遗传算法的P2P网络节点信息信任模型。将P2P网络系统中节点信任度估计问题转化为从源节点到目的节点的最优信任路径寻优问题;对节点的可能信息传递路径进行染色体映射,计算其适应度值;然后利用改进的粒子群算法对量子旋转角度进行动态调整,依据个体信息熵和自适应变异算子迭代的进行最优个体和适应度值的搜索,输出节点信任关系解空间中的最优解。实验证明,改进算法具有较好的收敛速度和执行效率,且当节点跳级数较少时,可明显提高信任度计算的准确性。 The trust evaluation of nodes information was an important index to evaluate the safety performance in P2P network system. An improved P2P network node information trust model was proposed based on quantum genetic algorithm. The P2P network node trust estimation problem was transformed into an optimization problem of optimal trust path from source node to destination node. The information transfer path was implemented with chromosome mapping. The fitness value was calculated. The improved particle swarm algorithm was used to dynamically adjust the quantum rotation angle. The individual information entropy and adaptive mutation operator iterative were used for searching the optimal individual and the fitness value. The optimal solution of node trust solution space was output- ted. Simulation result proves that the improved algorithm has better convergence speed and implementation efficiency. When the node skip is less, the accuracy of nodes trust degree calculation can be improved significantly.
作者 蒋越
机构地区 中国人民解放军
出处 《计算机仿真》 CSCD 北大核心 2014年第1期298-301,共4页 Computer Simulation
关键词 量子遗传算法 信任度 粒子群算法 推荐信任 Quantum genetic algorithm Trust Particle swarm algorithm Recommend trust
  • 相关文献

参考文献7

  • 1R Chen, W Yeager. Poblano;A distributed trust model for P2P net-works 77.-/4-02-08[J]. Palo Alto;Sun Microsystem, 2002.
  • 2G Caronni,R D Sriram. Walking the Web of trust [ C]. Proceedingsof the 9 th IEEE International Workshops on Enabling Technologies:Infrastructure for Collaborative Enterprises. [ S. 1. ] : IEEE Press,2000:153-159.
  • 3武昊然.GPS和无线传感器网络融合定位算法研究[J].计算机仿真,2009,26(11):145-148. 被引量:16
  • 4F Cornelli, et al. Choosing reputable servants in a P2P network[C]. Proc of the 11th International World Wide Web Conf.,Ha-waii, 2002:411-499.
  • 5阳春华,谷丽姗,桂卫华.自适应变异的粒子群优化算法[J].计算机工程,2008,34(16):188-190. 被引量:51
  • 6K H Han,J H Kim. Genetic quantum algorithm and its applicationto combinatorial optimization problem[ C]. Proc of IEEE Congresson Evolutionary Computation, 2000 : 1354-1360.
  • 7王竹荣,杨波,吕兴朝,崔杜武.一种改进的量子遗传算法研究[J].西安理工大学学报,2012,28(2):145-151. 被引量:11

二级参考文献30

  • 1杨俊安,庄镇泉.量子遗传算法研究现状[J].计算机科学,2003,30(11):13-15. 被引量:54
  • 2李莉,温向明,董树松.无线传感器网络路由协议的研究与展望[J].中国电子科学研究院学报,2006,1(1):17-21. 被引量:10
  • 3李朝荣,张鹰,张安妮.基于PSO算法的神经网络集成入侵检测系统[J].计算机工程,2007,33(14):123-124. 被引量:7
  • 4Lloyd O Krause. A direct solution to GPS type naviga- tion equations[J]. IEEE Trans. Aeros. Elec. Sys., 1987, AES-23(2): 225 - 232.
  • 5Elliott D Kaplan, Christopher J Hegarty. Understanding GPS Principles and Applications 2nd Edition [ J ]. Artech House Press . 2005.14 - 46,346 - 415.
  • 6He Tian, Huang Chengdu, B M Blum. Range -free Localization Schemes in Large Scale Sensor Networks [ C ]. Proceedings of the 9th Annum International Conference on Mobile Computing and Networking. New York, 2003.81 -95.
  • 7A Harter, A Hopper, P Steggles. The Anatomy of a Context - aware Application [ C ]. Proceedings of the Annual lntemational Conference on Mobile Computing and Networking. IEEE Press, 1999.59 - 68.
  • 8L Girod, D Estrin. Robust Range Estimation Using Acoustic and Muhimodal Sensing[C]. Proc. of IEEE International Conference on Intelligent Robots and Systems. IEEE Press, 2001. 1312 - 1320.
  • 9D Niculescu, B Nath. Ad Hoc Positioning System (APS)Using AoA[ C]. Proceedings of the IEEE INFOCOM' 03. IEEE Press, 2003. 1734 - 1743.
  • 10L Girod, V Bychovskiy, J Elson. Locating Tiny Sensors in Time and Space: A Case Study [ C ]. Proceedings of the IEEE International Conference on Computer Design. Freiburg, 2002. 214 - 219.

共引文献73

同被引文献41

引证文献5

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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