Vehicular Ad hoc Network Quality of Service Routing Algorithm

Abstract

V.A.N.E.T.s (Vehicular Ad hoc Networks) now offer a wide range of services, from security to entertainment. The quality of service (QoS) model dictates that such services must ensure consistency and availability. Finding feasible routes that meet several QoS requirements is typically an NP-hard problem. Furthermore, routing protocols' reliability must be prioritized due to the frequent failure of communication lines in V.A.N.E.T.s. We aim to build a S.A.M.Q by combining Situational Awareness (S.A.) with an Ant Colony System-based routing algorithm. Routing method from V.A.N.E.T.s in this study. S.A.M.Q.'s goal is to find the best possible route between two vehicles that meet several quality of service (QoS) restrictions and to select the most efficient route if one exists. S.A.M.Q. Uses the S.A. levels and A.C.S. mechanisms to design numerous countermeasures to ensure reliable data transfer to limit the risks involved with selecting the best-calculated route, which may fail at any time. This study shows that S.A.M.Q. can outperform conventional QoS routing algorithms even in dynamic network topologies.