Skip to content

Utility-Aware Resource Allocation for Hybrid NOMA in MEC: A Matching-Coalition Game Approach

Sep 2026 · IEEE Transactions on Mobile Computing · Vol 25, pp. 13472-13489 · 0 citations · 43 references

Abstract

The massive influx of uplink task offloading in Multi-access Edge Computing (MEC) systems poses a significant challenge to the capacity of wireless networks. This challenge highlights a fundamental trade-off between Orthogonal Multiple Access (OMA), which provides interference-free but spectrally inefficient communication, and Non-Orthogonal Multiple Access (NOMA), which enhances capacity at the cost of significant inter-user interference. To navigate this trade-off, we introduce a novel Hybrid NOMA (H-NOMA) framework that offers differentiated communication services. The framework allows users to choose between premium OMA channels for latency-sensitive tasks and shared NOMA channels for others, creating an economy where performance can be traded for cost. Within this framework, we formulate the resource allocation problem with the objective of maximizing the total system utility, defined as the sum of all individual user utilities, under budget, computation, and communication constraints. To solve this NP-hard problem, we devise a novel multi-stage game-theoretic algorithm, the Matching-Coalition Game with Coordinate Descent (MCGCD). Our approach synergistically combines matching theory for a fast and initial channel assignment, a cooperative coalition game to refine allocations by explicitly managing NOMA externalities, and a coordinate-descent-based algorithm for optimal power control. Extensive simulations demonstrate that our proposed algorithm significantly outperforms benchmark methods in improving system utility, reducing average task completion latency, and increasing the number of admitted tasks.

View source

Similar papers

Jul 2026

Joint power and channel resource allocation in NOMA-based 5G/6G wireless networks

Non-orthogonal multiple access (NOMA) is a kind of 5G and 6G radio access technology, which not only enhances spectrum efficiency but also enables several users at the same time to access the network and share the same frequency resource. This paper studies the problem of jointly optimizing power allocation and channel resource assignment in the downlink multi-carrier NOMA system, with the aim of maximizing the weighted sum rate under individual quality-of-service (QoS) constraints, per-user minimum rate requirements, and total transmit power budget. We cast the problem as a mixed-integer non-linear programming (MINLP) task and decompose it into two tractable subproblems: A low-complexity channel allocation step using a bipartite matching framework, followed by an successive convex approximation (SCA) solution to the power control step with Lagrangian duality. A closed-form expression for the optimal power ratio under fixed channel assignment is derived to achieve efficient iteration between the two stages. To further reduce the computational burden for dense deployment of the network, we combined the iterative scheme with a DRL module based on the deep deterministic policy gradient (DDPG) algorithm to enable the system to respond to changes in channel state without having to solve the optimization problem at each time slot. Simulation results show that when deployed in a 3GPP-compliant urban macro-cell environment, the proposed joint scheme can achieve 38 percent more sum throughput than orthogonal frequency-division multiple access (OFDMA) baselines, a 22 percent increase over fixed NOMA power allocation, and converges within 15 iterations under moderate user density. The energy efficiency gain is 3.62 bits/J/Hz when combining the DRL-based dynamic policy, and the practical feasibility of the proposed framework for next-generation network deployment is verified.

Yuming Fu, Xiaofeng Chang, Wanze Gan · 0 citations
Open access Jul 2026

Generalised Potential Game-Based Resource Allocation in SDN-Enabled O-RAN Systems

This formulation provides a rigorous and tractable framework for distributed spectrum sharing in 6G O-RAN systems, with the potential to support intelligent and adaptive control in future wireless networks.

E. Spyrou, Chrysostomos D. Stylios, V. Kappatos et al. · 0 citations
Open access Aug 2026

Delay–Energy-Aware Partial Offloading and Coupled Resource Allocation in Hybrid NOMA-MEC Networks: Derivations and Reproducible Evaluation

