Low-orbit communication constellation configuration optimization and beam allocation method for regional periodic transmission missions

In response to the needs of large-scale periodic data transmission tasks such as unmanned patrol video upload for forest fire prevention, traditional communication satellites are limited by uplink bandwidth and cannot meet their timeliness requirements. However, low-orbit broadband satellites have increasingly obvious application potential in the above scenarios due to their high-speed uplink characteristics. Taking the patrol video data upload of the core forest area of the Greater Khingan Range as an example, it is modeled as a regional time-division coverage problem within a fixed period, and a constellation configuration optimization and beam allocation algorithm based on particle swarm algorithm is proposed. The region is decomposed into many identical cells, and the time window and the number of beams are used as constraints. Considering the satellite power and the interference of adjacent beams, the particle swarm algorithm is used to optimize the constellation multi-beam allocation model. The simulation results show that under the same regional transmission period, the constellation configuration obtained by the proposed optimization algorithm uses fewer satellites, and can reduce the spatial interference of a single satellite beam, optimize beam allocation, effectively reduce mission costs, and improve resource utilization efficiency.

Authors

Institutions

Publication Details

Published
2024-12-13
DOI
https://doi.org/10.1117/12.3048265
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Low-orbit communication constellation configuration optimization and beam allocation method for regional periodic transmission missions

Huayi Li, Wentao He
Satellite Communication Systems
article

Low-orbit communication constellation configuration optimization and beam allocation method for regional periodic transmission missions

Huayi Li, Wentao He
article en

Abstract

In response to the needs of large-scale periodic data transmission tasks such as unmanned patrol video upload for forest fire prevention, traditional communication satellites are limited by uplink bandwidth and cannot meet their timeliness requirements. However, low-orbit broadband satellites have increasingly obvious application potential in the above scenarios due to their high-speed uplink characteristics. Taking the patrol video data upload of the core forest area of the Greater Khingan Range as an example, it is modeled as a regional time-division coverage problem within a fixed period, and a constellation configuration optimization and beam allocation algorithm based on particle swarm algorithm is proposed. The region is decomposed into many identical cells, and the time window and the number of beams are used as constraints. Considering the satellite power and the interference of adjacent beams, the particle swarm algorithm is used to optimize the constellation multi-beam allocation model. The simulation results show that under the same regional transmission period, the constellation configuration obtained by the proposed optimization algorithm uses fewer satellites, and can reduce the spatial interference of a single satellite beam, optimize beam allocation, effectively reduce mission costs, and improve resource utilization efficiency.

Harbin Institute of Technology (CN)
Openalex Percentile: Top 63%
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.