Journal article · 2024 · Open access

Maximizing Computation Rate for Sustainable Wireless-Powered MEC Network: An Efficient Dynamic Task Offloading Algorithm with User Assistance

Huaiwen He, Feng Huang, Chenhao Zhou, Hong Shen, Yihong Yang

Mathematics, 12(16), 2478 · Published 10 August 2024 · DOI 10.3390/math12162478

Open full textCite this paper

In brief

“Maximizing Computation Rate for Sustainable Wireless-Powered MEC Network: An Efficient Dynamic Task Offloading Algorithm with User Assistance” is a 2024 journal article by Huaiwen He and 4 co-authors, published in Mathematics. OpenAlex counts 7 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at Mathematics.

Citations
7
Most cited in
2025 (3)
Field-weighted impact
0.77
References
49
Authors
5

Abstract

In the Internet of Things (IoT) era, Mobile Edge Computing (MEC) significantly enhances the efficiency of smart devices but is limited by battery life issues. Wireless Power Transfer (WPT) addresses this issue by providing a stable energy supply. However, effectively managing overall energy consumption remains a critical and under-addressed aspect for ensuring the network’s sustainable operation and growth. In this paper, we consider a WPT-MEC network with user cooperation to migrate the double near–far effect for the mobile node (MD) far from the base station. We formulate the problem of maximizing long-term computation rates under a power consumption constraint as a multi-stage stochastic optimization (MSSO) problem. This approach is tailored for a sustainable WPT-MEC network, considering the dynamic and varying MEC network environment, including randomness in task arrivals and fluctuating channels. We introduce a virtual queue to transform the time-average energy constraint into a queue stability problem. Using the Lyapunov optimization technique, we decouple the stochastic optimization problem into a deterministic problem for each time slot, which can be further transformed into a convex problem and solved efficiently. Our proposed algorithm works efficiently online without requiring further system information. Extensive simulation results demonstrate that our proposed algorithm outperforms baseline schemes, achieving approximately 4% enhancement while maintain the queues stability. Rigorous mathematical analysis and experimental results show that our algorithm achieves O(1/V),O(V) trade-off between computation rate and queue stability.

Cite this paper

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

APA 7

He, H., Huang, F., Zhou, C., Shen, H., & Yang, Y. (2024). Maximizing Computation Rate for Sustainable Wireless-Powered MEC Network: An Efficient Dynamic Task Offloading Algorithm with User Assistance. Mathematics, 12(16), 2478. https://doi.org/10.3390/math12162478

MLA 9

He, Huaiwen, et al. “Maximizing Computation Rate for Sustainable Wireless-Powered MEC Network: An Efficient Dynamic Task Offloading Algorithm with User Assistance.” Mathematics, vol. 12, no. 16, 2024, p. 2478. https://doi.org/10.3390/math12162478.

Chicago

He, Huaiwen, Feng Huang, Chenhao Zhou, Hong Shen, and Yihong Yang. 2024. “Maximizing Computation Rate for Sustainable Wireless-Powered MEC Network: An Efficient Dynamic Task Offloading Algorithm with User Assistance.” Mathematics 12 (16): 2478. https://doi.org/10.3390/math12162478.

Harvard

He, H. et al. (2024) ‘Maximizing Computation Rate for Sustainable Wireless-Powered MEC Network: An Efficient Dynamic Task Offloading Algorithm with User Assistance’, Mathematics, 12(16), p. 2478. doi:10.3390/math12162478.

IEEE

H. He, F. Huang, C. Zhou, H. Shen, and Y. Yang, “Maximizing Computation Rate for Sustainable Wireless-Powered MEC Network: An Efficient Dynamic Task Offloading Algorithm with User Assistance,” Mathematics, vol. 12, no. 16, p. 2478, 2024, doi: 10.3390/math12162478.

BibTeX

@article{he2024maximizing,
  title     = {{Maximizing Computation Rate for Sustainable Wireless-Powered MEC Network: An Efficient Dynamic Task Offloading Algorithm with User Assistance}},
  author    = {He, Huaiwen and Huang, Feng and Zhou, Chenhao and Shen, Hong and Yang, Yihong},
  journal   = {Mathematics},
  year      = {2024},
  volume    = {12},
  number    = {16},
  pages     = {2478},
  doi       = {10.3390/math12162478},
  url       = {https://doi.org/10.3390/math12162478}
}

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

Citations by year

YearCitationsShare of the best year
202422
202533
202622

Its field-weighted citation impact is 0.77: it has been cited 0.77 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

  • wireless power transfer
  • mobile edge computing
  • computation rate maximization
  • dynamic task offloading
  • user cooperation
  • near-far effect
  • multistage stochastic programming
  • Lyapunov optimization

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?

He, H., Huang, F., Zhou, C., Shen, H., & Yang, Y. (2024). Maximizing Computation Rate for Sustainable Wireless-Powered MEC Network: An Efficient Dynamic Task Offloading Algorithm with User Assistance. Mathematics, 12(16), 2478. https://doi.org/10.3390/math12162478

How many times has this paper been cited?

7 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 Mathematics: sign in and open the full text from this page.

Who wrote this paper?

Huaiwen He, Feng Huang, Chenhao Zhou, Hong Shen, Yihong Yang.

What is the DOI of this paper?

10.3390/math12162478, permanently at https://doi.org/10.3390/math12162478. 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.