Multi Constraints Optimal Path based on Routing Protocols in VANETs

Abstract

Vehicular Ad-hoc network (VANETs) is a type of ad hoc network which has faced many challenges for its implementation such as Technical issues which include are Large Size area, Routing, Security, Congestion, High Mobility, Limited road topology, Intermitted connectivity, Continuous power transmission for significant computing communication & sensing of the network & On road issues include narrow road, unstructured road, all roads are not allowed for all vehicles, busy road, no defined speed on road, no road maintenance, high frequency of accidents, poor sign board, no road side amenities, multiple numbers of toll booths etc. In order to enhance the performance of the desired real time network link between the nodes must be stable and reliable so that information can be transmitted reliably to the desired destination. This paper has experimentally studied the optimal path for different routing protocols in VANETs. This paper clearly concludes which routing protocol is better under different parameters such as number of hops, average hop count, total packet send and received for the realistic environment.