# Information Fusion in Autonomous Vehicle Using Artificial Neural Group Key Synchronization
## 4 Results and Discussions  
The performance analysis for information amalgamation trust structure is provided in this section. A diverging V2X system has been simulated using the NS-3 simulator, which includes a short-range transmission infrastructure amongst cars and RSUs as well as web guidelines amongst RSUs and the key sharing hub. The mean delay owing to the key sharing is computed for a region key sharing dispersal structure with distant prophecy accuracy ratios. This method demonstrates the benefits of adopting an area-based key previously-sharing scheme in this simulation. First, by lowering request quantities, the area-based key sharing system can minimize the average delay. The average delay can be reduced with a high accuracy prediction ratio. There are two types of key update processes matching two distinct trust levels in the present assessment for conventional key sharing system [9]. The two kinds of key update procedures are identified in Figure 12 as AT inquiries having tier 1 trust and AT inquiries having tier 2 trust. AT inquiries having tier 1 trust are unprotected, and RSUs are supposed to merely transmit anything from the vehicles or the key sharing servers. On cars and RSUs that confirmed the source of data in AT requests having tier 2 reliability, the request/response are all tested as well as evaluated. When the cars reach an unexpected area, as mentioned in Section 3, this approach leverages current key sharing techniques as backup options. In this part, this method will use the area-based key sharing technique to predict the average delay of key sharing, with the current key sharing technique as a backup. \(Time_{Veli}\), \(Time_{RSU}\), \(Time_{Key\_Center}\), and \(Time_{Network}\) are the four elements of the overall key sharing delay for the one-time key update, as shown in Figure 12.  
Figure 12: Current PKI solutions with two distinct degrees of confidence. \(Time_{V\!V\!V\!I}\) refers to the time it takes for the vehicle to generate the request message, sign it, get the response from the key distribution server, and verify the response. \(Time_{RSU}\) is the time it takes for the RSU ends to validate the key update request, forward it, get the response message from the key distribution server, and sign it. The delay on the key distribution server is therefore included in \(Time_{Key\ Center}\), which is simplified as verify and response. \(Time_{Netork}\) delay on a heterogeneous network comprises delay on the DSRC network between cars and RSUs, delay on the Internet between RSUs and key distribution servers, and random delay congestion on the link between RSUs and key distribution centers. \(Time_{V\!V\!I}\) refers (Equation (8)) to the time it takes for the vehicle to produce the request information (\(Time_{Gena}\)), sign the request information (\(Time_{\!\!V\!I}\)), get the reply from the key sharing server (\(Time_{\!\!Get\ New\ AT}\)), and check the reply (\(Time_{\!\!V\!I}\)). \[ \begin{array}{l}Time_{V\!V\!I}\ =\ Time_{Gena}\ +\ Time_{Sign\ Vehi}\\ +\ Time_{\!\!Get\ New\ AT}\ +\ Time_{\!\!V\!I}\,y_{V\!V\!I}\end{array}  \tag{8}\]  
\(Time_{RSU}\) is (Equation (9)) the delay for the RSU endpoints to check the key update request (\(Time_{\!\!V\!I}\)), send it (\(Time_{\!\!F\!I}\)), receive the reply information from the key sharing server (\(Time_{\!\!K\!C\!V}\)), and sign it (\(Time_{\!\!Sing\ R}\)). \[Time_{RSU}\ =\ Time_{\!\!V\!I}\,{\it R}\ +\ Time_{\!\!F\!I}\ +\ Time_{\!\!K\!C\!V}\ +\ Time_{Sign\ R} \tag{9}\]  
The delay on the key sharing server is then taken into account by \(Time_{\!\!K\!C\!V\!C\! Another significant point to note is that the [9] study did not account for speeding up the safety procedures such as information signing and verification on both cars and RSUs. The average time spent signing and validating on a vehicle (\(Time_{Sign\ Vehi}+Time_{Vfg\ Vehi}\) in Equation (8)) is 50 ms, whereas the average time spent signing and confirming on RSUs (\(Time_{Sign\ R}+Time_{Vfg\ R}\) in Equation (9)) is 200 ms, as per the findings presented in [9].