P2P网络中最近节点定位的优化方法研究与实现

发布时间：2018-07-03 07:34

本文选题：PP网络 + 最近节点　；参考：《科学技术与工程》2016年16期

【摘要】：P2P网络移动节点设备资源短缺,导致网络资源负载不均衡,使P2P网络处于动态多变的状态。传统方法依据权重大小对最近节点进行定位,所耗费资源较多,无法对负载的网络资源均衡调整,导致定位精度差。提出基于信任度和蚁群算法的P2P网络中最近节点定位优化方法,对P2P网络中节点间的信任度进行计算;并及时更新计算结果。在此基础上,采用蚁群算法对最近节点进行定位,将转移概率函数值最大的节点作为最近节点。为避免节点定位过程中负载不均衡的问题,对其进行优化处理,引入转移概率函数值、能量值以及业务执行等候队列长度,获取定位最近节点的均衡函数,选择均衡函数值最大的节点作为最近节点。实验结果表明,所提方法提高了P2P网络中最近节点定位的效率和精度,具有良好的应用价值。
[Abstract]:The resource shortage of P2P mobile node leads to the imbalance of network resource load, which makes P2P network dynamic and changeable. The traditional method uses weight to locate the nearest node, which consumes more resources, and can not balance the load network resources, resulting in poor positioning accuracy. Based on trust degree and ant colony algorithm, this paper proposes an optimization method for the location of nearest nodes in P2P network, which calculates the trust degree between nodes in P2P network, and updates the calculation results in time. On this basis, the nearest node is located by ant colony algorithm, and the node with the largest transfer probability function is regarded as the nearest node. In order to avoid the problem of load imbalance in the process of node location, the transfer probability function, the energy value and the queue length of the service execution are introduced to obtain the equalization function of the nearest node. Select the node with the largest equalization function as the nearest node. Experimental results show that the proposed method improves the efficiency and accuracy of nearest node location in P2P networks and has good application value.
【作者单位】：福建师范大学光电与信息工程学院;厦门理工学院经济与管理实验中心;
【分类号】：TP393.02

【相似文献】