Journal article · 2020 · Open access

Offloading and Resource Allocation With General Task Graph in Mobile Edge Computing: A Deep Reinforcement Learning Approach

Jia Yan, Suzhi Bi, Ying–Jun Angela Zhang

IEEE Transactions on Wireless Communications, 19(8), 5404–5419 · Published 15 May 2020 · DOI 10.1109/twc.2020.2993071

Open PDFView at the publisherCite this paper

In brief

“Offloading and Resource Allocation With General Task Graph in Mobile Edge Computing: A Deep Reinforcement Learning Approach” is a 2020 journal article by Jia Yan and 2 co-authors, published in IEEE Transactions on Wireless Communications. OpenAlex counts 238 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
238
Most cited in
2024 (58)
Field-weighted impact
11.89
References
30
Authors
3

Abstract

In this paper, we consider a mobile-edge computing (MEC) system, where an access point (AP) assists a mobile device (MD) to execute an application consisting of multiple tasks following a general task call graph. The objective is to jointly determine the offloading decision of each task and the resource allocation (e.g., CPU computing power) under time-varying wireless fading channels and stochastic edge computing capability, so that the energy-time cost (ETC) of the MD is minimized. Solving the problem is particularly hard due to the combinatorial offloading decisions and the strong coupling among task executions under the general dependency model. Conventional numerical optimization methods are inefficient to solve such a problem, especially when the problem size is large. To address the issue, we propose a deep reinforcement learning (DRL) framework based on the actor-critic learning structure. In particular, the actor network utilizes a DNN to learn the optimal mapping from the input states (i.e., wireless channel gains and edge CPU frequency) to the binary offloading decision of each task. Meanwhile, by analyzing the structure of the optimal solution, we derive a low-complexity algorithm for the critic network to quickly evaluate the ETC performance of the offloading decisions output by the actor network. With the low-complexity critic network, we can quickly select the best offloading action and subsequently store the state-action pair in an experience replay memory as the training dataset to continuously improve the action generation DNN. To further reduce the complexity, we show that the optimal offloading decision exhibits an one-climb structure, which can be utilized to significantly reduce the search space of action generation. Numerical results show that for various types of task graphs, the proposed algorithm achieves up to 99.1% of the optimal performance while significantly reducing the computational complexity compared to the existing optimization methods.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Yan, J., Bi, S., & Zhang, Y. A. (2020). Offloading and Resource Allocation With General Task Graph in Mobile Edge Computing: A Deep Reinforcement Learning Approach. IEEE Transactions on Wireless Communications, 19(8), 5404–5419. https://doi.org/10.1109/twc.2020.2993071

MLA 9

Yan, Jia, et al. “Offloading and Resource Allocation With General Task Graph in Mobile Edge Computing: A Deep Reinforcement Learning Approach.” IEEE Transactions on Wireless Communications, vol. 19, no. 8, 2020, pp. 5404–5419. https://doi.org/10.1109/twc.2020.2993071.

Chicago

Yan, Jia, Suzhi Bi, and Ying–Jun Angela Zhang. 2020. “Offloading and Resource Allocation With General Task Graph in Mobile Edge Computing: A Deep Reinforcement Learning Approach.” IEEE Transactions on Wireless Communications 19 (8): 5404–5419. https://doi.org/10.1109/twc.2020.2993071.

Harvard

Yan, J., Bi, S. and Zhang, Y. A. (2020) ‘Offloading and Resource Allocation With General Task Graph in Mobile Edge Computing: A Deep Reinforcement Learning Approach’, IEEE Transactions on Wireless Communications, 19(8), pp. 5404–5419. doi:10.1109/twc.2020.2993071.

IEEE

J. Yan, S. Bi, and Y. A. Zhang, “Offloading and Resource Allocation With General Task Graph in Mobile Edge Computing: A Deep Reinforcement Learning Approach,” IEEE Transactions on Wireless Communications, vol. 19, no. 8, pp. 5404–5419, 2020, doi: 10.1109/twc.2020.2993071.

BibTeX

@article{yan2020offloading,
  title     = {{Offloading and Resource Allocation With General Task Graph in Mobile Edge Computing: A Deep Reinforcement Learning Approach}},
  author    = {Yan, Jia and Bi, Suzhi and Zhang, Ying–Jun Angela},
  journal   = {IEEE Transactions on Wireless Communications},
  year      = {2020},
  volume    = {19},
  number    = {8},
  pages     = {5404--5419},
  doi       = {10.1109/twc.2020.2993071},
  url       = {https://doi.org/10.1109/twc.2020.2993071}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202011
20212626
20224040
20234949
20245858
20253737
20262727

Its field-weighted citation impact is 11.89: it has been cited 11.89 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing

  • mobile edge computing
  • task offloading
  • resource allocation
  • task graphs
  • deep reinforcement learning
  • actor-critic
  • wireless fading channels

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Yan, J., Bi, S., & Zhang, Y. A. (2020). Offloading and Resource Allocation With General Task Graph in Mobile Edge Computing: A Deep Reinforcement Learning Approach. IEEE Transactions on Wireless Communications, 19(8), 5404–5419. https://doi.org/10.1109/twc.2020.2993071

How many times has this paper been cited?

238 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Jia Yan, Suzhi Bi, Ying–Jun Angela Zhang.

What is the DOI of this paper?

10.1109/twc.2020.2993071, permanently at https://doi.org/10.1109/twc.2020.2993071. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.