Outage-Constrained Resource Allocation in Uplink NOMA for Critical Applications
Bibliographic record
Abstract
In this paper, we consider the resource allocation problem for uplink non-orthogonal multiple access (NOMA) networks whose users represent power-restricted but high priority devices, such as those used in sensor networks supporting health and public safety applications. Such systems require high reliability and robust resource allocation techniques are needed to ensure performance. We examine the impact on system and user performance due to residual cancellation errors resulting from imperfect successive interference cancellation (SIC) and apply the chance-constrained robust optimization approach to tackle this type of error. In particular, we derive an expression for the user outage probability as a function of SIC error variance. This result is used to formulate a robust joint resource allocation problem that minimizes user transmit power subject to rate and outage constraints of critical applications. As the proposed optimization problem is inherently non-convex and NP-hard, we apply the techniques of variable relaxation and complementary geometric programming to develop a computationally tractable two-step iterative algorithm based on successive convex approximation. Simulation results demonstrate that, even for high levels of SIC error, the proposed robust algorithm for NOMA outperforms the traditional orthogonal multiple access case in terms of user transmit power and overall system density, i.e., serving more users over fewer sub-carriers. The chance-constrained approach necessitates a power-robustness tradeoff compared with non-robust NOMA but effectively enforces maximum user outage and can result in transmit power savings when users can accept a higher probability of outage.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".