接触概率和数据分组新鲜度感知的机会网络路由算法

Opportunistic Networks Routing Algorithm with Contact Probability and Data Packet Freshness Perception

高效的数据分组传输机制是机会网络的核心问题之一,在分析机会网络节点运行规律的基础上,提出一种机会网络路由算法.该算法根据节点间相互接触的历史信息,计算节点接触的平均接触间隔时间,进一步得出两个节点间数据分组传递的期望时间;结合数据分组的新鲜度和节点间数据分组传递期望时间,设计数据分组的效用函数;基于分组的效用函数和传染路由,设计高效的机会网络路由算法,来指导数据分组的有效转发.仿真结果结果表明,与经典算法相比较,基于历史接触概率和数据分组新鲜度的机会网络路由机制能够有效的提高数据分组的传递成功率,同时减少传输时间.

Finding an effective data packet delivery scheme is one of the core tasks in the opportunistic network. Based on analyzing the operation rule of opportunistic network nodes, we propose an opportunistic network routing algorithm. The algorithm computes the average contact interval between nodes based on the node historic contact information, and gets the expected delay for data packet delivery between nodes. It combines the data packet freshness and expected delay to designs data packet utility function. At last, we design effective opportunistic network routing algorithm based on utility function and epidemic routing to direct effective data packet forwarding. Simulation results show that HNRHF significantly improves success rate of data packet transmission, at the same time reduces the transmission time comparing with the classical algorithms.