This paper considers priority-aware partial computation offloading in an uplink mobile edge computing (MEC) network. Devices assigned to different groups occupy orthogonal subbands, whereas devices within each group use power-domain non-orthogonal multiple access (NOMA) with successive interference cancellation. Task-input size determines the transmitted and processed workload, while queue backlog and application urgency determine the service weight. The Gaussian multiple-access-channel rate region is convex, but the complete allocation problem is not jointly convex in the adopted variables because the offloaded workload is coupled with reciprocal transmission rate and reciprocal edge-CPU allocation. A structure-exploiting block-coordinate projected-gradient method is developed. It combines exact finite-candidate offloading updates, an exact edge-CPU allocation bounded below by deadline feasibility and above by local-path saturation, and an analytical projected power step with Armijo backtracking. For eight users at 23 dBm, pairwise group-based NOMA reduces the weighted delay–energy cost and device energy by 6.18% and 23.44%, respectively, relative to orthogonal access. Queue-aware weighting reduces upper-backlog-quartile delay by 2.69 ms (95% confidence half-width: 0.78 ms) while increasing lower-quartile delay by 8.34 ms (half-width: 2.07 ms). In a paired 15-iteration ablation, generic projected block-coordinate updates have a cost ratio of 1.0098 (half-width: 0.0086) relative to the structured method. A hybrid deep deterministic policy-gradient policy, evaluated over five training seeds, has an 11.77% higher cost while requiring 0.84% of the median online decision time. Of 432 allocations, 392 satisfy the residual-qualified stopping tests and 40 are explicitly reported as iteration-safeguard terminations.

Jamil K. J. Bataineh, Ahlam Jawarneh, K. Hayajneh et al. · 0 citations
Conference Jul 2026

Guaranteed Interference and Minimum-Allocation Constraints with Throughput Maximization for Local 5G Scheduling via ILP

Co-channel interference (CCI) management through inter-system consensus, where CCI is kept below a predetermined threshold, has been studied as an approach to proactive spectrum sharing among multiple local 5G systems. In our prior work, we established a resource allocation method that exploits the fact that CCI varies depending on user equipment (UE) positions when beamforming is steered to track each UE. However, the previous study did not incorporate a mechanism to guarantee compliance with interference constraints that keep CCI below a specified level. Moreover, since frequency access opportunities for individual UEs were not guaranteed, there was a concern that some UEs could be left without any allocated resources. In this paper, we formulate the mobility-prediction-based resource allocation as a 0-1 integer linear program (ILP) and introduce both an interference constraint and a minimum allocation constraint as hard constraints. The proposed method is positioned as a hard-constraint scheduler that prioritizes interference compliance and prevention of zero-allocation UEs, while the remaining degrees of freedom are used for SNR-based throughput maximization. The effectiveness and throughput–fairness tradeoff of the proposed method are demonstrated through computer simulations.

Haruka Sakamoto, Osamu Takyu, Kohei Akimoto · 0 citations
Open access 2026

QoS-Aware Power Allocation in Mixed-Numerology NOMA

Results indicate that the proposed AO-SCA framework provides an effective and practical solution for fairness-aware power allocation in downlink MN-NOMA systems, and provides a balanced fairness-efficiency tradeoff.

Sudhir Kumar Dhotre, S. Nalbalwar, A. Nandgaonkar · 0 citations
Open access 2026

Cooperative Task Offloading in Mobile Edge Computing via an Improved MASAC Framework

An adaptive Beta-policy and delayed-update multi-agent soft actor-critic method, abbreviated as ABDMASAC, which uses a Beta policy to model bounded actions and achieves a better overall trade-off than the selected MASAC-backbone and on-policy MARL baselines under the considered simulation settings.

Zheng Yao, Jie Liu, Changjun Deng et al. · 0 citations

Related blog posts

Microsoft Research Blog Aug 31, 2026

GigaPath-Flash and GigaTIME-Flash: Toward population-scale discovery with efficient pathology foundation models

What if pathology foundation models could do more with less? GigaPath-Flash and GigaTIME-Flash cut computational demands while maintaining strong performance, opening the door to larger studies and broader exploration. The post GigaPath-Flash and GigaTIME-Flash: Toward population-scale discovery with efficient pathology foundation models appeared first on Microsoft Research.

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.