期刊文献+

Utilizing the dropped packets for data delivery in VANETs

Utilizing the dropped packets for data delivery in VANETs
原文传递
导出
摘要 Timely and cost-efficient multi-hop data delivery among vehicles is essential for vehicular ad-hoc networks (VANETs), and various routing protocols are envisioned for infrastructure-less vehicle-to-vehicle (V2V) communications. Generally, when a packet (or a duplicate) is delivered out of the routing path, it will be dropped. However, we observe that these packets (or duplicates) may also be delivered much faster than the packets delivered along the original routing path. In this paper, we propose a novel tree based routing scheme (TBRS) for ultilizing the dropped packets in VANETs. In TBRS, the packet is delivered along a routing tree with the destination as its root. And when the packet is delivered out its routing tree, it won't be dropt immediately and will be delivered for a while if it can arrive at another branch of the tree. We conduct the extensive simulations to evaluate the performance of TBRS based on the road map of a real city collected from Google Earth. The simulation results show that TBRS can outperform the existing protocols, especially when the network resources are limited. Timely and cost-efficient multi-hop data delivery among vehicles is essential for vehicular ad-hoc networks (VANETs), and various routing protocols are envisioned for infrastructure-less vehicle-to-vehicle (V2V) communications. Generally, when a packet (or a duplicate) is delivered out of the routing path, it will be dropped. However, we observe that these packets (or duplicates) may also be delivered much faster than the packets delivered along the original routing path. In this paper, we propose a novel tree based routing scheme (TBRS) for ultilizing the dropped packets in VANETs. In TBRS, the packet is delivered along a routing tree with the destination as its root. And when the packet is delivered out its routing tree, it won't be dropt immediately and will be delivered for a while if it can arrive at another branch of the tree. We conduct the extensive simulations to evaluate the performance of TBRS based on the road map of a real city collected from Google Earth. The simulation results show that TBRS can outperform the existing protocols, especially when the network resources are limited.
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2013年第3期48-52,共5页 中国邮电高校学报(英文版)
基金 supported by the National Natural Science Foundation of China (60903158, 61003229, 61170256, 61173172, 61103227) the Fundamental Research Funds for the Central Universities (ZYGX2010J074)
关键词 ROUTING VANET opportunistic forwarding routing, vanet, opportunistic forwarding
  • 相关文献

参考文献10

  • 1Zhao J, Cao G. V ADD: vehicle-assisted data delivery in vehicular. ad hoc networks. Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications (INFOCOM'06), Apr 23-29, 2006, Barcelona, Spain. Piscataway, NJ, USA: IEEE, 2006: 12p.
  • 2Lee K, Le M, Haerri J, et al. LOUVRE: landmark overlays for urban vehicular routing environments. Proceedings of the 68th Vehicular Technology Conference (VTC-Fall'08), Sep 21-24,2008, Calgary, Canada. Piscataway, NJ, USA: IEEE, 2008: 5p.
  • 3Ding Y, Wang C, Xiao L. A static-node assisted adaptive routing protocol in vehicular networks. Proceedings ofthe 4th ACM International Workshop on Vehicular Ad hoc Networks (V ANET'07), Sep 10, 2007, Montreal, Canada. New York, NY, USA: ACM, 2007: 59-68.
  • 4Perkins C E, Royer E M. Ad hoc on-demand distance vector routing. Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'99), Feb 25-26,1999, New Orleans, LA, USA. Los Alamitos, CA, USA: IEEE Computer Society, 1999: 90-100.
  • 5Johnson D, Maltz D. Dynamic source routing in ad hoc wireless networks. Mobile Computing, 1996,353: 153-181.
  • 6Naumov V, Gross T R. Connectivity-aware routing (CAR) in vehicular ad doc networks. Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications (INFOCOM'07), May 6-12, 2007, Anchorage, AK, USA. Piscataway, NJ, USA: IEEE, 2007: 1919-1927.
  • 7Wisitpongphan N, Bai F, Mudalige P, et al. On the routing problem in disconnected vehicular ad hoc networks. Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications (INFOCOM'07), May 6-12, 2007, Anchorage, AK, USA. Piscataway, NJ, USA: IEEE, 2007: 2291-2295.
  • 8Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks. Tech Report. CS-2000-06. Durham NC, USA: Duke University, 2000.
  • 9Wischoff L, Ebner A, Rohling H, et al. sons: a self organizing traffic information system. Proceedings of the 57th Vehicular Technology Conference (VTC-Spring'03): Vol 4, Apr 22-25, 2003, Jeju Island, Republic of Korea. Piscataway, NJ, USA: IEEE, 2003: 2442-2446.
  • 10Karp B, Kung H T. GPSR: greedy perimeter stateless routing for wireless networks. Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM'OO), Aug 6-11, 2000, Boston, MA, USA. New York, NY, USA: ACM, 2000: 243-254.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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