期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

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

Solving the Routing Problems in Delay Tolerant Networks by HTC
原文传递
导出
摘要 针对传统最短路径算法不适用于延迟容忍网络(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.
作者 刘期烈 潘英俊 李云 赵晓娜
机构地区 重庆大学光电技术及系统教育部重点实验室 重庆邮电大学移动通信重点实验室
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2010年第5期28-32,共5页 Journal of Beijing University of Posts and Telecommunications
基金 国家自然科学基金项目(60702055) 重庆市教委项目(KJ090521) 重庆邮电大学基金项目(A2009-28)
关键词 延迟容忍网络 路由 FLOYD 基于跳数 权值随时间变化 delay tolerant network routing Floyd hop-based time-varying cost
分类号 TN929.53 [电子电信—通信与信息系统]
  • 相关文献

参考文献13

  • 1Juang P, Oki H, Martonosi M, et al. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet [ C ] //J ASPLOS'02. San Jose: ACM Press, 2002: 96-107.
  • 2The project of ZebranNet wildlife tracker [ EB/OL ]. (2002-12-05)[2009-10-19]. http://www, ee. prince- ton. edu/- mrm/zebranet, html.
  • 3Burleigh S, Hooke A, Torgerson L, et al. Delay- tolerant networking: an approach to interplanetary Internet [ J ]. Communications Magazine, 2003, 41(6) : 128-136.
  • 4Warthman F. Delay tolerant networks (DTNs) : a tutorial [ EB/OL]. ( 2003-03-05 ) [ 2009-10-19 ]. http://www. ipnsig, org/reports/DTN_Tutorialll, pdf.
  • 5Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks[ R ]. Durham: Duke University, 2000.
  • 6Jain S, Fall K, Patra R. Routing in a delay tolerant network[ C] //ACM SIGCOMM2004. [S.I. ]: ACM Press, 2004 : 145-158.
  • 7Chen Dazong, Kung H, Blah D. Ad hoc relay wireless networks over moving vehicles on highways [ C ] //ACM Mobihoc 2001. Long Beach: [ s. n. ] , 2001: 247-250.
  • 8Dolev S, Gilbert S, Lynch N A, et al. Virtual mobile nodes for mobile ad hoc networks[ C]//DISC 2004. Amsterdam : [ s. n. ] , 2004 : 230-244.
  • 9Zhao Wenrui, Ammar M, Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks[ C]//ACM Mobihoc 2004. [S.l. ] : ACM Press, 2004 : 187-198.
  • 10Chatzigiannakis I, Nikoletseas S E, Spriakis P G. Analysis and experimental evaluation of an innovative and efficient routing protocol for ad-hoc mobile networks [ J ]. Lecture Notes in Computer Science, 2001, 1982: 99- 110.

二级参考文献15

  • 1侯蓉晖,史浩山,杨少军.无线传感器网络链路统计特性研究与应用[J].系统仿真学报,2007,19(7):1507-1511. 被引量：9
  • 2FALL K. A delay-tolerant network architecture for challenged internets[A]. Proceedings ofACM SIGCOMM'03[C].2003.27-35.
  • 3JAIN S, FALL K, PATRA R. Routing in a delay tolerant network[J]. ACM SIGCOMM, 2004, 34(8-9): 145-158.
  • 4LEGUAY J, FRIEDMAN T, CONAN V. Dtn routing in a mobility pattern space[J]. ACM SIGCOMM Workshop on Delay Tolerant Net-works, 2005.
  • 5薛静锋,陆慧梅,石琳.DTN路由技术研究综述[EB/OL].http://www.paper.educn.2007.
  • 6FALL K,DEMMER M.Delay/disruption tolerant networking[].Proceedings ofth ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobIHoc’).2006
  • 7JAIN S,FALL K,PATRA R.Routing in a delay tolerant network[].Proceedings of Conference on ApplicationsTechnologiesArchitectures and Protocols for Computer Communication(SIGCOMM’).2004
  • 8HANDOREAN R,GILL C,ROMAN G C.Accommodating transient connectivity in ad hoc and mobile settings[].Proceedings of thend International Conference on Pervasive Computing.2004
  • 9SPYROPOULOS T,PSOUNIS K,RAGHAYENDRA C.Efficient routing in intermittently connected mobile networks:The multiple-copy case[].ACM/IEEE Transactions on Networking.2008
  • 10GHOSH J,WESTPHAL C,NGO H,et al.Bridging intermittently connected mobile ad hoc networks(ICMAN)with sociological orbits[C/OL][].th IEEE International Conference on Computer Communications(INFOCOM’).2009

共引文献20

北京邮电大学学报
2010年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部