# A Cross-Layer Approach MAC/NET with Updated-GA (MNUG-CLA)-Based Routing Protocol for VANET Network
## 4 MAC/NET with Updated Genetic Algorithm--A Cross-Layer Approach (MNUG-CLA)
### Network Layer Model--Neighbor Discovery Process  
HELLO messages are generated and processed using the neighbor discovery mechanism, as shown in Figure 2. The structure of every generate HELLO message is shown in Table 1. It has a unique sequence number, which is a marker that identifies and inserts the data formally. The packet also contains the sender's identity, as well as other appropriate data for calculating routing parameters, namely the sender's location, acceleration, and direction. A neighbor message is included for each of the sender's neighbors. The neighbor's ip and d_meg are included in every field. The quantity of HELLO packets successfully received by the sender from each of its neighbors is represented by the quantity of d_meg. This value is used to calculate the ETX metric, which is used to assess network throughput. The message format and packet size of the neighbor discovery process with its packet size is described in Table 2.  
Using swapped HELLO packets, the neighbors' table at every vehicle, Vn, is supplied with some of the most current neighbors' data. Table 3 shows the structure of a neighbor entry, which comprises the neighbor's location, position, speed, and direction. It also contains d_forward and d_reverse, which are required for the determination of the E_trans metric, as well as additional data for the L transmitter computation. The link bandwidth and noise calculation module find the normalized link capacity of a neighbor when a packet arrives from that neighbor, and the neighbor's table is modified correspondingly. Furthermore, the neighbors' list stores the delay ratio and signal-to-noise ratio (SNR), which are used to compute the practical disturbance ratio measure. The cross-layer routing \begin{table}
\begin{tabular}{c c c c c c} \hline \hline
**Author/Year** & **Concept** & **Energy** & **Consumption** & **PDR** & **Overhead** \\ \hline [PERSON]/2019 & Multi-metric Routing & Moderate & Normal & Better & Moderate \\ \hline [PERSON]/2017 & A-STAR, GPRS & Low & High & Low & High \\ \hline [PERSON]/2020 & CBRP & Better & low & Better & Moderate \\ \hline [PERSON]/2018 & ASGR & Normal & Normal & Normal & Normal \\ \hline [PERSON]/2018 & GCRP & Low & High & Low & High \\ \hline [PERSON]/2019 & NDN-VANETs & Better & low & Better & Low \\ \hline [PERSON]/2019 & PASRP & Normal & Normal & Normal & Normal \\ \hline [PERSON]/2019 & QTAR, QGGF & Moderate & High & Normal & Moderate \\ \hline [PERSON]/2019 & K-MEANS & Moderate & High & Low & High \\ \hline [PERSON]/2020 & LUA-GPRS & Moderate & Normal & Better & Low \\ \hline [PERSON]/2021 & Optimal Path Finding & Better & Normal & Moderate & Moderate \\ \hline [PERSON]/2020 & SDN-VANETs & Moderate & High & Moderate & Moderate \\ \hline [PERSON]/2021 & Mobility Management & Better & Low & High & High \\ \hline [PERSON]/2021 & TPDA-IoV & Better & Low & High & High \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Performance Analysis of Earlier Methods. \begin{table}
\begin{tabular}{c c} \hline \hline
**Data Field** & **Size** \\ \hline Sequence number for HELLO packets & 15 bits \\ Address of the sender & 31 bits \\ Position of sender & 127 bits \\ Velocity of sender & 127 bits \\ Header size of the sender & 7 bits \\ Messages from neighbors & 45 bits for every neighbor \\ \hline \hline \end{tabular}
\end{table} 
Table 2: Message format for MAC-based Neighbor Discovery Process. algorithm module consults the data contained in the neighbors' list to choose the best applicant router amongst some of the neighbors. Initially, all the vehicles in the network produce the HELLO packets, Gn, with the pre-assumed time \(\mu\). To enhance the possible illustrations and reduce the traffic in the network, a possible amount of jitter can be added with HELLO interval packets, namely (\(\mu\)+ jitter). All these HELLO packets will be processed in every Gn node, as indicated in Algorithm 1. Assume that a HELLO packet is received by the neighbor for the very first time. This may result in updating the neighbor table. Otherwise, there are no changes in it.