TY - GEN
T1 - Efficient Resource Scheduling and Optimization for Over-Loaded LEO-Terrestrial Networks
AU - Yuan, Yaxiong
AU - Lei, Lei
AU - Vu, Thang X.
AU - Fowler, Scott
AU - Chatzinotas, Symeon
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Towards the next generation networks, low earth orbit (LEO) satellites have been considered as a promising component for beyond 5G networks. In this paper, we study downlink LEO-5G communication systems in a practical scenario, where the integrated LEO-terrestrial system is over-loaded by serving a number of terminals with high-volume traffic requests. Our goal is to optimize resource scheduling such that the amount of undelivered data and the number of unserved terminals can be minimized. Due to the inherent hardness of the formulated quadratic integer programming problem, the optimal algorithm requires unaffordable complexity. To solve the problem, we propose a near-optimal algorithm based on alternating direction method of multipliers (ADMM-HEU), which saves computational time by taking advantage of the distributed ADMM structure, and a low-complexity heuristic algorithm (LC-HEU), which is based on estimation and greedy methods. The results demonstrate the near-optimality of ADMM-HEU and the computational efficiency of LC-HEU compared to the benchmarks.
AB - Towards the next generation networks, low earth orbit (LEO) satellites have been considered as a promising component for beyond 5G networks. In this paper, we study downlink LEO-5G communication systems in a practical scenario, where the integrated LEO-terrestrial system is over-loaded by serving a number of terminals with high-volume traffic requests. Our goal is to optimize resource scheduling such that the amount of undelivered data and the number of unserved terminals can be minimized. Due to the inherent hardness of the formulated quadratic integer programming problem, the optimal algorithm requires unaffordable complexity. To solve the problem, we propose a near-optimal algorithm based on alternating direction method of multipliers (ADMM-HEU), which saves computational time by taking advantage of the distributed ADMM structure, and a low-complexity heuristic algorithm (LC-HEU), which is based on estimation and greedy methods. The results demonstrate the near-optimality of ADMM-HEU and the computational efficiency of LC-HEU compared to the benchmarks.
KW - ADMM
KW - LEO satellites
KW - heuristic algorithm
KW - resource scheduling
KW - supply-demand matching
UR - https://www.scopus.com/pages/publications/85137264849
U2 - 10.1109/ICC45855.2022.9839277
DO - 10.1109/ICC45855.2022.9839277
M3 - 会议稿件
AN - SCOPUS:85137264849
T3 - IEEE International Conference on Communications
SP - 1052
EP - 1057
BT - ICC 2022 - IEEE International Conference on Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 IEEE International Conference on Communications, ICC 2022
Y2 - 16 May 2022 through 20 May 2022
ER -