# A Cross-Layer Approach MAC/NET with Updated-GA (MNUG-CLA)-Based Routing Protocol for VANET Network
## 2 Comprehensive Survey  
New studies have shown that the more efficient routing protocols for VANETs are those which take numerous variables into account while making routing decisions at the relay node. This study is focused on approaches that analyze neighbor nodes using numerous routing parameters and identify the best candidate node to route packets. As a result, we have highlighted some current intriguing suggestions in spatial routing algorithms. Greedy perimeter stateless routing (GPSR) [4] is one of the earliest geographic routing algorithms devised for VANETs and is often cited as a benchmark. Position-based methods are preferable to VANETs over topology-based methods, according to research, since geographic routing avoids the operational costs and latency of establishing a forwarding table but rather relies on the geographic position of nodes, which could be derived using a  
Figure 1: System Architecture of MNUG-CLA Approach. Global Positioning System (GPS) device on a vehicle. Still, there is a research gap present in efficiency improvement in GPS-based VANETs. The Anchor-based Street and Traffic Aware Routing (A-STAR) and Greedy Perimeter Stateless Routing (GPSR) protocols are tested on a normal city map in this research. VANET simulations on real-world map settings produce reliable data and are also valuable for designing and deploying VANETs in the real world. The real-world dynamic model is crucial because that reflects the efficiency of the protocols under consideration in the physical world. Analysis of performance is carried in terms of throughput, packet delivery ratio, packet loss and average delay. However, this model provides moderate results in most dynamic topology [5]. VANET needs constant wireless data transmission among vehicles in order for connectivity to be feasible, and a reliable routing protocol makes this possible. However, the movement of cars has an impact on wireless communication on a broad scale, and the network architecture becomes unstable, necessitating a robust routing protocol design. Researchers compared the traditional Cluster-Based Routing Protocol (CBRP) with an optimized method using the particle swarm optimization (PSO) method in this work. PSO has been used to fine-tune several of CBRP's variables and timing parameters, enhancing the protocol's effectiveness and precision. However, for VANETs, an effective model is essential, which concentrates both in optimal path selection and collision reduction, in order to improve the efficiency of the network [6]. In VANETs, establishing a stable path for distributing packets is difficult due to the speed of vehicles and frequent link interruptions. This research [7] proposes an artificial spider geographic routing in metropolitan VAENTS (ASGR) to address these issues. The methods provide good results in terms of overhead. However, efficiency is moderate when it is applied to the highly dynamic network. Geographic routing protocols, also known as position-based routing protocols, are much more suitable for fast changing and wireless connections, since they are centered on greedy routing. Unfortunately, in a metropolitan context, this type of protocol confronts a higher difficulty due to radio obstructions, such as towers, trees, and other barriers, that limit channel integrity and packet receiving rate. This work describes the available position-based routing mechanism in depth and introduces the Greedy Curve metric Routing Protocol (GCRP) [8], which uses the curved metric duration instead of the Euclidean distance to pick the next hop. The simulation results show better performance in terms of packet delivery ratio and throughput. However, from the point of view of efficiency, it is moderate. Whenever possible, the author uses unicast messages in this operation to save network resource consumption. By placing directional antennae in automobiles, we can limit the spread of information.