基于消息摆渡的机会网络全覆盖低时延路由算法

发布时间：2018-04-09 16:25

本文选题：机会网络　切入点：消息摆渡　出处：《计算机应用研究》2017年03期

【摘要】：针对现有基于消息摆渡的机会网络路由算法中存在的网络覆盖不全、ferry节点主动运动路径不够优化以及Beacon消息包含冗余字段等问题,提出一种新的路由算法——优化的摆渡路由算法(optimized ferry routing,OFR)。该算法采用自适应调整ferry节点通信半径消除网络覆盖盲区、优化选择ferry节点主动运动路径,使尽可能多的节点相遇以及删除Beacon消息中冗余的位置信息等新机制,在不影响原有数据传输功能的前提下改善网络覆盖,提高数据分组传送成功率、降低数据分组时延和控制开销。理论分析和仿真结果表明:与FTFPF算法相比,OFR算法的数据分组传送成功率至少提高了3.83%,而平均端到端时延和控制开销则分别降低了1.23%和6.34%以上。
[Abstract]:Aiming at the existing routing algorithms based on message ferrying-based opportunistic network, the active motion path of incomplete overlay nodes is not optimized, and the redundant fields of Beacon messages are not optimized.A new routing algorithm, optimized ferry routing algorithm, is proposed.The algorithm adaptively adjusts the communication radius of the ferry node to eliminate the blind area of the network, optimizes the choice of the active moving path of the ferry node, makes as many nodes meet as possible, and removes the redundant position information in the Beacon message.Without affecting the original data transmission function, the network coverage is improved, the success rate of data packet transmission is increased, and the delay of data packet and control overhead are reduced.The theoretical analysis and simulation results show that compared with the FTFPF algorithm, the data packet transmission success rate of the FTFPF algorithm increases at least 3.83%, while the average end-to-end delay and control overhead are reduced by 1.23% and 6.34%, respectively.
【作者单位】：重庆邮电大学移动通信技术重庆市重点实验室;鹤壁职业技术学院电子信息工程学院;
【基金】：国家自然科学基金资助项目(61379159) 重庆市自然科学基金资助项目(cstc2012jja A40051)
【分类号】：TN915.0

【参考文献】