Smart Re-Route Routing Protocol for Vehicular Ad-Hoc Networks

This paper compares various routing algorithms for Vehicular Ad Hoc Networks(VANETs) based on its different parameters to evaluate which algorithms are weaker on some parameters than others and then an optimized routing protocol is proposed to significantly reduce packet transfer time and it can also be used for faster communication in real life scenario. The existing routing algorithms demand optimization for the purpose of Vehicular Ad-Hoc Networks as traffic congestion increase rate over powers the rate of infrastructure development and a millisecond error in traffic management network could lead to disastrous outcomes. This research work has been attempted to propose a routing protocol that uses the traffic density as a parameter and dynamically update the vehicle count which helps each vehicle act as a smart network node and in turn share information faster and with improved efficiency. Therefore, an improved “Smart Re-Route” algorithm is proposed to act as a catalyst when run alongside the existing algorithms. The main purpose of our algorithm is to identify any new entry of vehicles in the vicinity of others and in this way prevents accumulation of large number of requests at a single node. The corresponding results are compared and plotted.