# Novel Fuzzy Logic Scheme for Push-Based Critical Data Broadcast Mitigation in VNDN
## 5 Simulation Environment and Results  
The NS-3 and ndnSIM tools were used to implement the proposed scheme and analyze the performance. In addition to the traditional NDN structures, Simulation for Urban Mobility (SUMO) was employed to obtain the vehicle movements [31]. For a fair comparison, the simulations employed the same configuration, network configuration, Physical and MAC layer parameters, and mobility model. A total of 600 vehicles were considered moving at different speed rates. The length of the observed area was 300 m, and a three-lane road was considered. The remaining simulation settings are listed in Table 2.  
In addition, a random number of vehicles (producers) were dispersed evenly over the network, and each vehicle randomly generated a critical data packet during the experiment. Every vehicle exchanged its location with all its neighbors through a pilot message. Figure 6 shows the total number of critical data packets transmitted over each iteration with respect to the number of vehicles. We can observe that the naive scheme transmitted a massive number of critical data packets, while the proposed scheme transmitted a lower number of critical data packets. In the naive scheme, all the vehicles participate in broadcasting the critical data packets once it receives the data packets. As a result, every vehicle receives multiple copies of the same critical data packet. On the other hand, the proposed scheme allows only the CH to broadcast the critical data packet to all the vehicles in the cluster. Therefore, the proposed scheme transmits fewer data packets than the naive method. In Figure 7, we can observe that the total number of critical data packets are generated and transmitted over time. It is noteworthy that the number of data packets by vehicles (producers) increases with respect to time. After starting the simulation, only one vehicle generates a critical data packet and transmits it. When the time reaches the 10 th second, two vehicles generate critical data packets and transmit them, and the process continues. On the 100 th second, about 98,000 and 18,000 critical data packets are observed to have been generated and transmitted by the naive and proposed schemes, respectively. The difference gets larger as the vehicles producing critical data packets increase. After 200 s, the total generated and transmitted data packets by the naive and proposed schemes rise to almost 350,000 and 6500, respectively. Therefore, the total number of transmitted critical data packets is multiplied by the number of vehicles that produce the critical data packets. \begin{table}
\begin{tabular}{c c} \hline \hline
**Parameter** & **Value** \\ \hline Simulator & NS-3 and ndnSIM \\ \hline Mobility Model & SUMO \\ \hline Network Size & 1–50 vehicles \\ \hline Poisson Point Distribution (\(\lambda\)) & 20 \\ \hline Covered Area & 300 m \\ \hline Transmission Range (m) & 100 \\ \hline Vehicle Speed & 30–180 \(\mathrm{KM}/\mathrm{H}\) \\ \hline Transmission Mode & V2V (IEEE 802.11p) \\ \hline Alpha (\(\alpha\)) & 0.50 \\ \hline \hline \end{tabular}
\end{table} 
Table 2: Simulation parameters and values. The results show that the proposed scheme clearly transmitted fewer critical data packets than the naive method. Figure 6: Total number of generated critical data packets at every iteration (time in seconds). Figure 7: Total number of transmitted critical data packets with respect to the increasing number of vehicles (time in seconds). Figure 8 indicates the efficiency of the proposed and naive schemes. Efficiency is calculated by using Equation (10). We can observe that the efficiency of the proposed scheme is higher than the efficiency of the naive method. As the number of vehicles increases, the efficiency decreases. The straight line indicates that the number of vehicles remained almost the same due to the SUMO tool.