Online Joint Power Allocation and Task Scheduling for LEO Satellite Networks

The excessive proliferation of Low Earth Orbit (LEO) satellites inescapably bring the explosive growth of space data in LEO Satellite Networks (LSNs). Meanwhile, the stochastic arrivals of space data together with the time-varying satellite-ground links in LSNs pose significant challenges for offloading a large volume of space data from LSNs to ground stations. To circumvent these challenges, we systematically study the energy-constrained online data offloading problem to jointly optimize power allocation and task scheduling for LSNs. First, we leverage Lyapunov optimization to decouple our formulated long-term stochastic joint optimization problem into a set of per-time-slot subproblems. Then, each subproblem is decoupled into a task scheduling problem and a power allocation problem. Next, we derive the optimal solution to the power allocation problem and propose a multi-armed bandit based quasi-optimal solution to the task scheduling problem. Finally, extensive simulation results show that our proposed algorithm has superior performance over the state-of-the-art solutions.

Authors

Institutions

Publication Details

Published
2025-03-24
DOI
https://doi.org/10.1109/wcnc61545.2025.10978643
Citations
1
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
4.99

Funders

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

Online Joint Power Allocation and Task Scheduling for LEO Satellite Networks

Chau Yuen, Lijun He, Yanting Wang, Juncheng Wang et al.
1 citations
Satellite Communication Systems
4.99
article

Online Joint Power Allocation and Task Scheduling for LEO Satellite Networks

Chau Yuen, Lijun He, Yanting Wang, Juncheng Wang, Ziye Jia, Zheyuan Li
article en
1 citations

Abstract

The excessive proliferation of Low Earth Orbit (LEO) satellites inescapably bring the explosive growth of space data in LEO Satellite Networks (LSNs). Meanwhile, the stochastic arrivals of space data together with the time-varying satellite-ground links in LSNs pose significant challenges for offloading a large volume of space data from LSNs to ground stations. To circumvent these challenges, we systematically study the energy-constrained online data offloading problem to jointly optimize power allocation and task scheduling for LSNs. First, we leverage Lyapunov optimization to decouple our formulated long-term stochastic joint optimization problem into a set of per-time-slot subproblems. Then, each subproblem is decoupled into a task scheduling problem and a power allocation problem. Next, we derive the optimal solution to the power allocation problem and propose a multi-armed bandit based quasi-optimal solution to the task scheduling problem. Finally, extensive simulation results show that our proposed algorithm has superior performance over the state-of-the-art solutions.

Hong Kong Baptist University (HK), Northwestern Polytechnical University (CN), Nanyang Technological University (SG), China University of Mining and Technology (CN), Ministry of Industry and Information Technology (CN), Nanjing University of Aeronautics and Astronautics (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 6%
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.