PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 29, 2026Computers0 citationsOpen Access

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

View Full Paper
HHHuaiwen HeMLM J LiuCZChenghao Zhou

Key Points

  • The study aims to maximize throughput utility in a NOMA-enabled WPT-MEC network while ensuring queue stability.
  • Formulated a stochastic optimization problem for utility maximization
  • Utilized Lyapunov optimization framework to decompose problems into online convex subproblems
  • Developed the DUCTM algorithm for adaptive resource allocation and computation offloading
  • DUCTM algorithm outperformed baseline methods in throughput optimization under various conditions
  • Provided stable performance even with bursty traffic
  • Achieved a provable trade-off between utility optimality and queue backlog with O(1/V), O(V) analysis.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

He et al. (2026) studied this question.

synapsesocial.com/papers/6a192e95fab5b468c4417b6ehttps://doi.org/10.3390/computers15060344
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Energy-Efficiency Maximization for Relay-Aided Wireless-Powered Mobile Edge Computing2024 · 18 citations
  2. 2Wireless Energy Harvesting with Cooperative Relaying under the Best Relay Selection Scheme2019 · 26 citations
  3. 3Joint Differential Game and Double Deep Q-Networks for Suppressing Malware Spread in Industrial Internet of Things2023 · 114 citations
  4. 4Resource Allocation in Cooperative NOMA: Opportunities and Challenges2024 · 3 citations
  5. 5Profit Maximization of Independent Task Offloading in MEC-Enabled 5G Internet of Vehicles2024 · 121 citations