A Vehicle Communication Routing Algorithm Considering Road Characteristics and 2-Hop Neighbors in Urban Areas 


Vol. 36,  No. 5, pp. 464-470, May  2011


PDF
  Abstract

V2V (Vehicle-to-Vehicle) is a special kind of VANET (Vehicular Ad-hoc Network), which has high mobility and frequent topology changes and causes the link breakage problem. To resolve this problem, geographic routing protocols such as greedy forwarding are proposed. However, the greedy forwarding approach selects the node closest to the destination node as the transfer node within the transmission range so that it may cause many problems owing to many intersections and many changes in vehicular traffic in urban areas. The paper proposes a greedy perimeter urban routing (GPUR) algorithm considering the presence of 2-hop neighbor nodes and the road characteristics. Simulation results using ns-2 reveal that the proposed GPUR algorithm significantly reduces the routing error problem and the probability of local maximum than the existing routing protocols.

  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]

M. Ryu, S. Cha, K. Cho, "A Vehicle Communication Routing Algorithm Considering Road Characteristics and 2-Hop Neighbors in Urban Areas," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 5, pp. 464-470, 2011. DOI: .

[ACM Style]

Min-Woo Ryu, Si-Ho Cha, and Kuk-Hyun Cho. 2011. A Vehicle Communication Routing Algorithm Considering Road Characteristics and 2-Hop Neighbors in Urban Areas. The Journal of Korean Institute of Communications and Information Sciences, 36, 5, (2011), 464-470. DOI: .

[KICS Style]

Min-Woo Ryu, Si-Ho Cha, Kuk-Hyun Cho, "A Vehicle Communication Routing Algorithm Considering Road Characteristics and 2-Hop Neighbors in Urban Areas," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 5, pp. 464-470, 5. 2011.