论文部分内容阅读
在机会网络中,结点选择合适的邻居进行信息传递是决定机会网络算法的关键因素.传统的机会网络算法对于邻居结点的选择存在过渡洪泛和过渡计算,影响了算法的效率.通过对机会网络中结点和其邻居结点的相遇性和携带信息重复性的问题进行研究,设定了结点相遇权值和信息重复性权值.通过计算的方式比较权值大小选择最合适的邻居结点作为下一跳传递信息.通过这样的方式,建立了一种基于权值计算的最优化邻居结点带权路径路由算法(Optimization Neighbors Nodes Weight Path Routing Algorithm)(ONNWP).通过仿真实验,将该算法与机会网络经典算法进行对比,ONNWP在传输成功率、传输延迟和路由开销方面取得了较为明显的优化.
In the opportunistic network, the node selects the appropriate neighbor for information transfer is the key factor to determine the opportunistic network algorithm.Traditional opportunistic network algorithm has the transitional flooding and transitional computation for the selection of neighbor nodes, which affects the efficiency of the algorithm. In the opportunistic network, the meeting point of the node and its neighbors and the repeatability of the carried information are studied, and the weights of the nodes and the repeatability of the information are set.We can choose the most suitable neighbor by comparing the weights Node as the next hop to transmit information.Through this way, an optimized neighbor node Weighting Routing Algorithm (ONNWP) based on weight calculation is established.According to the simulation experiment, Comparing this algorithm with the classic algorithm of opportunistic network, ONNWP has made obvious optimization in terms of transmission success rate, transmission delay and routing overhead.