Journal article · 2021 · Open access

Optimal dynamic spectrum allocation-assisted latency minimization for multiuser mobile edge computing

Li Yang, Tianshun Wang, Yuan Wu, Weijia Jia

Digital Communications and Networks, 8(3), 247–256 · Published 1 November 2021 · DOI 10.1016/j.dcan.2021.10.008

Open PDFView at the publisherCite this paper

In brief

“Optimal dynamic spectrum allocation-assisted latency minimization for multiuser mobile edge computing” is a 2021 journal article by Li Yang and 3 co-authors, published in Digital Communications and Networks. OpenAlex counts 21 citations as of 19 November 2026, which puts it in the top 9% of works published in 2021 by citations. It is open access under a CC BY-NC-ND licence: the full text is free to read at Digital Communications and Networks.

Citations
21
Most cited in
2023 (11)
Field-weighted impact
1.49
References
41
Authors
4

Abstract

Mobile Edge Computing (MEC) has been envisioned as an efficient solution to provide computation-intensive yet latency-sensitive services for wireless devices. In this paper, we investigate the optimal dynamic spectrum allocation-assisted multiuser computation offloading in MEC for overall latency minimization. Specifically, we first focus on a static multiuser computation offloading scenario and jointly optimize users' offloading decisions, transmission durations, and Edge Servers' (ESs) resource allocations. Owing to the nonconvexity of our joint optimization problem, we identify its layered structure and decompose it into two problems: a subproblem and a top problem. For the subproblem, we propose a bisection search-based algorithm to efficiently find the optimal users' offloading decisions and ESs’ resource allocations under a given transmission duration. Second, we use a linear search-based algorithm for solving the top problem to obtain the optimal transmission duration based on the result of the subproblem. Further, after solving the static scenario, we consider a dynamic scenario of multiuser computation offloading with time-varying channels and workload. To efficiently address this dynamic scenario, we propose a deep reinforcement learning-based online algorithm to determine the near-optimal transmission duration in a real-time manner. Numerical results are provided to validate our proposed algorithms for minimizing the overall latency in both static and dynamic offloading scenarios. We also demonstrate the advantages of our proposed algorithms compared to the conventional multiuser computation offloading schemes.

Cite this paper

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

APA 7

Yang, L., Wang, T., Wu, Y., & Jia, W. (2021). Optimal dynamic spectrum allocation-assisted latency minimization for multiuser mobile edge computing. Digital Communications and Networks, 8(3), 247–256. https://doi.org/10.1016/j.dcan.2021.10.008

MLA 9

Yang, Li, et al. “Optimal dynamic spectrum allocation-assisted latency minimization for multiuser mobile edge computing.” Digital Communications and Networks, vol. 8, no. 3, 2021, pp. 247–256. https://doi.org/10.1016/j.dcan.2021.10.008.

Chicago

Yang, Li, Tianshun Wang, Yuan Wu, and Weijia Jia. 2021. “Optimal dynamic spectrum allocation-assisted latency minimization for multiuser mobile edge computing.” Digital Communications and Networks 8 (3): 247–256. https://doi.org/10.1016/j.dcan.2021.10.008.

Harvard

Yang, L. et al. (2021) ‘Optimal dynamic spectrum allocation-assisted latency minimization for multiuser mobile edge computing’, Digital Communications and Networks, 8(3), pp. 247–256. doi:10.1016/j.dcan.2021.10.008.

IEEE

L. Yang, T. Wang, Y. Wu, and W. Jia, “Optimal dynamic spectrum allocation-assisted latency minimization for multiuser mobile edge computing,” Digital Communications and Networks, vol. 8, no. 3, pp. 247–256, 2021, doi: 10.1016/j.dcan.2021.10.008.

BibTeX

@article{yang2021optimal,
  title     = {{Optimal dynamic spectrum allocation-assisted latency minimization for multiuser mobile edge computing}},
  author    = {Yang, Li and Wang, Tianshun and Wu, Yuan and Jia, Weijia},
  journal   = {Digital Communications and Networks},
  year      = {2021},
  volume    = {8},
  number    = {3},
  pages     = {247--256},
  doi       = {10.1016/j.dcan.2021.10.008},
  url       = {https://doi.org/10.1016/j.dcan.2021.10.008}
}

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

Citations by year

YearCitationsShare of the best year
202222
20231111
202422
202555
202611

Its field-weighted citation impact is 1.49: it has been cited 1.49 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
  • computation offloading
  • dynamic spectrum allocation
  • latency reduction
  • time-varying channels
  • deep reinforcement learning

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?

Yang, L., Wang, T., Wu, Y., & Jia, W. (2021). Optimal dynamic spectrum allocation-assisted latency minimization for multiuser mobile edge computing. Digital Communications and Networks, 8(3), 247–256. https://doi.org/10.1016/j.dcan.2021.10.008

How many times has this paper been cited?

21 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 Digital Communications and Networks: sign in and open the PDF from this page.

Who wrote this paper?

Li Yang, Tianshun Wang, Yuan Wu, Weijia Jia.

What is the DOI of this paper?

10.1016/j.dcan.2021.10.008, permanently at https://doi.org/10.1016/j.dcan.2021.10.008. 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.