본문 바로가기
KERD
논문KCI 등재

Multihop Vehicle-to-Infrastructure Routing Based on the Prediction of Valid Vertices for Vehicular Ad Hoc Networks

0

조회

0

다운로드

2

인용

0

참고문헌

키워드

초록

Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

Abstract

Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

참고문헌 (16)

  1. M.Conti, "Multihop Ad Hoc networking: the reality", IEEE communications Magazine, 45, pp.88~95 (2007)
  2. A.Skordylis, "Delay-bounded routing in vehicular Ad hoc networks", Proc.of MobiHoc 2008,, pp.341~350 (2008)
  3. J.Gong, "Predictive directional greedy routing in vehicular Ad Hoc networks", Proc.of 27th International Conference on Distributed Computing Systems (2007)
  4. C.Lochert, "Geographic routing in city scenarios", MobiCom Poster Abstract, ~ (2004)
  5. B.Karp, "Greedy perimeter stateless routing for wireless networks", Proc. of 6th Annual ACM, 2000, 243~254
  6. C.Lochert, "A routing strategy for vehicular Ad Hoc networks in city environments", Proc.of IEEE on Intelligent Vehicles Symposium, pp.156~161 (2003)
  7. B.Seet, "A-STAR:A mobile Ad Hoc routing strategy for metropolis vehicular communications", Lecture Notes in Computer Science, 3042, pp.989~999 (2004)
  8. J.Tian, "Spatially aware packet routing for mobile Ad Hoc inter vehicle radio networks", Proc.of IEEE on Intelligent Transportation systems, 2, pp.1546~1551 (2003)
  9. J.Zhao, "VADD:vehicle-assisted data delivery in vehicular Ad Hoc networks", Proc.of Int.Conf.on Computer Communications(INFOCOM) (2006)
  10. Epidemic routing for partially connected Ad Hoc networks, "A.Vahdat", Duke Univ, ~, pp.Technical Report, CS-200006 (2000)
  11. C.Perkin, "Ad Hoc on-demand distance vector(AODV)routing", IETF Experimental RFC, ~ (2003)
  12. "The Network Simulator-ns-2"[URL]
  13. R.K.Shrestha, "Vertex-Based multihop vehicle to infrastructure routing for vehicular Ad Hoc networks", Proc.of 43rd Hawaii Int.Conf.on System Sciences(HICSS-43) (2010)
  14. 이무열, "차량용 MOST 네트워크를 위한 POSIX 기반의 Network Service 설계 및 구현", 대한임베디드공학회논문지, 5(1), pp.23~28 (2010), 대한임베디드공학회
  15. 이도엽, "무선메쉬 네트워크에서 우회정보를 이용한 다중경로 DSDV 라우팅기법", 대한임베디드공학회논문지, 5(3), pp.157~167 (2010), 대한임베디드공학회

관련 논문AI추천

이 간행물의 다른 논문 (7건)