# Distributed Resources Allocation Method for Space-Ground Integrated Mobile Communication System
## 6 Numerical Results
### Network Access Ratio Performance  
As we mentioned in the previous chapters, we introduced the concept of simulation time in the design of the system simulation model, which is the generation of random numbers for the user request issue time. In other words, when the simulation duration is determined, changing the number of access users is equivalent to changing the user access request per unit time, that is, the number of user access densities in the time domain. In order to better show the difference between decision-making methods, we selected four groups of data samples as comparative experiments towards the proposed method. Also, we set different SFs of the penalty function during the simulation, considering the existence of multiple parameters that may have different impacts on the system. Because there are not many combinations of SFs, they can be easily found by periodic grid search in practical systems. Here, we chose four typical sets of SFs for presentation summarized in Table 4. \begin{table}
\begin{tabular}{c c c} \hline \hline
**Parameter** & **Description** & **Value** \\ \hline \(\mathbf{M}\) & Total MS amount. & 3000 \\ \(\mathbf{M}_{U}\) & Total MS uplink request amount. & 1500 \\ \(\mathbf{M}_{D}\) & Total MS downlink request amount. & 1500 \\ \(\mathbf{R}_{n}\) & Total link type amount. & 3 \\ \(\mathbf{T}_{n}\) & Total service type amount. & 3 \\ \(\mathbf{S}_{m}\) & Minimum data rate of one RB. & 3 MBps \\ \(\mathbf{RB}_{m}\) & Maximum RB amount of one slice. & 1600 \\ \(\mathbf{U}_{m}\) & Maximum data amount of one request. & 2 GBps \\ \(\lambda_{1}\) & SF of MS resources request. & alterable \\ \(\lambda_{2}\) & SF of MS transmitting power. & alterable \\ \(\lambda_{3}\) & SF of MS distance to base station. & alterable \\ \(\lambda_{4}\) & SF of MS distance to UAV devices. & alterable \\ \(\lambda_{poission}\) & Minimum data rate of one RB. & alterable \\ \(\mathbf{SM}_{T}\) & Total simulation span. & 1 hour \\ \hline \hline \end{tabular}
\end{table} 
Table 3: Summary of simulation parameter settings. As shown in Figure 8, the method without any advanced resource allocation called Random Access here has the lowest access ratio. Also, the basic access resource allocation algorithm powered by Q-learning is shown, that is, the so-called \"Channel Cost\" method proposed by many scholars in the past. It can be clearly seen that our proposed DP-DQN method has great advantages over other methods, especially when the unit time access volume gradually increases. It is worth mentioning that in this group of experiments, while changing the number of users making requests per unit time, the number of resources available for deployment per unit time in the control network remains unchanged, and the arrival time of users is subject to the same random process (Poisson process). Secondly, we fixed the number of users unchanged, changed the number of resources in the frequency domain (i.e., the amount of total resource blocks) and adopted the SF pairs that worked best in the previous experiment. It can be seen that our proposed resource allocation method has a higher access ratio than the original methods, shown in Figure 9. \begin{table}
\begin{tabular}{c c c c c} \hline \hline
**Parameter** & **Value (a)** & **Value (b)** & **Value (c)** & **Value (d)** \\ \hline \(\lambda_{1}\) & 0.50 & 0.50 & 0.70 & 0.50 \\ \(\lambda_{2}\) & 0.50 & 0.50 & 0.80 & 0.80 \\ \(\lambda_{3}\) & 0.50 & 0.80 & \(-0.80\) & \(-0.60\) \\ \(\lambda_{4}\) & 0.50 & 0.50 & 0.50 & \(-0.30\) \\ \hline \hline \end{tabular}
\end{table} 
Table 4: Summary of SF setting in Figure 8.  
Figure 8: MS successful access ratio of proposed slicing method with different user amounts in the circumstances of different sensitive factors summarized in Table 4. Since the differences of sensitivity factors in (**a**–**c**) are relatively small, the impact of different parameters on the system cannot be reflected, so its effect is slightly lower than that of (**d**).