# A Cross-Layer Approach MAC/NET with Updated-GA (MNUG-CLA)-Based Routing Protocol for VANET Network
## 1 Introduction  
Due to the rapid advancement in wireless communication technology and ever-growing traffic volumes, VANETs (Vehicular Ad hoc Networks) have attracted growing attention regarding the potential in intelligent transportation systems in the last few years [1]. The VANET allows automobiles to communicate with each other without the use of infrastructure, allowing people to drive securely. Along with its various forms of security and entertainment technologies, it has gained favor among scholars. It was still difficult to develop a routing system that can handle a high-mobility atmosphere. Data becomes obsolete as a consequence of elevated mobility and variable topologies, resulting in disconnectedness and packet dropping concerns across vehicle nodes. Various routing algorithms have solved these difficulties. Table-driven or topology-based forwarding and geographic-based forwarding are two distinct kinds of routing systems. The data are contained in routing updates for topology-based forwarding. Proactive and reactive routing are the two sorts of routing. Since destinations are determined before transmissions to be done, the proactive kind has a minimal latency. Due to the huge amount of route update queries, proactive routing protocols have a large overhead. Approaches, on the other hand, involve a significant delay, since routes must be identified whenever the base station makes the r_req message [2].  
Whenever there is information to transmit, approaches choose destinations. The Vehicle-to-Vehicle, Vehicle-to-Infrastructure, and Infrastructure-to-Infrastructure communications are shown in Figure 1. Geographical routing techniques only employ data from neighbor nodes that are within their broadcast range. Data transmission algorithms in these methods are based on node location data. In the beacon-based geographic routing algorithm, packets are being used to discover the location coordinates of neighbor nodes. Revised control packets provide the foundation of the beaconless geographical routing algorithm. Geographical routing systems rely on the Global Positioning System (GPS) to identify the precise location of a vehicle. Geographic routing techniques are thought to be more practical and efficient for variable architectures. GPRS gave birth to the concept of geographical type. The greedy and perimeter approaches are used by GPSR. Greedy mode will activate when information is supplied to the node that is nearest to the destination. Whenever the greedy method expires, the protocols fall back to perimeter mode. Once the source node is close to the destination and its neighbors are distant, multicast routing challenges arise. The procedure then shifts to perimeter mode, which employs the right-hand principle. The right-hand principle refers to the process by which all networks convey data to their neighbors clockwise whenever they transmit it anti-clockwise, face routing difficulties with the GPSR, and struggle to cope with irregular traffic patterns. The GPSR only takes distance metrics and does not consider direction metrics, which leads to wrong packet forwarding decisions and increased packet loss [3].  
The organization of the rest of the paper is as follows. Section 2 explains the survey about the geographic routing in VANETs and cross-layer approaches. Section 3 explains the background, challenges and motivation in VANETs. Section 4 proposes the MAC/NET with an updated genetic algorithm for VANETs. Section 5 presents the simulation results and discussion about the proposed model. At last, in Section 5, conclusions are given.