论文部分内容阅读
高效的数据分组传输机制是机会网络的核心问题之一,在分析机会网络节点运行规律的基础上,提出一种机会网络路由算法.该算法根据节点间相互接触的历史信息,计算节点接触的平均接触间隔时间,进一步得出两个节点间数据分组传递的期望时间;结合数据分组的新鲜度和节点间数据分组传递期望时间,设计数据分组的效用函数;基于分组的效用函数和传染路由,设计高效的机会网络路由算法,来指导数据分组的有效转发.仿真结果结果表明,与经典算法相比较,基于历史接触概率和数据分组新鲜度的机会网络路由机制能够有效的提高数据分组的传递成功率,同时减少传输时间.
Efficient data packet transmission mechanism is one of the core problems of opportunistic networks. Based on the analysis of the operating rules of opportunistic network nodes, an opportunistic network routing algorithm is proposed. According to the historical information of mutual contact between nodes, the algorithm calculates the average contact of nodes Contact interval time, the expected time of data packet transmission between two nodes is further obtained. The utility function of data packet is designed based on freshness of data packet and expected delivery time of data packet among nodes. Based on packet utility function and infection routing, Efficient opportunistic network routing algorithm to guide the effective forwarding of data packets.The simulation results show that compared with the classical algorithm, opportunistic network routing mechanism based on historical contact probability and data packet freshness can effectively improve the success rate of data packet delivery , While reducing transmission time.