Joint Optimization of Computation Offloading and Caching for Satellite Edge Computing Based on GRU-SAC Algorithm

Considering the satellites’ wide coverage and independence from geographical constraints, satellite edge computing (SEC) has demonstrated broad application prospects. In this paper, a joint offloading and caching framework is proposed, addressing issues such as redundant data transmission, heterogeneous resources, and the high-speed movement of satellites in SEC. In the framework, latency and system energy consumption are reduced by dynamically caching reusable data and formulating an appropriate offloading strategy. Considering the complexity of the problem, we propose a GRU-SAC algorithm that trains multiple distinct deep neural networks (DNNs) to output offloading and caching actions. It combines maximum entropy with policy gradient to enhance strategy stability and avoid local optima. Furthermore, the algorithm predicts the future request probabilities of tasks as part of the state space, aiding in strategy training and adapting to dynamically changing environments. Simulation results substantiate the effectiveness of our proposed method in reducing latency and system energy consumption. In the simulation environment comprising five users and two satellites, the latency decreased from nearly 132 to around 129, and the energy consumption decreased from nearly 22 to around 18.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-08-29
DOI
https://doi.org/10.1109/jiot.2025.3598758
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

Joint Optimization of Computation Offloading and Caching for Satellite Edge Computing Based on GRU-SAC Algorithm

Yubin Jia, Yueqi Li, Lu Dong, Jian Liu et al.
1 links
IEEE Internet of Things Journal
Satellite Communication Systems
article

Joint Optimization of Computation Offloading and Caching for Satellite Edge Computing Based on GRU-SAC Algorithm

Yubin Jia, Yueqi Li, Lu Dong, Jian Liu, Ao Xu
article en

Abstract

Considering the satellites’ wide coverage and independence from geographical constraints, satellite edge computing (SEC) has demonstrated broad application prospects. In this paper, a joint offloading and caching framework is proposed, addressing issues such as redundant data transmission, heterogeneous resources, and the high-speed movement of satellites in SEC. In the framework, latency and system energy consumption are reduced by dynamically caching reusable data and formulating an appropriate offloading strategy. Considering the complexity of the problem, we propose a GRU-SAC algorithm that trains multiple distinct deep neural networks (DNNs) to output offloading and caching actions. It combines maximum entropy with policy gradient to enhance strategy stability and avoid local optima. Furthermore, the algorithm predicts the future request probabilities of tasks as part of the state space, aiding in strategy training and adapting to dynamically changing environments. Simulation results substantiate the effectiveness of our proposed method in reducing latency and system energy consumption. In the simulation environment comprising five users and two satellites, the latency decreased from nearly 132 to around 129, and the energy consumption decreased from nearly 22 to around 18.

IEEE Internet of Things JournalVol. 12(22)
Lomonosov Moscow State University (RU), Southeast University (BD), Southeast University (CN)
Openalex Percentile: Top 69%
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.