Dynamic Power Allocation for Satellite-Terrestrial Communications with Cooperative Beam Hopping

In this paper, a multi-satellite cooperative beam hopping (BH) scenario in a low Earth orbit (LEO) satellite constellation is studied for satellite-terrestrial communications. Generally, the geographically non-uniform and time-varying packet arrival process, as well as the interference caused by dense beams, presents significant challenges in throughput maximization. To address these issues, an optimization problem is formulated to maximize long-term throughput in a multi-satellite cooperation scenario by determining the BH pattern and dynamic power allocation, while satisfying both peak and average power constraints. Subsequently, the original long-term problem is converted into decisions for each time slot through the Lyapunov drift-plus-penalty method. Moreover, the non-convex problem is solved with the successive convex approximation algorithm. Simulation results indicate that the proposed method can effectively improve throughput compared with the existing baseline, which demonstrates the effectiveness of the proposed method.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161998
Citations
1
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
4.99
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Power Allocation for Satellite-Terrestrial Communications with Cooperative Beam Hopping

Jian Song, Fang Yang, Guanhua Wang, Han Zhu
1 citations
Satellite Communication Systems
4.99
article

Dynamic Power Allocation for Satellite-Terrestrial Communications with Cooperative Beam Hopping

Jian Song, Fang Yang, Guanhua Wang, Han Zhu
article en
1 citations

Abstract

In this paper, a multi-satellite cooperative beam hopping (BH) scenario in a low Earth orbit (LEO) satellite constellation is studied for satellite-terrestrial communications. Generally, the geographically non-uniform and time-varying packet arrival process, as well as the interference caused by dense beams, presents significant challenges in throughput maximization. To address these issues, an optimization problem is formulated to maximize long-term throughput in a multi-satellite cooperation scenario by determining the BH pattern and dynamic power allocation, while satisfying both peak and average power constraints. Subsequently, the original long-term problem is converted into decisions for each time slot through the Lyapunov drift-plus-penalty method. Moreover, the non-convex problem is solved with the successive convex approximation algorithm. Simulation results indicate that the proposed method can effectively improve throughput compared with the existing baseline, which demonstrates the effectiveness of the proposed method.

University of Houston (US), Tsinghua University (CN)
Openalex Percentile: Top 4%
Satellite Communication Systems
4.99
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.