运用HTC解决延迟容忍网络路由问题  

Solving the Routing Problems in Delay Tolerant Networks by HTC

作　　者：刘期烈[1,2] 潘英俊[1] 李云[2] 赵晓娜[2] 

机构地区：[1]重庆大学光电技术及系统教育部重点实验室,重庆400044 [2]重庆邮电大学移动通信重点实验室,重庆400065

出　　处：《北京邮电大学学报》2010年第5期28-32,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(60702055);重庆市教委项目(KJ090521);重庆邮电大学基金项目(A2009-28)

摘　　要：针对传统最短路径算法不适用于延迟容忍网络(DTN)路由选择以及DTN路由选择的特性,提出了一种基于跳数、权值随时间变化(HTC)的最短路径算法.该算法的设计不仅考虑到节点间空间因素,还考虑了无线链路的时间因素和该算法的复杂度与正确性.仿真结果表明,与现有的最早接触(FC)路由算法以及最小预期时延(MED)路由算法相比,此算法可更有效地得到DTN中时延最短的路径.The traditional shortest path algorithm is not suitable for the routing choice in delay tolerant networks （DTN）. According to the routing features in DTN, a new shortest path algorithm hop-based, time-varying cost （HTC） is proposed based on the hop and the cost varied with the time. The design of the routing algorithm not only considers the space factor between the nodes in DTN, but also the time factor of the wireless links and the complexity and accuracy. Simulation compared with the existing routing algorithm such as first contact （FC）, minimum expected delay （MED）, indicate that the algorithm proposed by this paper is more effective to get the shortest path.

关 键 词：延迟容忍网络 路由 FLOYD 基于跳数 权值随时间变化 

分 类 号：TN929.53[电子电信—通信与信息系统]