TY - JOUR
T1 - Efficient Resource Allocation for Beam-Hopping-Based Multi-Satellite Communication Systems
AU - Wang, Yingjie
AU - Zeng, Ming
AU - Fei, Zesong
N1 - Publisher Copyright:
© 2023 by the authors.
PY - 2023/6
Y1 - 2023/6
N2 - With the rapid growth of data traffic, low earth orbit (LEO) satellite communication networks have gradually ushered in a new trend of development due to its advantages of low latency, wide coverage, and high capacity. However, as a result of the limited on-board resources and rapidly changing traffic demand, it is increasingly urgent to design an efficient resource-allocation scheme to satisfy the traffic demand. In this paper, we propose two resource allocation algorithms in the multi-satellite system based on beam-hopping technology. In the offline case, it is assumed that the channel gains in all time-slots are known in advance, and we propose a heuristic algorithm to allocate time and frequency resources, and a successive convex approximation (SCA) algorithm to allocate power resources. In the online case, it is assumed that only the instant channel gains information is known; therefore, we apply the dynamic programming (DP) algorithm to maximize the system throughput. The simulation results prove that the proposed resource-allocation algorithms based on beam-hopping technology have better performance than the traditional average allocation method, and the online algorithm has acceptable performance loss compared with the offline algorithm.
AB - With the rapid growth of data traffic, low earth orbit (LEO) satellite communication networks have gradually ushered in a new trend of development due to its advantages of low latency, wide coverage, and high capacity. However, as a result of the limited on-board resources and rapidly changing traffic demand, it is increasingly urgent to design an efficient resource-allocation scheme to satisfy the traffic demand. In this paper, we propose two resource allocation algorithms in the multi-satellite system based on beam-hopping technology. In the offline case, it is assumed that the channel gains in all time-slots are known in advance, and we propose a heuristic algorithm to allocate time and frequency resources, and a successive convex approximation (SCA) algorithm to allocate power resources. In the online case, it is assumed that only the instant channel gains information is known; therefore, we apply the dynamic programming (DP) algorithm to maximize the system throughput. The simulation results prove that the proposed resource-allocation algorithms based on beam-hopping technology have better performance than the traditional average allocation method, and the online algorithm has acceptable performance loss compared with the offline algorithm.
KW - beam-hopping
KW - dynamic programming
KW - resource allocation
KW - successive convex approximation
UR - http://www.scopus.com/inward/record.url?scp=85161551612&partnerID=8YFLogxK
U2 - 10.3390/electronics12112441
DO - 10.3390/electronics12112441
M3 - Article
AN - SCOPUS:85161551612
SN - 2079-9292
VL - 12
JO - Electronics (Switzerland)
JF - Electronics (Switzerland)
IS - 11
M1 - 2441
ER -