2020
DOI: 10.1109/access.2020.3004861
|View full text |Cite
|
Sign up to set email alerts
|

Semi-Online Computational Offloading by Dueling Deep-Q Network for User Behavior Prediction

Abstract: Task offloading could optimize computational resource utilization in edge computing environments. However, how to assign and offload tasks for different behavior users is an essential problem since the systems dynamic, intelligent application diversity, and user personality. With user behavior prediction, this paper proposes soCoM, a semi-online Computational Offloading Model. We explore the user behaviors in sophisticated action space by reinforcement learning for catching unknown environment information. Wit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
12
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(13 citation statements)
references
References 29 publications
0
12
0
Order By: Relevance
“…Chen et al [33] considered the communication of terminal devices in an ultradense LAN, where users can select multiple base stations for task offloading to maximize utility performance, reducing the energy consumption of tasks in the computational queue and the channel queue between terminals and base stations, breaking the bottleneck in the high-dimensional space, and achieving the optimal policy based on the DQN algorithm in the case of unknown network dynamic environment. Similarly, the design goal of Song et al [34] is to optimize resource utilization, energy consumption, and network latency by predicting user behavior using a variant of the DQN algorithm to solve the problem. Zou et al [35][36][37] both used the improved Actor-Critic (AC) algorithm in the Deep Deterministic Policy Gradient (DDPG) algorithm to solve the offloading decision policy to balance the workload of the edge server and the final task was reduced in terms of energy consumption and computation time.…”
Section: Offloading Methods With Different Problem Solving Strategiesmentioning
confidence: 99%
“…Chen et al [33] considered the communication of terminal devices in an ultradense LAN, where users can select multiple base stations for task offloading to maximize utility performance, reducing the energy consumption of tasks in the computational queue and the channel queue between terminals and base stations, breaking the bottleneck in the high-dimensional space, and achieving the optimal policy based on the DQN algorithm in the case of unknown network dynamic environment. Similarly, the design goal of Song et al [34] is to optimize resource utilization, energy consumption, and network latency by predicting user behavior using a variant of the DQN algorithm to solve the problem. Zou et al [35][36][37] both used the improved Actor-Critic (AC) algorithm in the Deep Deterministic Policy Gradient (DDPG) algorithm to solve the offloading decision policy to balance the workload of the edge server and the final task was reduced in terms of energy consumption and computation time.…”
Section: Offloading Methods With Different Problem Solving Strategiesmentioning
confidence: 99%
“…problem formulated in (18) will be solved by jointly optimize the offloading policy and computational resource allocation. Specifically, we first divide the original problem into two sub-problems.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Similarly, Ref. [18] uses the DDQN algorithm to predict UEs' offloading modes meanwhile achieving a load balance of the MEC server with unknown environment information, which is interpreted as the unknown channel state information. By adopting the DDQN algorithm, Ref.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Song et al. [ 19 ] proposed a semi-online computational offloading model soCoM based on dueling deep-Q network to explore the user behaviors in sophisticated action space by reinforcement learning for catching unknown environment information. Liu et al.…”
Section: Related Workmentioning
confidence: 99%