期刊文献+

基于城市公共交通移动模型的协作延迟容忍网络路由策略 被引量:1

Cooperative delay and tolerant network routing strategy based on urban public transport mobility model
在线阅读 下载PDF
导出
摘要 如何利用有限的传输机会可靠地传送车载服务感知信息是智能交通发展的"瓶颈"问题,利用公共交通中车辆的运动规律,提出基于节点之间机会接触来进行消息的逐跳转发策略,同时结合公共交通系统自身的特点,设计了一种基于公共交通移动模型的协作延迟容忍网络(DTN)路由算法TF。首先,根据公共交通移动模型自身的特点,将公交、长途客车等节点按其运动路径进行分组,提出一种基于固定运动路径分组的DTN路由算法;然后,将出租车、行人类节点定义为自由节点,并设计了一种基于转发因子控制的DTN路由策略作为分组路由机制的补充。仿真结果表明,与Epidemic、Prophet以及SAW路由算法相比,TF路由算法具有较高的消息投递率和较低的平均延迟。 How to use the limited transmission opportunity to transmit the information of the vehicle service perception reliably is the "bottleneck" problem in the development of intelligent transportation. By utilizing the motion law of vehicles in public transport, the hop by hop message forwarding mechanism based on opportunistic contact between nodes was put forward. And in combination with the characteristics of the public transport system, the cooperative Delay and Tolerant Network (DTN) muting strategy (TF) based on urban public transport mobility model was designed. Firstly, according to the characteristics of public transportation mobile model itself, such as bus, intercity bus nodes were grouped based on their motion paths, and a packet DTN routing algorithm based on fixed moving path was proposed. Then the taxi, human nodes were defined as free nodes, and a kind of DTN routing strategy based on forward factor control was designed as a supplement to the packet muting mechanism. The simulation results show that compared with the Epidemic, Prophet and Spray And Wait (SAW) routing algorithms, TF routing algorithm has higher message delivery ratio and lower average delay.
出处 《计算机应用》 CSCD 北大核心 2016年第11期3021-3027,共7页 journal of Computer Applications
基金 重庆市科委基础和前沿研究项目(cstc2014jcyjA40039) 重庆市教委科学技术研究项目(KJ1400402)~~
关键词 智能交通 逐跳转发 运动路径 自由节点 转发因子 intelligent transportation per hop forwarding motion path free node forwarding factor
  • 相关文献

参考文献6

二级参考文献71

  • 1IBM中国商业价值研究院.智慧地球[M].北京:东方出版社,2009.
  • 2Fall K. A delay tolerant network architecture for challenged Internets [C] //Proc of SIGCOMM'03. New York: ACM, 2003: 27-34.
  • 3Vahdat, A, Becker D. Epidemic routing for partially connected ad hoc networks, CS-2000-06 [R]. Durham, NC: Department of Computer Science, Duke University, 2000.
  • 4Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait: An efficient routing scheme for intermittently connected mobile Networks [C] //Proc of SIGCOMM'05. New York: ACM, 2005:22-26.
  • 5Lindgren A, Doria A, Schelèn O. Probabilistic routing in intermittently connected networks [J], Mobile Computing and Communications Review, 2003, 7(3): 19-20.
  • 6Jain S, Fall K, Patra R. Routing in a delay tolerant network [C]//Proc of SIGCOMM'04. New York: ACM, 2004: 145- 158.
  • 7Blum J, Eskandarian A, Hoffman L J. Performance characteristics of inter-vehicle ad hoe networks [C] //Proc of the 6th IEEE Int Conf on Intelligent Transportation Systems. Piscataway, NJ: IEEE, 2003:114-119.
  • 8Chen Z D, Kung H T, Vlah D. Ad hoc relay wireless networks over moving vehicles on highways [C] //Proc of SIGMOBILE'01. New York: ACM, 2001:247-250.
  • 9Spyropoulos T, Turletti T, Obrazcka K. Utility-based message replication for intermittently connected heterogeneous wireless networks [C] //Proc of IEEE WoWMoM Workshop on AOC. Piscataway, NJ: IEEE, 2007, 1-6.
  • 10Mascolo C, Musolesi M. SCAR: Context aware adaptive routing in delay tolerant mobile sensor networks [C] //Proc of the Delay Tolerant Networks Syrup, ACM Int Conf on Wireless Communications and Mobile Computing (IWCMC'06). New York: ACM, 2006:533-538.

共引文献159

同被引文献9

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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