Beam-Hopping Based Resource Allocation for Multi-Beam Satellite Communication Networks

In this paper, a beam resource scheduling algorithm employing deep reinforcement learning is developed, leveraging the decision-making capabilities of reinforcement learning alongside the perceptual strengths of deep learning. The beam allocation problem is conceptualized as a Markov decision process, where the state is defined by the number and delay of data packets, and the action is specified as the beam allocation, with associated rewards defined accordingly. Utilizing a convolutional neural network, the algorithm effectively extracts pertinent features. The primary optimization goals are to minimize the latency of real-time services, maximize the throughput for non-real-time services, and ensure equitable distribution of beam resources. The deep reinforcement learning algorithm refines the dynamic beam scheduling strategy through extensive training involving numerous state matrix inputs. Experimental results underscore that the algorithm not only enhances the fairness of beam allocation but also significantly reduces data packet transmission delays and boosts the overall throughput of the communication system.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/ccpqt64497.2024.00055
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Beam-Hopping Based Resource Allocation for Multi-Beam Satellite Communication Networks

Ke Deng, Dong Shang, Tong Li, Hongbo Zhang
Satellite Communication Systems
article

Beam-Hopping Based Resource Allocation for Multi-Beam Satellite Communication Networks

Ke Deng, Dong Shang, Tong Li, Hongbo Zhang
article en

Abstract

In this paper, a beam resource scheduling algorithm employing deep reinforcement learning is developed, leveraging the decision-making capabilities of reinforcement learning alongside the perceptual strengths of deep learning. The beam allocation problem is conceptualized as a Markov decision process, where the state is defined by the number and delay of data packets, and the action is specified as the beam allocation, with associated rewards defined accordingly. Utilizing a convolutional neural network, the algorithm effectively extracts pertinent features. The primary optimization goals are to minimize the latency of real-time services, maximize the throughput for non-real-time services, and ensure equitable distribution of beam resources. The deep reinforcement learning algorithm refines the dynamic beam scheduling strategy through extensive training involving numerous state matrix inputs. Experimental results underscore that the algorithm not only enhances the fairness of beam allocation but also significantly reduces data packet transmission delays and boosts the overall throughput of the communication system.

Chongqing University of Posts and Telecommunications (CN), Chengdu University of Information Technology (CN)
Natural Science Foundation of Chongqing
Openalex Percentile: Top 54%
Satellite Communication Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.