Dynamic Service Caching Aided Computation Offloading Optimization Algorithm for Mobile-Edge Networks

The widespread adoption of computation- and communication-intensive applications, such as object detection, VR/AR, and telemedicine, has significantly alleviated transmission pressure on backbone networks and improved user experience. However, efficiently managing and computing these tasks on user sides remains a significant challenge, particularly under resource-constrained conditions. To address this problem, we propose a new service caching decision method based on deep dueling double Q-network (D3QN) by employing a learnable policy to handle the unknown task requests and determine the optimal caching strategies. Additionally, the limited storage capacity of edge servers (ES) is mitigated by forwarding the resource-intensive or infrequently requested tasks to the cloud data centers (CDC). The channel selection problem is modeled as a multiuser game and a distributed method is developed to achieve the Nash Equilibrium (NE). Simulation results demonstrate that the proposed method outperforms the existing benchmarks, showcasing its effectiveness in managing complex, dynamic environments.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-03-31
DOI
https://doi.org/10.1109/jiot.2025.3555978
Citations
3
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
4.46

Funders

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

Dynamic Service Caching Aided Computation Offloading Optimization Algorithm for Mobile-Edge Networks

Mohsen Guizani, Jinhua Xie, Haixia Cui, Yejun He et al.
3 citations
IEEE Internet of Things Journal
Caching and Content Delivery
4.46
article

Dynamic Service Caching Aided Computation Offloading Optimization Algorithm for Mobile-Edge Networks

Mohsen Guizani, Jinhua Xie, Haixia Cui, Yejun He, Bo Xie
article en
3 citations

Abstract

The widespread adoption of computation- and communication-intensive applications, such as object detection, VR/AR, and telemedicine, has significantly alleviated transmission pressure on backbone networks and improved user experience. However, efficiently managing and computing these tasks on user sides remains a significant challenge, particularly under resource-constrained conditions. To address this problem, we propose a new service caching decision method based on deep dueling double Q-network (D3QN) by employing a learnable policy to handle the unknown task requests and determine the optimal caching strategies. Additionally, the limited storage capacity of edge servers (ES) is mitigated by forwarding the resource-intensive or infrequently requested tasks to the cloud data centers (CDC). The channel selection problem is modeled as a multiuser game and a distributed method is developed to achieve the Nash Equilibrium (NE). Simulation results demonstrate that the proposed method outperforms the existing benchmarks, showcasing its effectiveness in managing complex, dynamic environments.

IEEE Internet of Things JournalVol. 12(13)
Shenzhen University (CN), South China Normal University (CN), Mohamed bin Zayed University of Artificial Intelligence (AE)
Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 6%
Caching and Content Delivery
4.46
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.