## 5 Simulation Results and Analysis
### Performance Comparisons under Different Parameters  
To verify the effectiveness of the algorithm in this paper, we compared the proposed algorithm with the following three algorithms. (1) meta-DRL [22]: in this scheme, using DQN to solve the problem of spectrum resource allocation, and applying deep deterministic policy gradient (DDPG) to solve the problem of continuous power allocation. (2) Brute-Force method: the action (including channel and power) is searched exhaustively to maximize the rate of V2V links. (3) Random method: the channel and power are randomly selected. Since we used the interference power measurement to design a partial CSI resource allocation mechanism, to prove the performance advantage of partial CSI, we compared it with complete CSI. Figure 3 shows the changes in the V2V link's successful transmission probability, V2I links throughput as the payload changes. Figure 3a reflects that as the payload size increases, the probability of successful transmission of the V2V links of all schemes decreases, including brute-force. This is because more information needs to be transmitted within the same delay constraint, so performance will decrease. However, it is found that the method in this paper is very close to brute-force and far superior to the random scheme. Since [22] considers the power control of the V2V links, the successful transmission probability of the \begin{table}
\begin{tabular}{c c} \hline \hline
**Parameters** & **Values** \\ \hline Carrier frequency & 2 GHz \\ Subcarrier bandwidth & 1 MHz \\ BS antenna height & 25 m \\ BS antenna gain & 8 dBi \\ BS receive noise figure & 5 dB \\ Vehicle antenna height & 1.5 m \\ Vehicle antenna gain & 3 dBi \\ Vehicle receive noise figure & 9 dB \\ Transmit power of V2I & 35 dBm \\ Transmit power of V2V & 23 dBm \\ Number of V2I links & 4 \\ Number of V2V pairs & 4 \\ \([\lambda_{c},\lambda_{v}]\) & [0.1, 0.9] \\ Noise power & \(-114\) dBm \\ Vehicle speed & 50 km/h \\ Latency constraint of V2V links & 100 ms \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Simulation parameters. \begin{table}
\begin{tabular}{c c c} \hline \hline
**Parameters** & **V2I Link** & **V2V Link** \\ \hline Path loss model & 128.1 + 37.6\(\text{log}_{10}(d)\), \(d\) in km & WINNER + B1 \\ Shadowing distribution & Log-normal & Log-normal \\ Shadowing standard deviation & 8 dB & 3 dB \\ Decorrelation distance & 50 m & 10 m \\ Fast fading & Rayleigh fading & Rayleigh fading \\ \hline \hline \end{tabular}
\end{table} 
Table 2: Channel models. V2V links is slightly higher than the scheme proposed in this paper. Furthermore, as can be seen from Figure 3a,b, the partial CSI proposed in this paper has comparable performance to complete CSI in meeting the V2V links delay. Figure 3b reflects that as the payload increases, the total throughput of the V2I link gradually decreases. This is because when the V2V payload increases, in order to obtain higher rewards, the BS will select actions to increase the V2V rate to meet the delay constraint, which will increase the interference of the V2I links and cause its rate to decrease. However, it can be seen that the throughput of the V2I links obtained by the proposed scheme is still higher than that of the random scheme and has comparable performance to the complete CSI scheme. Furthermore, the proposed scheme outperforms the literature [22] in terms of V2I throughput. In summary, the scheme proposed in this paper is close to brute-force in terms of the V2V links' successful transmission probability and the throughput of the V2I links, which is better than the random scheme and has comparable performance to complete CSI. Figure 4 shows the change in the probability of successful transmission of the V2V links as the vehicle speed increases. It can be seen from the figure that the probability  
Figure 3: Performance comparisons with different payload sizes. (**a**) V2V payload transmission success probability with varying payload sizes. (**b**) Sum capacity performance of V2I links with varying payload sizes.