论文部分内容阅读
根据机会网络中数据节点传输特点,提出一种基于异或运算的机会网络最优化选择邻居节点路由协议,即Optimal Selection Of Neighbor Node Routing Protocol(OSNN)算法,该算法通过遍历当前节点的邻接节点,运用异或运算比较并匹配出当前节点的最优下一跳节点,最终找出最优信息传递路径.其关键在于如何运算找出最优下一跳节点.通过仿真实验,并与机会网络的经典协议Epidemic路由协议和PROPHET路由协议比较,OSNN算法有效的改善了机会网络数据传输过程中最优化选择下一跳节点问题,从而提高数据传输成功率,同时有效减少传输过程中的网络副本.
According to the transmission characteristics of data nodes in opportunistic networks, an Optimal Selection of Neighbor Node Routing Protocol (OSNN) routing algorithm based on XOR operation is proposed. This algorithm traverses the adjacent nodes of the current node, Use the exclusive-OR operation to compare and match the optimal next-hop node of the current node, and finally find the optimal information transfer path.The key lies in how to find out the optimal next-hop node.From the simulation experiment, The classical protocol Epidemic routing protocol and PROPHET routing protocol comparison, OSNN algorithm effectively improves the opportunistic network data transmission process to choose the next-hop node optimization problem, thereby enhancing the success rate of data transmission, while reducing the transmission network copy.