最优化选择邻居节点路由协议

Optimal Selection of Neighbor Node Routing Protocol

根据机会网络中数据节点传输特点,提出一种基于异或运算的机会网络最优化选择邻居节点路由协议,即Optimal Selection Of Neighbor Node Routing Protocol(OSNN)算法,该算法通过遍历当前节点的邻接节点,运用异或运算比较并匹配出当前节点的最优下一跳节点,最终找出最优信息传递路径.其关键在于如何运算找出最优下一跳节点.通过仿真实验,并与机会网络的经典协议Epidemic路由协议和PROPHET路由协议比较,OSNN算法有效的改善了机会网络数据传输过程中最优化选择下一跳节点问题,从而提高数据传输成功率,同时有效减少传输过程中的网络副本.

According to nodes transmit data characteristics in opportunistic networks, This paper puts forward a kind of routing protocol in opportunistic networks which is named Optimal Selection of Neighbor Node routing protocol （ OSNN ） algorithm. And then it based on XOR（ A mathematical operation ）. The algorithm suggests the traversal of the current node adjacency nodes, using mathematical XOR comparison and matching the optimal next hop node in current nodes,finally find out the optimal information transmission path. The emphasis is on how to find the optimal next hop node. In the light of simulation experiment and comparing with the traditional op- portunistic networks protocols as Epidemic classic routing protocol and routing protocol of PROPHET, OSNN algorithm is the better than other algorithms in opportunistic networks which can improve deliver ratio in data transmission,and also it can effectively reduce the transmission orocess of cony in onnortunistie networks.