TY - GEN
T1 - Multi-Agent Deep Reinforcement Learning-Based Offloading Computation and Routing in Cooperative LEO Satellite Communication Network
AU - Yan, Yunyi
AU - Zeng, Ming
AU - Yang, Zijian
AU - Fei, Zesong
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - The increasing demand for tasks and dynamically changing loads in the Low Earth Orbit (LEO) satellite networks creates significant challenges in terms of computing and routing. Currently, LEO satellites primarily offload tasks to ground stations or satellites within their line of sight, failing to fully utilize the computational resources of the entire network. In addition, existing routing algorithms fail to consider on-satellite loads and computational capacities, leading to bottlenecks in network routing as some satellites with limited processing capacity become overwhelmed. In this paper, the tasks generated by the source satellite can be offloaded to either satellites or ground stations while routing to the destination satellite. The offloading computation and routing decision problems are investigated to minimize the maximum delay. To solve this challenging problem, we first convert the optimization variables, encompassing both routing and computation offloading, into a form that depends solely on the latter, and model the problem as the Markov Decision Process (MDP). Subsequently, the problem is addressed using an algorithm based on Multi-Agent Proximal Policy Optimization (MAPPO), where multiple agents cooperatively determine routing and offloading computation strategies. Simulation results show that the proposed scheme achieves better delay performance.
AB - The increasing demand for tasks and dynamically changing loads in the Low Earth Orbit (LEO) satellite networks creates significant challenges in terms of computing and routing. Currently, LEO satellites primarily offload tasks to ground stations or satellites within their line of sight, failing to fully utilize the computational resources of the entire network. In addition, existing routing algorithms fail to consider on-satellite loads and computational capacities, leading to bottlenecks in network routing as some satellites with limited processing capacity become overwhelmed. In this paper, the tasks generated by the source satellite can be offloaded to either satellites or ground stations while routing to the destination satellite. The offloading computation and routing decision problems are investigated to minimize the maximum delay. To solve this challenging problem, we first convert the optimization variables, encompassing both routing and computation offloading, into a form that depends solely on the latter, and model the problem as the Markov Decision Process (MDP). Subsequently, the problem is addressed using an algorithm based on Multi-Agent Proximal Policy Optimization (MAPPO), where multiple agents cooperatively determine routing and offloading computation strategies. Simulation results show that the proposed scheme achieves better delay performance.
KW - MAPPO
KW - cooperative communication
KW - low earth orbit satellite
KW - offloading computation
KW - routing
UR - https://www.scopus.com/pages/publications/105019043328
U2 - 10.1109/VTC2025-Spring65109.2025.11174439
DO - 10.1109/VTC2025-Spring65109.2025.11174439
M3 - Conference contribution
AN - SCOPUS:105019043328
T3 - IEEE Vehicular Technology Conference
BT - 2025 IEEE 101st Vehicular Technology Conference, VTC 2025-Spring 2025 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 101st IEEE Vehicular Technology Conference, VTC 2025-Spring 2025
Y2 - 17 June 2025 through 20 June 2025
ER -