TY - JOUR
T1 - Computation offloading time optimisation via Q-learning in opportunistic edge computing
AU - Yang, Guisong
AU - Hou, Ling
AU - Cheng, Hao
AU - He, Xingyu
AU - He, Daojing
AU - Chan, Sammy
PY - 2020/12
Y1 - 2020/12
N2 - The emergence of computation offloading can meet the real-time requirements of computing tasks with intensive computing demands. In this study, the authors use opportunistic communication to construct a network framework for opportunistic edge computing (OEC) to perform computation offloading. Specifically, OEC forms a computing resource pool near the edge servers in the edge layer by gathering idle computing resources. Firstly, the state of the system is defined by the attributes of the computing task, the execution location of the computing task and the location of the terminal device in OEC. Then the computation offloading time is calculated and learned by selecting different offloading nodes. Finally, an optimal offloading node selection strategy based on the Q-learning algorithm is obtained. Extensive simulations show that the proposed strategy consumes the minimum computation offloading time compared with benchmark algorithms in aspects of the amount of uploaded data, the total number of CPU cycles of the task and the number of computing tasks.
AB - The emergence of computation offloading can meet the real-time requirements of computing tasks with intensive computing demands. In this study, the authors use opportunistic communication to construct a network framework for opportunistic edge computing (OEC) to perform computation offloading. Specifically, OEC forms a computing resource pool near the edge servers in the edge layer by gathering idle computing resources. Firstly, the state of the system is defined by the attributes of the computing task, the execution location of the computing task and the location of the terminal device in OEC. Then the computation offloading time is calculated and learned by selecting different offloading nodes. Finally, an optimal offloading node selection strategy based on the Q-learning algorithm is obtained. Extensive simulations show that the proposed strategy consumes the minimum computation offloading time compared with benchmark algorithms in aspects of the amount of uploaded data, the total number of CPU cycles of the task and the number of computing tasks.
UR - http://www.scopus.com/inward/record.url?scp=85101741091&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85101741091&origin=recordpage
U2 - 10.1049/iet-com.2020.0765
DO - 10.1049/iet-com.2020.0765
M3 - RGC 21 - Publication in refereed journal
SN - 1751-8628
VL - 14
SP - 3898
EP - 3906
JO - IET Communications
JF - IET Communications
IS - 21
ER -