TL;DR
This paper introduces two iterative algorithms for joint channel and power allocation in uplink SCMA networks, optimizing for sum-rate and fairness, and demonstrates their effectiveness and robustness through theoretical analysis and simulations.
Contribution
The paper proposes novel polynomial-time approximation algorithms for joint channel and power allocation in uplink SCMA, addressing NP-hard optimization problems for sum-rate and fairness.
Findings
Max-SR algorithm achieves higher sum-rate than existing methods.
Max-Min algorithm provides superior fairness compared to other algorithms.
Both algorithms show robustness against outdated channel information.
Abstract
In this work, we consider a sparse code multiple access uplink system, where users simultaneously transmit data over subcarriers, such that , with a constraint on the power transmitted by each user. To jointly optimize the subcarrier assignment and the transmitted power per subcarrier, two new iterative algorithms are proposed, the first one aims to maximize the sum-rate (Max-SR) of the network, while the second aims to maximize the fairness (Max-Min). In both cases, the optimization problem is of the mixed-integer nonlinear programming (MINLP) type, with non-convex objective functions, which are generally not tractable. We prove that both joint allocation problems are NP-hard. To address these issues, we employ a variant of the block successive upper-bound minimization (BSUM) \cite{razaviyayn.2013} framework, obtaining polynomial-time approximation algorithms to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
