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

All coverage and low-delay routing algorithm based on message ferry in opportunistic networks

作　　者：彭晨[1] 李王辉[2] 王中永 黄希凯 任智[1] 

机构地区：[1]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065 [2]鹤壁职业技术学院电子信息工程学院,河南鹤壁458030

出　　处：《计算机应用研究》2017年第3期819-823,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(61379159);重庆市自然科学基金资助项目(cstc2012jja A40051)

摘　　要：针对现有基于消息摆渡的机会网络路由算法中存在的网络覆盖不全、ferry节点主动运动路径不够优化以及Beacon消息包含冗余字段等问题,提出一种新的路由算法——优化的摆渡路由算法(optimized ferry routing,OFR)。该算法采用自适应调整ferry节点通信半径消除网络覆盖盲区、优化选择ferry节点主动运动路径,使尽可能多的节点相遇以及删除Beacon消息中冗余的位置信息等新机制,在不影响原有数据传输功能的前提下改善网络覆盖,提高数据分组传送成功率、降低数据分组时延和控制开销。理论分析和仿真结果表明:与FTFPF算法相比,OFR算法的数据分组传送成功率至少提高了3.83%,而平均端到端时延和控制开销则分别降低了1.23%和6.34%以上。To address the problems of coverage gaps in the network,unoptimized initiative motion path for ferry and the redundancy of location information in the Beacon message in the existing message ferry routing algorithm for opportunity networks,this paper proposed an novel routing algorithm-OFR,which dynamically selected the active movement path of ferry to meet nodes as much as possible,adopted the new mechanism of adjusting adaptively the communication radius of ferry node to eliminate the coverage gaps and deleted the redundancy of location information in the Beacon message to reduce unnecessary carrying. Without affecting the original data transmission function,OFR could improve success ratio and decreased the delay of data packets and control overhead. Simulation results show that comparing with existing FIMF,MO-FIMF and FTFPF algorithm,OFR can improve success ratio at least 3. 83%,and reduce the average end-to-end delay and control overhead more than 1. 23% and 6. 34%.

关 键 词：机会网络 消息摆渡 覆盖 成功率 时延 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]