VMRCD: an algorithm for dependable routing using the re-clustering for vehicular networks with v2v communication

Vehicle traffic congestion control has an essential role in time management and with a case study on clustering-based VANET networks, an algorithm for dependable routing using the re-clustering for vehicular networks with v2v communication has been proposed.The aggregation of vehicles has a direct role in controlling traffic congestion, By observation the index parameters, we obtain the objective function, that merging parameter such as weight and distance, it optimizes the route length compared to previous methods, And by re-clustering, we decreased the number of vehicle collisions using the neighborhood principle. In this case, by considering the Euclidean distance, we can prevent the aggregation of vehicles using the minimum distance to create an optimal route. With the help of the objective function, we will achieve a dependable route to optimize packet delivery and the delay END-TO-END.Ultimately, using the proposed an algorithm, By categorization the inputs and real execution time, we increase the dependable routing compared to the SCRS algorithm, and we also decreased fuel consumption