Shortest Path Algorithm for Distributed VANET using Grid Computing

In this technology advancement, Vehicular Ad Hoc Networks (VANETs) leverages a smart communication framework for vehicles, for example, video conferences and document sharing. These applications communicate within the distributed group of vehicles, the current telecom and unicasting-based methodologies are designed for initiating various safety applications for sharing the information and data transmissions, separately by using the shortest path algorithm for moving vehicles. We have proposed the Shortest Path algorithm and Minimum Spanning Tree (MST) calculations for multicasting to achieve the appropriate goal and reduce the time variation between source and destination. This algorithm reduces the travelling cost and chooses the appropriate path from initial node to the destination. By using this algorithm various types of vehicles can communicate with each other. In this paper, we are using the shortest path algorithm initiated by grid computing. Using the Dijkstra's algorithm, we can easily choose the appropriate nearest path of VANET and dynamically we have also used reactive routing protocol. This helps to choose the nearest vehicle of grid computing every time. Our motto of this project is to develop a safe transportation with a reduced time and minimal cost.