Improved routing in VANET networks

Given the number of vehicles on the streets and highways around the world, new challenges and opportunities arise in the face of the development of cities and communities .AODV is a routing protocol that creates a path between the source node and the destination node only on demand. In this research, two methods for routing are presented that somewhat improve the mentioned problems. The first proposed method is a clustering method that has been proposed to reduce the number of control messages. The second proposed method has been proposed to solve the rout selection problem which we have solved using Bayesian algorithm. The criteria used to evaluate the performance of these methods are increasing the package delivery rate and decreasing the package loss rate and the average end-to-end delay.

Keywords:

vehicular ad hoc network , Bayesian algorithm , AODV protocol , increase of package delivery rate , reduce of package loss rate , average end-to-end delay.