Optimal routing in VANET using improved meta‐heuristic approach: a variant of Jaya

Abstract

VANETs are so-called vehicular ad hoc networks, they enable cost-effective, scalable solutions, and hence, they can be applicable in entertainment and transportation platforms with the assistance of multi-hop wireless communications from vehicle-to-vehicle. Conversely, in VANET circumstance, the multi-hop communication development is still a challenging one because of the quick change in topology and regular disconnection of a network. This directs to inefficiency or routing failure in existing mobile ad hoc routing protocols. To resolve routing issues, the number of research studies is going on to attain the multi-constrained Quality of Service (QoS) metrics in VANET. This study intends to propose a cost model as the solution for vehicle routing problem by considering the network quality metrics, including congestion, travel, collision, and QoS awareness cost. Fuzzification of the QoS factor is also included in this entire routing cost. Further, the primary objective of this work focuses on the minimisation of the routing cost model by finding the optimal route. To find an optimal route, this study introduces a new algorithm, namely Mean Computing Jaya Algorithm. At last, the performance of the proposed model is compared with existing work in the literature in terms of cost analysis and convergence analysis, and proves the betterment of the proposed model with reduced routing cost.