Name
Title | ||
|---|---|---|
Computation Offloading Time Optimisation Via Q-Learning In Opportunistic Edge Computing |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1049/iet-com.2020.0765 | IET COMMUNICATIONS |
Keywords | DocType | Volume |
optimisation, distributed processing, learning (artificial intelligence), computation offloading time optimisation, opportunistic edge computing, intensive computing demands, computing resource pool, idle computing resources, computing task, optimal offloading node selection strategy, minimum computation offloading time, Q-learning | Journal | 14 |
Issue | ISSN | Citations |
21 | 1751-8628 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guisong Yang | 1 | 16 | 3.58 |
| Ling Hou | 2 | 5 | 1.09 |
| Hao Cheng | 3 | 0 | 0.34 |
| Xingyu He | 4 | 17 | 7.74 |
| Daojing He | 5 | 1013 | 58.40 |
| Sammy Chan | 6 | 902 | 66.93 |