期刊文献+

基于预测的机会车载网络中继选择策略研究 被引量:10

Prediction Based Relay Selection Method in Opportunistic Vehicular Networks
下载PDF
导出
摘要 为了应对DTN网络的动态连通特性,现有路由策略常常利用"携带-转发"消息传输技术,通过推测未来相遇机会选择消息中继路径.但这种机会数据传输方式的效果具有偶然性.对中继选择策略的性能进行实证性研究,以获得关于中继效率不确定性特征的基本认识.首先,介绍一种基于剩余延迟比较的机会中继选择策略,该策略以移动节点对之间的历史联系记录和最近相遇以来的经历时间为基础,估计消息的直接转发剩余延迟,通过比较剩余延迟选择合适的中继节点;由于仅使用本地信息,该策略的运算和通信开销小,并且易于实现;其次,在基于大规模实际车辆移动轨迹的车载DTN环境中,对机会传输的中继效率进行经验性研究.主要关注的问题是:基于推测所选择的中继能够使得端到端传输延迟降低的概率是多少?恰当选择的中继节点可以降低的延迟比例是多少?这种实证性的研究对于未来机会车载网络中的协议设计和应用推广有着重要的实际价值. To accommodate the dynamic connectivity and networking condition in DTN, most existing routing schemes require inferring future contact opportunities to select message relays. However, such relay only has an incidental effect on helping opportunistic data delivery. In order to again a further understanding of the intrinsic uncertainty of relay efficiency, this paper engages in an empirical investigation on the relay selection schemes. Firstly, it introduces a more effective opportunistic relay selection strategy based on the estimation of residual message delay, which utilizes pairwise contact records and the elapsed time from last contact. Next, based on the underlying opportunistic vehicular network extracted from large-scale realistic vehicle traces collected from urban areas, it investigates the efficiency of relay selection with an empirical view. The questions this study focuses on are: What is the probability that a selected relay can make the end-to-and delay reduced? How much the latency can be saved by a properly selected relay? Such empirical study is signficant for the protocol design and application deployments in the future opportunities vehicular networks.
出处 《软件学报》 EI CSCD 北大核心 2015年第7期1730-1741,共12页 Journal of Software
基金 国家自然科学基金(61070211 61003304) 湖南省自然科学基金(09JJ4034)
关键词 机会车载网络 中继选择 剩余延迟期望 延迟降低比例 opportunistic vehicular network relay selection residual expected delay delay reduced ratio
  • 相关文献

参考文献19

  • 1Perkins CE, Royer EM. Ad hoc on-demand distance vector routing. In: Proc. of the 2nd IEEE Workshop on Mobile Computing Systems and Applications. New Orleans, 1999. 90-100. [doi: 10.1109/MCSA.1999.749281].
  • 2Johnson DB, Maltz DA. Dynamic source routing in ad-hoc wireless networks. In: Imielinski T, Korth H,eds. Proc. of the Mobile Computing. Kluwer Academic Publishers, 1996. 153-181. [doi: 10.1007/978-0-585-29603-6_5].
  • 3Pereira PR, Casaca A, Rodrigues JJPC, Soares VNGJ, Triay J, Cervello-Pastor C. From delay-tolerant networks to vehicular delay-tolerant networks. IEEE Communications Surveys & Tutorials, 2012,14(4): 1166-1182. [doi: 10.1109/SURV.2011.081611.00102].
  • 4Fall K. A delay-tolerant network architecture for challenged Internets. In: Proc. of the ACM SIGCOMM 2003. Karlsruhe, 2003. [doi: 10.1145/863955.863960].
  • 5Balasubramanian A, Levine BN, Venkataramani A. DTN routing as a resource allocation problem. In: Proc. of the ACM SIGCOMM 2007.2007. [doi: 10.1145/1282380.1282422].
  • 6Jain S, Fall K, Patra R. Routing in a delay tolerant network. In: Proc. of the ACM SIGCOMM 2004. 2004. [doi: 10.1145/1030194. 1015484].
  • 7Vahdat A, Becker D. Epidemic routing for partially-connected ad hoc networks. Technical Report, CS-200006, Duke University, 2000.
  • 8Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communication Review, 2003,7(3):19-20. [doi: 10.1145/961268.961272].
  • 9de Oliveira ECR, de Albuquerque CVN. NECTAR: A DTN routing protocol based on neighborhood contact history. In: Proc. of the ACM SAC 2009. Honolulu, 2009. [doi: 10.1145/1529282.1529290].
  • 10Yuan Q, Wu J. Predict and relay: An efficient routing in disruption-tolerant networks. In: Proc. of the ACM MobiHoc 2009. 2009. [doi: 10.1145/1530748.1530762].

同被引文献41

引证文献10

二级引证文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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