| 运用HTC解决延迟容忍网络路由问题 |
| |
| 引用本文： | 刘期烈,潘英俊,李云,赵晓娜.运用HTC解决延迟容忍网络路由问题[J].北京邮电大学学报,2010,33(5):28-32. |
| |
| 作者姓名： | 刘期烈 潘英俊 李云 赵晓娜 |
| |
| 作者单位： | 重庆大学,光电技术及系统教育部重点实验室,重庆,400044;重庆邮电大学,移动通信重点实验室,重庆,400065;重庆大学,光电技术及系统教育部重点实验室,重庆,400044;重庆邮电大学,移动通信重点实验室,重庆,400065 |
| |
| 基金项目： | 国家自然科学基金项目(60702055); 重庆市教委项目(KJ090521); 重庆邮电大学基金项目(A2009-28) |
| |
| 摘 要： | 针对传统最短路径算法不适用于延迟容忍网络(DTN)路由选择以及DTN路由选择的特性，提出了一种基于跳数、权值随时间变化(HTC)的最短路径算法. 该算法的设计不仅考虑到节点间空间因素，还考虑了无线链路的时间因素和该算法的复杂度与正确性. 仿真结果表明，与现有的最早接触(FC)路由算法以及最小预期时延（MED）路由算法相比，此算法可更有效地得到DTN中时延最短的路径.
|
| 关 键 词： | 延迟容忍网络 路由 Floyd 基于跳数、权值随时间变化 |
| 收稿时间： | 2009-10-21 |
Solving the Routing Problems in Delay Tolerant Networks by HTC |
| |
| LIU Qi-lie,PAN Ying-jun,LI Yun,ZHAO Xiao-na.Solving the Routing Problems in Delay Tolerant Networks by HTC[J].Journal of Beijing University of Posts and Telecommunications,2010,33(5):28-32. |
| |
| Authors: | LIU Qi-lie PAN Ying-jun LI Yun ZHAO Xiao-na |
| |
| Affiliation: | LIU Qi-lie1,2,PAN Ying-jun1,LI Yun2,ZHAO Xiao-na2 ( 1. Key Laboratory of Optoelectronics Technology , System,Ministry of Education,Chongqing University,Chongqing 400044,China,2. Key Laboratory of Mobile Communication Technology,Chongqing University of Posts , Telecommunications,Chongqing 400065,China) |
| |
| Abstract: | 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 alg... |
| |
| Keywords: | delay tolerant network routing Floyd hop-based time-varying cost |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
|
