Ad-hoc on demand distance vector routing protocol using Dijkastra's algorithm (AODV-D) for high throughput in VANET (Vehicular Ad-hoc Network)

Abstract

Past few decades have proved that the number of vehicles are increasing on road so we need some extra improvisation for our traffic safety need. The rise in vehicles count has led to a requirement for communication between vehicles. The emerging Vehicular ad hoc network (VANET) is a new class of wireless network, which offer intelligent transportation for the people on vehicle. Due to dynamic nature of traffic environment and very high mobility of vehicles, VANETs suffer link breakage problem. So in order to offer stable routes and establish good throughput in VANET, appropriate routing must be required. Many routing protocol are already available for efficient communication in Mobile ad hoc network (MANET) and one of those most important and efficient is Ad hoc on demand Distance Vector Routing (AODV) and it can be further used for communication and routing purpose in VANET environment. Due to different mobility and characteristic of MANET and VANET, AODV protocol does not perform well when we use existing AODV of MANET directly in VANET environment. So this paper presents optimization in route selection and route maintenance to get better stability of route and decrease overhead. Protocol proposed in this paper get improvement over previously proposed AODV protocol in terms of throughput, broken links.