Journal article · 2019 · Open access

Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing

Xianbang Diao, Jianchao Zheng, Yuan Wu, Yueming Cai

IEEE Access, 7, 9243–9257 · Published 1 January 2019 · DOI 10.1109/access.2018.2890559

Open PDFView at the publisherCite this paper

In brief

“Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing” is a 2019 journal article by Xianbang Diao and 3 co-authors, published in IEEE Access. OpenAlex counts 115 citations as of 19 November 2026, which puts it in the top 9% of works published in 2019 by citations. It is open access: the full text is free to read at IEEE Access.

Citations
115
Most cited in
2021 (32)
Field-weighted impact
11.20
References
42
Authors
4

Abstract

Mobile edge computing (MEC) and non-orthogonal multiple access (NOMA) have been considered as the promising techniques to address the explosively growing computation-intensive applications and accomplish the requirement of massive connectivity in the fifth-generation networks. Moreover, since the computing resources of the edge server are limited, the computing load of the edge server needs to be effectively alleviated. In this paper, by exploiting device-to-device (D2D) communication for enabling user collaboration and reducing the edge server's load, we investigate the D2D-assisted and NOMA-based MEC system. In order to minimize the weighted sum of the energy consumption and delay of all users, we jointly optimize the computing resource, power, and channel allocations. Regarding the computing resource allocation, we propose an adaptive algorithm to find the optimal solution. Regarding the power allocation, we present a novel power allocation algorithm based on the particle swarm optimization (PSO) for the single NOMA group comprised of multiple cellular users. Then, for the matching group comprised of a NOMA group and D2D pairs, we theoretically derive the interval of optimal power allocation and propose a PSO-based algorithm to solve it. Regarding the channel allocation, we propose a one-to-one matching algorithm based on the Pareto improvement and swapping operations and extend the one-to-one matching algorithm to a many-to-one matching scenario. Finally, we propose a scheduling-based joint computing resource, power, and channel allocations algorithm to achieve the joint optimization. The simulation results show that the proposed solution can effectively reduce the weighted sum of the energy consumption and delay of all users.

Cite this paper

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

APA 7

Diao, X., Zheng, J., Wu, Y., & Cai, Y. (2019). Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing. IEEE Access, 7, 9243–9257. https://doi.org/10.1109/access.2018.2890559

MLA 9

Diao, Xianbang, et al. “Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing.” IEEE Access, vol. 7, 2019, pp. 9243–9257. https://doi.org/10.1109/access.2018.2890559.

Chicago

Diao, Xianbang, Jianchao Zheng, Yuan Wu, and Yueming Cai. 2019. “Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing.” IEEE Access 7: 9243–9257. https://doi.org/10.1109/access.2018.2890559.

Harvard

Diao, X. et al. (2019) ‘Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing’, IEEE Access, 7, pp. 9243–9257. doi:10.1109/access.2018.2890559.

IEEE

X. Diao, J. Zheng, Y. Wu, and Y. Cai, “Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing,” IEEE Access, vol. 7, pp. 9243–9257, 2019, doi: 10.1109/access.2018.2890559.

BibTeX

@article{diao2019joint,
  title     = {{Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing}},
  author    = {Diao, Xianbang and Zheng, Jianchao and Wu, Yuan and Cai, Yueming},
  journal   = {IEEE Access},
  year      = {2019},
  volume    = {7},
  pages     = {9243--9257},
  doi       = {10.1109/access.2018.2890559},
  url       = {https://doi.org/10.1109/access.2018.2890559}
}

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

Citations by year

YearCitationsShare of the best year
20191313
20202424
20213232
20222020
20231313
202455
202577
202611

Its field-weighted citation impact is 11.20: it has been cited 11.20 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
  • non-orthogonal multiple access
  • device-to-device communication
  • computing resource allocation
  • power allocation
  • channel assignment
  • energy consumption
  • delay reduction

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?

Diao, X., Zheng, J., Wu, Y., & Cai, Y. (2019). Joint Computing Resource, Power, and Channel Allocations for D2D-Assisted and NOMA-Based Mobile Edge Computing. IEEE Access, 7, 9243–9257. https://doi.org/10.1109/access.2018.2890559

How many times has this paper been cited?

115 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 IEEE Access: sign in and open the PDF from this page.

Who wrote this paper?

Xianbang Diao, Jianchao Zheng, Yuan Wu, Yueming Cai.

What is the DOI of this paper?

10.1109/access.2018.2890559, permanently at https://doi.org/10.1109/access.2018.2890559. 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.