VANET1 is composed of RSU2 and vehicles distributing secure or insecure messages. VANETS allow finding independent moving vehicles in the road by distributing traffic information and road conditions. In this paper (ASTS3), a method has been proposed, and in this method, k-meansalgorithm is used for clustering vehicles, and Dijkstra’s Algorithm is used to find the shortest route. It can be performed in three main phases. The first phase is declaring road conditions in terms of weather phenomena and traffic restrictions. The second phase is tracing passing vehicle and data collection.The third phase is declaring sudden stopping of vehicles.
