Route Planning in VANET By Comparitive Study of Algoriths

Provided by: International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
Topic: Networking
Format: PDF
Route planning techniques is one of the main tasks of VRP (Vehicles Route Planning) which aims to find an optimal route from a starting point to a destination. Various techniques have been proposed so far to calculate shortest path in VANET by different researchers. This paper presents a study about the two well-known shortest path searching algorithms, which are used in routing. They are Bellman-Ford algorithm and Dijkstra algorithm. They were compared on the basis of their run time.

Find By Topic