Joint Task Assignment and Resource Allocation for D2D-Enabled Mobile-Edge Computing
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
With the proliferation of computation-extensive and latency-critical applications in the 5G and beyond networks, mobile-edge computing (MEC) or fog computing, which provides cloud-like computation and/or storage capabilities at the network edge, is envisioned to reduce computation latency as well as to conserve energy for wireless devices (WDs). This paper studies a novel device-to-device (D2D)-enabled multi-helper MEC system, in which a local user solicits its nearby WDs serving as helpers for cooperative computation. We assume a time division multiple access (TDMA) transmission protocol, under which the local user offloads the tasks to multiple helpers and downloads the results from them over orthogonal pre-scheduled time slots. Under this setup, we minimize the computation latency by optimizing the local user's task assignment jointly with the time and rate for task offloading and results downloading, as well as the computation frequency for task execution, subject to individual energy and computation capacity constraints at the local user and the helpers. However, the formulated problem is a mixed-integer non-linear program (MINLP) that is difficult to solve. To tackle this challenge, we propose an efficient algorithm by first relaxing the original problem into a convex one, and then constructing a suboptimal task assignment solution based on the obtained optimal one. Furthermore, we consider a benchmark scheme that endows the WDs with their maximum computation capacities. To further reduce the implementation complexity, we also develop a heuristic scheme based on the greedy task assignment. Finally, the numerical results validate the effectiveness of our proposed algorithm, as compared against the heuristic scheme and other benchmark ones without either joint optimization of radio and computation resources or task assignment design.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
Mobile Edge Computing: A Survey on Architecture and Computation Offloading
Mach, P., & Becvar, Z. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2682318 · Cited by 3,258
A Survey on Non-Orthogonal Multiple Access for 5G Networks: Research Challenges and Future Trends
Ding, Z., Lei, X., Karagiannidis, G. K., Schober, R., Yuan, J., & Bhargava, V. K. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2725519 · Cited by 2,392
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A., & Teng, S.-H. (2004) · Journal of the ACM · doi:10.1145/990308.990310 · Cited by 825
Exploiting Massive D2D Collaboration for Energy-Efficient Mobile Edge Computing
Chen, X., Pu, L., Gao, L., Wu, W., & Wu, D. (2017) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1600321 · Cited by 239
Cited by
Resource Scheduling in Edge Computing: A Survey
Luo, Q., Hu, S., Li, C., Li, G., & Shi, W. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3106401 · Cited by 588
“in [130] studied how to assign the time and rate of local users for task offloading and how to allocate computation frequency for task execution, aiming to minimize the computation latency.”
Background
Metadata
- Authors
- Xing, H., Liu, L., Xu, J., & Nallanathan, A.
- Venue
- IEEE Transactions on Communications
- Published
- 2019-06
- Volume
- 67
- Issue
- 6
- Pages
- 4193-4207
- ISSN
- 0090-6778 (ISSN-L)
- 1558-0857
- OpenAlex
- W2950920210
- Cited by
- 207
- References
- 5
- FWCI
- 18.86
- Type
- journal article
- Language
- en
- Open access
- green
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: Joint Task Assignment and Resource Allocation for D2D-Enabled Mobile-Edge Computing. https://app.cochat.ai/papers/10.1109/tcomm.2019.2903088
- The paper
- Xing, H., Liu, L., Xu, J., & Nallanathan, A. (2019). Joint Task Assignment and Resource Allocation for D2D-Enabled Mobile-Edge Computing. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2019.2903088
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.