A Road Condition-based Routing and Greedy Data Forwarding Algorithm for VANETs
Hyunhee Park, Seunghyun Park, Jai-Jin Jung and Eui-Jik Kim
A vehicular ad-hoc network (VANET) is an ad-hoc mobile network that provides communications among nearby vehicles and between vehicles and fixed equipment. These types of networks have many applications, including assisting drivers with signage, providing warnings on dangerous roads, and indicating the desired route. However, these applications require a high packet delivery ratio and a low end-to-end delay, and since VANETs have a highly dynamic topology with varying vehicle density, the development of a routing protocol to satisfy the above requirements is still a significant challenge. In this paper, we propose a road condition-based routing and greedy data forwarding (RRGF) algorithm with which the optimal path to transmit data packets is calculated according to the distance and density factor in the 1st step. By using the information on the optimal path, a greedy data-forwarding algorithm can be deployed in the 2nd step for each road segment based on reaching the crossroad time (RCT) and the turning direction probability (TDP). Extensive simulations show that the density-aware and road-aware algorithms outperform a traditional shortest path selection algorithm when the mobility and the number of connections increase.
Keywords: Density-aware algorithm; greedy data forwarding; optimal path; road-aware algorithm; VANET