CPAODV: Classifying and Assigning 3 Level Preference to the Nodes in VANET Using AODV Based CBAODV Algorithm

TLDR: This proposed CPAODV method performs better when compared to traditional AODV and CBAODV algorithm when there are shortest path and link lifetime between the nodes in VANET.

Abstract: Vehicles communicate with nearby vehicles to share high routing and traffic information in Vehicular Ad hoc Networks (VANETs) environment. Congestion and Delay in the transmission may occur due to the density of the nodes in the network. Traffic condition depends on the vehicles in Rural and Urban environment. Increase or Decrease in vehicle’s speed makes significant network changes when compared to the MANET environment. Road Side Terminals (RSTs) plays a major role in bridging the connection between the sender and the receiver nodes. The traditional AODV algorithm performs better when there are shortest path and link lifetime between the nodes in VANET. Giving 3 Level Preference to the nodes as High Preference (HP), Average Preference (AP) and Less Preference (LP) gives chances to nodes that have High Preference when compared to Less Preference. CPAODV model is proposed by implementing Classifying and giving preference to the RREQ to mitigate latency to the nodes. RST sends RREQ wisely based on the early model of Route Discovery stage itself. NS2 Simulator is used to analyze the strength of the proposed algorithm using QoS metrics like Throughput, Packet Delivery Ratio and End to End delay. This proposed CPAODV method performs better when compared to traditional AODV and CBAODV algorithm.