DUCTM: An Online Resource Allocation Algorithm for Throughput Maximization in Cooperative NOMA-Enabled WPT-MEC Networks

This paper addresses the problem of throughput utility maximization in a non-orthogonal multiple access (NOMA)-enabled wireless power transfer mobile edge computing (WPT-MEC) network with dynamic task arrivals and user cooperation. To promote fairness and effectively handle random task arrivals and time-varying channels, we model the system utility as a nonlinear function of time-averaged throughput. We then formulate a stochastic optimization problem aimed at maximizing utility while strictly maintaining sensor queue stability. By leveraging the Lyapunov optimization framework, the long-term network-wide utility maximization is decomposed into efficient, slot-wise convex subproblems that operate online without requiring prior knowledge of future task arrivals or channel states. We develop a Dynamic User Cooperation Throughput Maximization (DUCTM) algorithm that enables adaptive resource allocation and cooperative computation offloading in an online manner. Theoretical analysis establishes a provable [O(1/V),O(V)] trade-off between utility optimality and queue backlog. Extensive simulations demonstrate that our approach consistently outperforms baseline methods, providing robust and stable performance even under bursty traffic and highly dynamic environmental conditions.

Authors

Institutions

Publication Details

Journal
Computers
Published
2026-05-27
DOI
https://doi.org/10.3390/computers15060344
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DUCTM: An Online Resource Allocation Algorithm for Throughput Maximization in Cooperative NOMA-Enabled WPT-MEC Networks

M J Liu, Chenghao Zhou, Hong Shen, Hui Tian et al.
Computers
IoT and Edge/Fog Computing
article

DUCTM: An Online Resource Allocation Algorithm for Throughput Maximization in Cooperative NOMA-Enabled WPT-MEC Networks

M J Liu, Chenghao Zhou, Hong Shen, Hui Tian, Huaiwen He, Shuqing Huang
article en

Abstract

This paper addresses the problem of throughput utility maximization in a non-orthogonal multiple access (NOMA)-enabled wireless power transfer mobile edge computing (WPT-MEC) network with dynamic task arrivals and user cooperation. To promote fairness and effectively handle random task arrivals and time-varying channels, we model the system utility as a nonlinear function of time-averaged throughput. We then formulate a stochastic optimization problem aimed at maximizing utility while strictly maintaining sensor queue stability. By leveraging the Lyapunov optimization framework, the long-term network-wide utility maximization is decomposed into efficient, slot-wise convex subproblems that operate online without requiring prior knowledge of future task arrivals or channel states. We develop a Dynamic User Cooperation Throughput Maximization (DUCTM) algorithm that enables adaptive resource allocation and cooperative computation offloading in an online manner. Theoretical analysis establishes a provable [O(1/V),O(V)] trade-off between utility optimality and queue backlog. Extensive simulations demonstrate that our approach consistently outperforms baseline methods, providing robust and stable performance even under bursty traffic and highly dynamic environmental conditions.

ComputersVol. 15(6)
Griffith University (AU), University of Electronic Science and Technology of China (CN), Guangxi Agricultural Machinery Research Institute (CN), Central Queensland University (AU)
Queensland Government
Openalex Percentile: Top 4%
IoT and Edge/Fog Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.