Task-Driven Priority-Aware Computation Offloading Using Deep Reinforcement Learning

Computation offloading is an effective method for reducing the pressure put on networks and improving the service experience. However, most existing research on computation offloading is timeslot-driven and treats all tasks equally, resulting in decision waiting delays and failure to complete some important tasks. In this paper, we propose a novel priority-aware task-driven computation offloading model with system performance gain as the optimization objective based on a combination of task delay and energy consumption aspects. The new model is formulated as a Markov decision process (MDP). Considering the discrete-continuous hybrid action space of the optimization problem, we construct a dependence-aware latent space and propose a novel algorithm based on the Twin Delayed Deep Deterministic policy gradient algorithm (TD3). Additionally, we present the neural network structure and analyze the complexity of the algorithm. Extensive simulations show how our algorithm achieves superior performance compared to three state-of-the-art alternative approaches.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Wireless Communications
Published
2025-05-07
DOI
https://doi.org/10.1109/twc.2025.3564356
Citations
22
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
32.72

Funders

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

Task-Driven Priority-Aware Computation Offloading Using Deep Reinforcement Learning

Shujie Yang, Gabriel‐Miro Muntean, Changqiao Xu, Wei Zhang et al.
22 citations
IEEE Transactions on Wireless Communications
IoT and Edge/Fog Computing
32.72
article

Task-Driven Priority-Aware Computation Offloading Using Deep Reinforcement Learning

Shujie Yang, Gabriel‐Miro Muntean, Changqiao Xu, Wei Zhang, Hao Hao
article en
22 citations

Abstract

Computation offloading is an effective method for reducing the pressure put on networks and improving the service experience. However, most existing research on computation offloading is timeslot-driven and treats all tasks equally, resulting in decision waiting delays and failure to complete some important tasks. In this paper, we propose a novel priority-aware task-driven computation offloading model with system performance gain as the optimization objective based on a combination of task delay and energy consumption aspects. The new model is formulated as a Markov decision process (MDP). Considering the discrete-continuous hybrid action space of the optimization problem, we construct a dependence-aware latent space and propose a novel algorithm based on the Twin Delayed Deep Deterministic policy gradient algorithm (TD3). Additionally, we present the neural network structure and analyze the complexity of the algorithm. Extensive simulations show how our algorithm achieves superior performance compared to three state-of-the-art alternative approaches.

IEEE Transactions on Wireless CommunicationsVol. 24(10)
Beijing University of Posts and Telecommunications (CN), Qilu University of Technology (CN), Shandong Academy of Sciences (CN), Dublin City University (IE)
National Natural Science Foundation of China
Openalex Percentile: Top 0%
IoT and Edge/Fog Computing
32.72
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.