Position-based Routing Algorithm for Improving Reliability of Inter-Vehicle Communication

• Min-Woo Ryu,
• Si-Ho Cha,
• Jin-Gwang Koh,
• Seokjoong Kang,
• Kuk-Hyun Cho,

Vol. 5, No. 8, August 28, 2011
10.3837/tiis.2011.08.002, Download Paper (Free):

• VANET
• position-based routing
• greedy forwarding
• local maximum
• link breakage
• stale node

Abstract

A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

Statistics

Cite this article