基于机会网络中邻居结点计算选择的最优化带权路径路由算法研究

发布时间：2018-10-14 20:18

【摘要】：在机会网络中,结点选择合适的邻居进行信息传递是决定机会网络算法的关键因素.传统的机会网络算法对于邻居结点的选择存在过渡洪泛和过渡计算,影响了算法的效率.通过对机会网络中结点和其邻居结点的相遇性和携带信息重复性的问题进行研究,设定了结点相遇权值和信息重复性权值.通过计算的方式比较权值大小选择最合适的邻居结点作为下一跳传递信息.通过这样的方式,建立了一种基于权值计算的最优化邻居结点带权路径路由算法(Optimization Neighbors Nodes Weight Path Routing Algorithm)(ONNWP).通过仿真实验,将该算法与机会网络经典算法进行对比,ONNWP在传输成功率、传输延迟和路由开销方面取得了较为明显的优化.
[Abstract]:In opportunistic networks, the key factor to decide the algorithm of opportunistic networks is that nodes choose the right neighbors to transfer information. The traditional opportunistic network algorithm has the transition flooding and transient computation for the selection of neighbor nodes, which affects the efficiency of the algorithm. Based on the study of the encounter between nodes and their neighbors and the repeatability of carrying information in opportunistic networks, the weights of encounter weight and repeatability of information are set up. By calculating the weight value, the most suitable neighbor node is chosen as the next hop to transfer information. In this way, an optimized weighted path routing algorithm (Optimization Neighbors Nodes Weight Path Routing Algorithm) (ONNWP). For neighbor nodes based on weight calculation is established. Compared with the classical algorithm of opportunistic network, ONNWP has achieved obvious optimization in transmission success rate, transmission delay and routing overhead.
【作者单位】：中南大学软件学院;"移动医疗"教育部-中国移动联合实验室;
【基金】：国家自然科学基金项目(61073186,61379057,61073186,61309001,61379110)资助教育部博士点基金优先发展领域课题项目(20120162130008)资助国家“九七三”重点基础研究发展计划项目(2014CB046305)资助中南大学博士生创新基金项目(2014zzts043)资助
【分类号】：TP393.02

【参考文献】