一种运行轨迹驱动的移动自组织网络路由算法  

A Trace-Driven Routing Algorithm in Mobile Ad Hoc Networks

作　　者：陶桦[1,2] 许艺凡[1,2] 王笑笑[1,2] 钟晓[1,2] 陶军[1,2] 

机构地区：[1]东南大学计算机科学与工程学院,南京210096 [2]东南大学教育部计算机网络和信息集成重点实验室,南京210096

出　　处：《北京邮电大学学报》2014年第6期125-128,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61370209;61370206);国家重点基础研究发展计划(973计划)项目(2009CB320501)

摘　　要：在移动自组织网络(MANETs)中常见路由算法的基础上,如单副本路由和泛洪路由,提出了一种基于轨迹相似度的单副本路由算法.针对单副本路由和泛洪路由中存在的问题,如单副本路由中的大传输延迟、泛洪路由中的过量网络资源消耗及由此导致的数据丢失,提出了基于历史轨迹记录相似度的多副本路由算法.通过仿真实验,对所提算法在转发成功率、转发延时及转发次数等性能参数方面进行了评估.实验结果表明,与现有的路由算法相比,所提出的算法具有更好的性能表现,达到了预期的设计目标.Based on the analysis of the common routing algorithms in mobile ad hoc networks（ MANETs）,e. g.,single-copy and flooding,a routing algorithm,which uses single copy and the similarities of the trace,is proposed. To address the problems of single-copy and flooding routing,such as the high transmission delay in single-copy routing,the large amount of the network overhead and packet loss in the flooding,we K-copies routing algorithm based on the similarities of nodes trace records. Finally,the algorithms are evaluated in terms of several performance parameters,i. e.,the packet delivery ratio,the average transmission delay and forwarding hops. The results of the simulations show that our algorithms have the better performance than other existing routing algorithms in MANETs.

关 键 词：移动自组织网络 单副本路由 多副本路由 轨迹驱动 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]