Skip to content
naulon
Not checkedNot checked for notices yet.

Outage-Constrained Resource Allocation in Uplink NOMA for Critical Applications

Daniel Tweed, Mahsa Derakhshani, Saeedeh Parsaeefard and 1 more

IEEE Access · 2017

doi:10.1109/access.2017.2777601 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

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.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.