There are numerous research challenges that need to be addressed until a wide deployment of vehicular ad hoc networks (VANETs) becomes possible. One of the critical issues consists of the design of scalable routing algorithms that are robust to frequent path disruptions caused by vehicles' mobility. This paper argues the use of information on vehicles' movement information (e.g., position, direction, speed, and digital mapping of roads) to predict a possible link-breakage event prior to its occurrence. Vehicles are grouped according to their velocity vectors. This kind of grouping ensures that vehicles, belonging to the same group, are more likely to establish stable single and multihop paths as they are moving together. Setting up routes that involve only vehicles from the same group guarantees a high level of stable communication in VANETs. The scheme presented in this paper also reduces the overall traffic in highly mobile VANET networks. The frequency of flood requests is reduced by elongating the link duration of the selected paths. To prevent broadcast storms that may be intrigued during path discovery operation, another scheme is also introduced. The basic concept behind the proposed scheme is to broadcast only specific and well-defined packets, referred to as "best packets"in this paper. The performance of the scheme is evaluated through computer simulations. Simulation results indicate the benefits of the proposed routing strategy in terms of increasing link duration, reducing the number of link-breakage events and increasing the end-to-end throughput.
ASJC Scopus subject areas
- Automotive Engineering
- Aerospace Engineering
- Electrical and Electronic Engineering
- Applied Mathematics