Multi-Agent Deep Reinforcement Learning-Based Offloading Computation and Routing in Cooperative LEO Satellite Communication Network

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.

Authors

Institutions

Publication Details

Published
2025-06-17
DOI
https://doi.org/10.1109/vtc2025-spring65109.2025.11174439
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

Multi-Agent Deep Reinforcement Learning-Based Offloading Computation and Routing in Cooperative LEO Satellite Communication Network

Zesong Fei, Ming Zeng, Yunyi Yan, Zhiqiang Yang
Satellite Communication Systems
article

Multi-Agent Deep Reinforcement Learning-Based Offloading Computation and Routing in Cooperative LEO Satellite Communication Network

Zesong Fei, Ming Zeng, Yunyi Yan, Zhiqiang Yang
article en

Abstract

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.

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