Research Article
Beam Illumination and Resource Allocation for Multi-beam Satellite Systems
@INPROCEEDINGS{10.1007/978-3-031-34790-0_27, author={Xiaorui Tang and Rong Chai and Kang’an Gui}, title={Beam Illumination and Resource Allocation for Multi-beam Satellite Systems}, proceedings={Communications and Networking. 17th EAI International Conference, Chinacom 2022, Virtual Event, November 19-20, 2022, Proceedings}, proceedings_a={CHINACOM}, year={2023}, month={6}, keywords={Multi-beam satellite systems Resource allocation Two-stage resource allocation algorithm}, doi={10.1007/978-3-031-34790-0_27} }- Xiaorui Tang
Rong Chai
Kang’an Gui
Year: 2023
Beam Illumination and Resource Allocation for Multi-beam Satellite Systems
CHINACOM
Springer
DOI: 10.1007/978-3-031-34790-0_27
Abstract
Multi-beam satellite communication systems have received considerable attentions in recent years. By generating multiple beams at the transmitting satellites, the coverage areas can be enlarged and the transmission capacity can be improved. In this paper, we study beam illumination and resource allocation problem in multi-beam satellite communication systems. Jointly considering the revenue received from successful packet transmission and the energy consumption required for packet transmission, we define a system utility function and formulate joint user grouping, beam illumination, and time-frequency resource allocation problem as a constrained utility function maximization problem. Since beam illumination and time-frequency resource allocation problems are of different time and regional scales, this paper proposes a two-stage resource allocation algorithm. On relatively large temporal scale, we propose an offline user grouping algorithm and a group-oriented beam illumination scheme. Then based on the obtained user grouping and beam assignment strategy, an online resource scheduling algorithm is proposed, which schedules time and frequency resources for individual users. Numerical results verify the effectiveness of the proposed algorithm.
