CV-AODV: Compatibility Based Vehicular Ad-hoc on Demand Distance Vector Routing Protocol

Reliable and trustworthy communication routes are essential in the intelligent transport system to enable future connected applications such as autonomous vehicular networks, traffic congestion control, accident prevention, etc. Recently there has been a serious focus on message routing protocols in vehicular ad-hoc networks (VANETs) from the research community. However, two important aspects of connection time and routing reliability are still lacking in existing methods. We innovate and propose compatibility based vehicular ad-hoc on-demand distance vector routing (CV-AODV) to improve reliable vehicular connectivity. In this work, we propose that each vehicle identifies routes with compatibility categorization and chooses the best route to ensure much-needed reliability. Simulation results on three distinct and realistic simulation of urban mobility (SUMO) traces have shown that the proposed scheme outperforms existing ad-hoc on-demand multipath distance vector (AOMDV) and ad-hoc on-demand multipath distance vector (AOTDV) protocols and achieve a significant packet delivery ratio. Moreover, we also evaluated in terms of the hops or connectivity time for each selected route and identified that the proposed solution considers longer connectivity of up to 200 s with only 3 to 4 hops. The proposed scheme has fewer but reliable multi-paths as compared to the existing AOMDV solution.