## 3 Proposed Method
### Hybrid Protocol-Based Path Selection
This segmentation and timing strategy helps manage the selection of forwarding nodes in a way that minimizes interference and minimizes message propagation in the complex urban communication environment described. One-hop delay in multi-direction. One-hop delay is made up of many elements, such as the time needed to send an EM, the time needed for the iteration process, and the contention time needed to transmit a \(\mu\)R. The time to transmit an EM is calculated as \(Mini\_WC/2+T_{E}\), and the time is as \(T_{s}+(4n+2)\tau\). The contention process requires the candidate to select a mini-slot to send EM packets through the contention window (CW) by sending nodes along the current path. The candidate's chance of applying to the selected mini-hole is \"\(p\)\" = \(1/CW\). If there is no conflict among candidates at two intersections, we can use a two-way broadcast to calculate the conflict time. We replace the \"R\" span in the current path. The length of the intersection in two directions is expressed as \(c_{r}\) and can be calculated as \(c_{r}=\sqrt{R^{2}+r^{2}}\); where \"r\" denotes the distance between the center and the intersection. In the final analysis, potential forwarding nodes on the present path select mini-slots for EM transmission with a probability \"p\". During contention, a bi-directional broadcast-like approach is utilized to calculate the contention time and one-hop delay on the present route when candidate nodes on adjacent roads are not in contention. Considering the distance \"r\" between the source node and the junction point, the covered length of the crossing road is \(c_{r}\). Divide the length \(c_{r}\) into n segments, one for each direction of the intersecting road, such that the segments constitute the state space of the final \(f_{a}\). The state may be represented by the set, as follows:  
\[\text{SP}=\{SP_{0},\ SP_{1},\ldots,SP_{n-1}\} \tag{6}\]  
The length of the \(\mathcal{I}\) is denoted as follows:  
\[SP_{\mathcal{I}}=(1-\beta)^{j}\beta^{(n-j)}c_{r},\ \ \ \ \exists\ j\ \epsilon\ [0,n] \tag{7}\]  
In segment \(SP_{\mathcal{I}}\), \(Y_{i}\) represents the number of candidates forwarding nodes. For probability, \(P_{t}(Y_{i}=k)\). Our technique yields the one-hop delay on the intersecting route, indicated as \(B_{H-D}^{M-i}\). The average one-hop latency in multi-hop is calculated by using the mean of \(B_{H-D}^{M}=(B_{H-D}^{M-c}+B_{H-D}^{M-i})/2\). Message propagation speed: The speed at which the EM spreads is measured by the distance traveled per second. This speed can be calculated by dividing the distance from destination to destination (\(f_{a}\)) by the single hop delay. Finally, \(f_{a}\) is expressed as \(I_{i}(0<i\leq n-1)\), which means that there are no cars in the region \(I_{0}\), \(I_{1},\ldots I_{i-1}\). The probability of occurrence can be expressed as the product of the probability of each region. Therefore, the average one-hop propagation distance in the broadcast denotes \"\(a\)\", as follows:  
\[\overline{a}=\Big{(}\prod_{j=0}^{i-1}h_{r}\big{(}x_{j}=0\big{)}h_{r}(x_{i}=0 \big{)}\Big{)}. \tag{8}\]  
Figure 3: Improved firefly optimization framework.