Routing Algorithm of VANET for an Efficient Path Management in Urban Intersections 


Vol. 38,  No. 12, pp. 1054-1060, Dec.  2013


PDF
  Abstract

This paper proposes a vehicle ad-hoc network (VANET) routing algorithm to reduce the probability of routing path discontinuity in urban intersections. In urban intersections, the vehicles may frequently change their moving directions. It can cause the disconnection of routing path and the increase of a packet transmission delay. In order to resolve this problem, the proposed routing algorithm exploits the information of moving directions in urban intersections. In this way, the proposed algorithm can reduce the probability of the local maximum which causes the increase of the number of routing hops and packet transmission delay. Simulation results show that the proposed algorithm can reduce the local maximum probability by 10% and increase the successful packet transmission ratio by 5% compared to the conventional VANET routing algorithms.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Cho and S. Kim, "Routing Algorithm of VANET for an Efficient Path Management in Urban Intersections," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 12, pp. 1054-1060, 2013. DOI: .

[ACM Style]

Sunghyun Cho and Seokwoo Kim. 2013. Routing Algorithm of VANET for an Efficient Path Management in Urban Intersections. The Journal of Korean Institute of Communications and Information Sciences, 38, 12, (2013), 1054-1060. DOI: .

[KICS Style]

Sunghyun Cho and Seokwoo Kim, "Routing Algorithm of VANET for an Efficient Path Management in Urban Intersections," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 12, pp. 1054-1060, 12. 2013.