Reliable and Stable Routing in VANET Using Multi-Objective Function Aided K-Means Clustering with Heuristic Algorithm

The expansion of Vehicular Ad-hoc Networks (VANET) has brought a heightened focus on service delivery within the realm of the smart transit systems. Nevertheless, the mobility attributes inherent to vehicular networks often result in frequent route disruptions, particularly when transmitting data. This circumstance holds true in both advanced and emerging nations, where substantial time is wasted due to congested traffic conditions. These consequences are substantial, encompassing heightened stress levels for drivers, reduced efficiency for diverse personal and commercial vehicles, and escalated emissions of harmful gases, especially those that contribute to air pollution, affecting the well-being of residents in densely populated regions. Clustering stands as a formidable approach for establishing a stable topological arrangement. Therefore, an efficient reliable routing scheme is developed in VANET with the help of a clustering algorithm. The node clustering is initially performed with the help of the K-means Clustering algorithm (KMC) in VANET. An Advanced Pelican Optimization Algorithm (APOA) is utilized for choosing a shorter and more stable route between all available routes to make efficient routing in VANET. The multi-objective functions like delay, hop count, energy, and the ratio of packet delivery are considered for the efficient routing in VANET to make energy-efficient transmission. The effectiveness of the proposed KMC-based optimal routing in VANET is validated with the conventional routing schemes in accordance with some of the metrics to determine efficacy.