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

Neighbors Nodes Count and Select Optimized Weight Path Routing Algorithm in Opportunistic Network

在机会网络中,结点选择合适的邻居进行信息传递是决定机会网络算法的关键因素.传统的机会网络算法对于邻居结点的选择存在过渡洪泛和过渡计算,影响了算法的效率.通过对机会网络中结点和其邻居结点的相遇性和携带信息重复性的问题进行研究,设定了结点相遇权值和信息重复性权值.通过计算的方式比较权值大小选择最合适的邻居结点作为下一跳传递信息.通过这样的方式,建立了一种基于权值计算的最优化邻居结点带权路径路由算法(Optimization Neighbors Nodes Weight Path Routing Algorithm)(ONNWP).通过仿真实验,将该算法与机会网络经典算法进行对比,ONNWP在传输成功率、传输延迟和路由开销方面取得了较为明显的优化.

In opportunistic networks,how to select neighbors for nodes improve message delivering. The traditional algorithms select neighbors to have some trouble with over-flood and over-count. Nodes and their neighbors ,in opportunistic networks ,have some trou- ble with encounter problem and repetitiveness of carrying messages. This paper defines the weight of encounter and repetitiveness, and then in the light of counting and comparing with weight,it can be selected next hop and transmitted messages. It can be found an algo- rithm -Optimization Neighbors Nodes Weight Path Routing Algorithm （ ONNWP } in this method. According to simulation, this algorithm improves delivery ratio, delivery delay and overhead. And then this algorithm acquires good result when it is compared with clas- sical algorithms in opporttmistic networks.