CoChat

Learning for Computation Offloading in Mobile Edge Computing

Dinh, Thinh Quang, La, Quang Duy, Quek, Tony Q. S., Shin, Hyundong · 2018 · IEEE Transactions on Communications

The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.

Abstract

Mobile edge computing (MEC) is expected to provide cloud-like capacities for mobile users (MUs) at the edge of wireless networks. However, deploying MEC systems faces many challenges, one of which is to achieve an efficient distributed offloading mechanism for multiple users in time-varying wireless environments. In this paper, we study a multi-user multi-edge-node computation offloading problem. Since edge nodes' communication and computing capacities are limited which leads resource contention when many MUs offload to the same edge node at the same time, we formulate this problem as a non-cooperative exact potential game (EPG), where each MU, in each time slot, selfishly maximizes its number of processed central processor unit (CPU) cycles and reduces its energy consumption. Assuming that channel information is static and available to MUs, we show that MUs could achieve a Nash equilibrium via a best response-based offloading mechanism. Next, we extend the problem to a practical scenario, where the number of processed CPU cycles is time-varying and unknown to MUs because of the uncertain channel information. In this case, we adopt an unknown payoff game framework and prove that the EPG properties still hold. Then, we propose a model-free reinforcement learning offloading mechanism which helps MUs learn their long-term offloading strategies to maximize their long-term utilities. Numerical results illustrate that our proposed algorithm for unknown CSI outperforms other schemes, such as local processing and random assignment, and achieves up to 87.87% average long-term payoffs compared to the perfect CSI case.

Overview

Integrity signals

Registry

Crossref · 10.1109/tcomm.2018.2866572

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 39 references

Research works printed but not linked: 1

  1. la, 2016, Potential Game Theory

Cited by

See all 232

Metadata

Authors
Dinh, T. Q., La, Q. D., Quek, T. Q. S., & Shin, H.
Affiliations
  • Singapore University of Technology and Design (SG)
  • Kyung Hee University (KR)
Venue
IEEE Transactions on Communications
Published
2018-12
Volume
66
Issue
12
Pages
6353-6367
ISSN
  • 0090-6778 (ISSN-L)
  • 1558-0857
OpenAlex
W2903874029
Cited by
214
References
38
Citations by year
2026: 9 · 2025: 19 · 2024: 16 · 2023: 28 · 2022: 34 · 2021: 48 · 2020: 45 · 2019: 13
FWCI
16.42
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Communications (publishedVersion)
Funders
  • MOE ARF Tier 2 (MOE2015-T2-2-104)
  • SUTD-ZJU Research Collaboration (SUTD-ZJU/RES/01/2016, SUTD-ZJU/RES/05/2016)
  • National Research Foundation of Korea
  • Korea Government (2016R1A2B2014462)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
  • Physical Sciences › Computer Science › Hardware and Architecture › Energy Efficiency in Computing
Keywords
computation offloading, mobile edge computing, Nash equilibrium, unknown channel state information, reinforcement learning, energy consumption, resource contention

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Learning for Computation Offloading in Mobile Edge Computing. https://app.cochat.ai/papers/10.1109/tcomm.2018.2866572
The paper
Dinh, T. Q., La, Q. D., Quek, T. Q. S., & Shin, H. (2018). Learning for Computation Offloading in Mobile Edge Computing. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2018.2866572

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.