## 4 Prevention Mechanisms of the Proposed Scheme
### Probability Analysis of Vehicles Based on Elliptical Segment Area Transmission Range
To determine  
\[\text{Fitness value}=\mathbf{V_{i}^{k}} \tag{8}\]  
where \(\mathbf{V}\) is the vehicular node, \(\mathbf{k}\) is evolved the from initial point (\(\mathbf{k}=0\)) to the total gen iteration number, Cuckoo/CSA (ABC) has a powerful feature to generate new candidate vehicle or node solutions to be part of the network. Based upon that approach, a new candidate solution \(\mathbf{V_{i}^{k+1}}(i\in[1\ldots,N])\) is produced through disturbing the current \(\mathbf{V_{i}^{k}}\) with a position change \(p_{i}\). \(N\) is the number of vehicular nodes in the network. To obtain \(\mathbf{p_{i}}\), random step \(\mathbf{s_{i}}\) is generated through symmetric Levy distribution using an algorithm from a previous study [45]. \begin{table}
\begin{tabular}{c c} \hline
**CSA Population** & **Fitness Parameters Feedback** \\ \hline Total number of vehicular nodes in the coverage & Probability of new vehicles as part of the network, \(\mathbf{V_{i}^{k}}\) \\ elliptical segment region & fitness value \\ \hline \end{tabular}
\end{table} 
Table 2: Cuckoo/CSA (ABC) specification. Finally, the solution for a new vehicular node solution, \(\mathbf{V}_{i}^{k+1}\), is obtained using:  
\[\mathbf{V}_{i}^{k+1}=\mathbf{V}_{i}^{k}+\mathbf{p}_{i} \tag{9}\]  
Then, under replacement of nodes a set of individual new nodes that should be part of the network is probabilistically chosen and replaced with malicious or attacker nodes. Each \(\mathbf{V}_{i}^{k}\) (\(i\in[1\ldots,\mathbf{N}]\)) can be chosen with a probability \(\mathbf{P}_{\mathbf{a}}\in[0,1]\)  
The operation can be done with the following model:  
\[\mathbf{V}_{i}^{k+1}=\left\{ \begin{array}{c}\mathbf{V}_{i}^{k}+\text{rand.}\big{(} \mathbf{V}_{r_{1}}^{k}-\mathbf{V}_{r_{2}}^{k}\big{)}\text{ with probability }\ P_{\mathbf{a}},\\ \mathbf{V}_{i}^{k}\text{ with probability }\ (1-\mathbf{P}_{\mathbf{a}}),\end{array} \right. \tag{10}\]  
where rand is a random number normally distributed, and \(\mathbf{r}_{1}\) and \(\mathbf{r}_{2}\) are random integers from 1 to \(\mathbf{N}\). After producing \(\mathbf{V}_{i}^{k+1}\) it must be compared with its past value \(\mathbf{V}_{i}^{k}\). If the fitness value of \(\mathbf{V}_{i}^{k+1}\) is better than \(\mathbf{V}_{i}^{k}\), then \(\mathbf{V}_{i}^{k+1}\) is accepted as the final solution. Otherwise, \(\mathbf{V}_{i}^{k}\) is retained. The procedure can be done through the following statement:  
\[\mathbf{V}_{i}^{k+1}=\left\{ \begin{array}{c}\mathbf{V}_{i}^{k+1},\qquad\quad if\ \ f \big{(}\mathbf{V}_{i}^{k+1}\big{)}<f(\mathbf{V}_{i}^{k})\\ \mathbf{V}_{i}^{k}\quad,\qquad\qquad\qquad\qquad\qquad\text{otherwise.}\end{array} \right. \tag{11}\]  
This Cuckoo/CSA (ABC) selection with fitness value \(\mathbf{V}_{i}^{k+1}\), as shown in the Equation (11) strategy, demonstrates that only high quality vehicular nodes that utilize relays of high IEEE 802.11p signals (best solution near the optimal value) have the opportunity to interact with the RSU and the FS to deliver emergency feedback information, such as accidents and bad road conditions, to alert road users. After the selection of the legitimate nodes that are to be part of the network and after routes are discovered, assurance in trustworthiness of the nodes in the network must be maintained, as shown below.