TY - JOUR
T1 - Joint Online Optimization of Power Allocation and Task Scheduling for Data Offloading in LEO Satellite Networks
AU - He, Lijun
AU - Li, Zheyuan
AU - Wang, Juncheng
AU - Jia, Ziye
AU - Wang, Yanting
AU - Yuen, Chau
AU - Han, Zhu
N1 - This work was supported in part by the National Natural Science Foundation of China under Grant 62201463, 62301251, and 62002293, in part by Natural Science Basic Research Program of Shaanxi (Program No.2025JC-YBQN- 794), and in part by NSF ECCS-2302469, CMMI-2222810, Toyota. Amazon and Japan Science and Technology Agency (JST) Adopting Sustainable Partnerships for Innovative Research Ecosystem (ASPIRE) JPMJAP2326.
Publisher Copyright:
© 2025 IEEE. All rights reserved, including rights for text and data mining and training of artificial intelligence and similar technologies.
PY - 2025/12/17
Y1 - 2025/12/17
N2 - The rapid expansion of Low Earth Orbit (LEO) satellites inescapably leads to the explosive growth of space data in LEO Satellite Networks (LSNs). The stochastic nature of space data arrivals and the intrinsically time-varying satellite-ground links in LSNs pose significant challenges for offloading substantial volumes of space data from LSNs to the ground stations. To overcome these challenges, we systematically study the joint online optimization of power allocation and task scheduling for data offloading in LSNs. Firstly, we remove the constraint of mean rate queue stability from the formulated joint online optimization problem and leverage Lyapunov optimization to decouple it into a set of per-time-slot subproblems. Each subproblem is then divided into a task scheduling problem and a power allocation problem. Subsequently, we derive a closed-form optimal solution for the power allocation problem, and a multi-armed bandit-based quasi-optimal solution for the task scheduling problem. Furthermore, we extend the aforementioned solutions to address the original joint online optimization problem. Through theoretical analyses, we show that the proposed algorithms consistently attain a sublinear time-averaged regret. Extensive simulation results demonstrate that our proposed algorithms exhibit superior performance over other benchmarks.
AB - The rapid expansion of Low Earth Orbit (LEO) satellites inescapably leads to the explosive growth of space data in LEO Satellite Networks (LSNs). The stochastic nature of space data arrivals and the intrinsically time-varying satellite-ground links in LSNs pose significant challenges for offloading substantial volumes of space data from LSNs to the ground stations. To overcome these challenges, we systematically study the joint online optimization of power allocation and task scheduling for data offloading in LSNs. Firstly, we remove the constraint of mean rate queue stability from the formulated joint online optimization problem and leverage Lyapunov optimization to decouple it into a set of per-time-slot subproblems. Each subproblem is then divided into a task scheduling problem and a power allocation problem. Subsequently, we derive a closed-form optimal solution for the power allocation problem, and a multi-armed bandit-based quasi-optimal solution for the task scheduling problem. Furthermore, we extend the aforementioned solutions to address the original joint online optimization problem. Through theoretical analyses, we show that the proposed algorithms consistently attain a sublinear time-averaged regret. Extensive simulation results demonstrate that our proposed algorithms exhibit superior performance over other benchmarks.
KW - LEO satellite networks
KW - multi-armed bandit
KW - online data offloading
KW - power allocation
KW - task scheduling
UR - https://www.scopus.com/pages/publications/105025754055
U2 - 10.1109/TNSE.2025.3645282
DO - 10.1109/TNSE.2025.3645282
M3 - Journal article
SN - 2334-329X
JO - IEEE Transactions on Network Science and Engineering
JF - IEEE Transactions on Network Science and Engineering
ER -