Time-slot allocation algorithm for LEO satellite beam hopping based on non-stationary MAB
Aiming at the problem of inadequate adaptation to dynamic changes in cell services in the resource allocation algorithm for hopping beams in low earth orbit (LEO) satellite systems, a time-slot allocation algorithm for LEO satellite beam hopping based on a non-stationary multi-armed bandit (MAB) was...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2023-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023160/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841540083991183360 |
|---|---|
| author | Min LIN Pengcheng KAN Bai ZHAO Ming CHENG Lyuxi YANG |
| author_facet | Min LIN Pengcheng KAN Bai ZHAO Ming CHENG Lyuxi YANG |
| author_sort | Min LIN |
| collection | DOAJ |
| description | Aiming at the problem of inadequate adaptation to dynamic changes in cell services in the resource allocation algorithm for hopping beams in low earth orbit (LEO) satellite systems, a time-slot allocation algorithm for LEO satellite beam hopping based on a non-stationary multi-armed bandit (MAB) was proposed.Firstly, the joint optimization problem of slot allocation and beam grading matching was established, with the minimization of the system’s second-order differential capacity as the optimization objective.Secondly, due to the non-convexity and difficulty in direct solution of this problem, a beam grading combination scheme generation algorithm was proposed based on the concept of effective cells and effective critical cells, which generated all possible beam grading combination schemes.Next, a dynamic slot allocation scheme based on the non-stationary MAB model was proposed, and joint optimization of slot allocation and beam grading matching was completed under the optimal beam grading combination scheme.Finally, the computer simulation results show that the average redundancy of the proposed algorithm is less than 20% in the case of multiple cell service distributions.In addition, compared with other schemes, the proposed algorithm can control the average beam revisit time to about 300 ms while maintaining high system throughput. |
| format | Article |
| id | doaj-art-f064a51bf6be4c94a38a742e1840676e |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2023-08-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-f064a51bf6be4c94a38a742e1840676e2025-01-14T06:22:49ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2023-08-014413414359385950Time-slot allocation algorithm for LEO satellite beam hopping based on non-stationary MABMin LINPengcheng KANBai ZHAOMing CHENGLyuxi YANGAiming at the problem of inadequate adaptation to dynamic changes in cell services in the resource allocation algorithm for hopping beams in low earth orbit (LEO) satellite systems, a time-slot allocation algorithm for LEO satellite beam hopping based on a non-stationary multi-armed bandit (MAB) was proposed.Firstly, the joint optimization problem of slot allocation and beam grading matching was established, with the minimization of the system’s second-order differential capacity as the optimization objective.Secondly, due to the non-convexity and difficulty in direct solution of this problem, a beam grading combination scheme generation algorithm was proposed based on the concept of effective cells and effective critical cells, which generated all possible beam grading combination schemes.Next, a dynamic slot allocation scheme based on the non-stationary MAB model was proposed, and joint optimization of slot allocation and beam grading matching was completed under the optimal beam grading combination scheme.Finally, the computer simulation results show that the average redundancy of the proposed algorithm is less than 20% in the case of multiple cell service distributions.In addition, compared with other schemes, the proposed algorithm can control the average beam revisit time to about 300 ms while maintaining high system throughput.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023160/LEObeam hoppinggraded beamnon-stationary MAB |
| spellingShingle | Min LIN Pengcheng KAN Bai ZHAO Ming CHENG Lyuxi YANG Time-slot allocation algorithm for LEO satellite beam hopping based on non-stationary MAB Tongxin xuebao LEO beam hopping graded beam non-stationary MAB |
| title | Time-slot allocation algorithm for LEO satellite beam hopping based on non-stationary MAB |
| title_full | Time-slot allocation algorithm for LEO satellite beam hopping based on non-stationary MAB |
| title_fullStr | Time-slot allocation algorithm for LEO satellite beam hopping based on non-stationary MAB |
| title_full_unstemmed | Time-slot allocation algorithm for LEO satellite beam hopping based on non-stationary MAB |
| title_short | Time-slot allocation algorithm for LEO satellite beam hopping based on non-stationary MAB |
| title_sort | time slot allocation algorithm for leo satellite beam hopping based on non stationary mab |
| topic | LEO beam hopping graded beam non-stationary MAB |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023160/ |
| work_keys_str_mv | AT minlin timeslotallocationalgorithmforleosatellitebeamhoppingbasedonnonstationarymab AT pengchengkan timeslotallocationalgorithmforleosatellitebeamhoppingbasedonnonstationarymab AT baizhao timeslotallocationalgorithmforleosatellitebeamhoppingbasedonnonstationarymab AT mingcheng timeslotallocationalgorithmforleosatellitebeamhoppingbasedonnonstationarymab AT lyuxiyang timeslotallocationalgorithmforleosatellitebeamhoppingbasedonnonstationarymab |