2019
DOI: 10.1109/twc.2019.2939820
|View full text |Cite
|
Sign up to set email alerts
|

Fairness and Sum-Rate Maximization via Joint Subcarrier and Power Allocation in Uplink SCMA Transmission

Abstract: In this work, we consider a sparse code multiple access uplink system, where J users simultaneously transmit data over K subcarriers, such that J > K, 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… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 39 publications
(27 citation statements)
references
References 35 publications
0
27
0
Order By: Relevance
“…P k ij is a continuous variable whereas x k ij is a binary variable. Our objective function is a non-convex function jointly as well as individually with respect to each variable [33] and hence it is an NP hard problem and is hard to solve in polynomial time. Owing to the complexity of the problem, we propose a heuristic algorithm to solve the joint problem in polynomial time.…”
Section: Cooperation In Small-cell Bssmentioning
confidence: 99%
See 1 more Smart Citation
“…P k ij is a continuous variable whereas x k ij is a binary variable. Our objective function is a non-convex function jointly as well as individually with respect to each variable [33] and hence it is an NP hard problem and is hard to solve in polynomial time. Owing to the complexity of the problem, we propose a heuristic algorithm to solve the joint problem in polynomial time.…”
Section: Cooperation In Small-cell Bssmentioning
confidence: 99%
“…R U ij is continuous variable, it can take any value in between 0 and maximum leftover capacity, P k ij is also continuous variable and it can take any value between 0 and P max whereas x k ij and z ij are the binary variables. Constraints are also non-convex along with the objective function [33]. As this problem is also NP hard, we propose a heuristic to solve this problem also.…”
mentioning
confidence: 99%
“…A sub-optimal algorithm that handles power and codebook assignment separately is then proposed. Efforts to maximize sum-rate and fairness in uplink SCMA using joint channel and power are illustrated in [32]. Iterative algorithms that jointly allocate codebooks and transmit power in subcarriers are implemented with convex programming used to optimize performance.…”
Section: Related Workmentioning
confidence: 99%
“…To evaluate the fairness of the algorithms in distributing resources among users in the network, Jain's fairness metric is embraced. It is defined as in [32] which can be expressed as This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.…”
Section: Figure 6: Energy Efficiency Vs Number Of Iterationsmentioning
confidence: 99%
“…However, the SIC technique may suffer from the error propagation phenomenon when the received powers are similar [17]. The power allocation process is usually performed in a centralized manner [18,19] where the base station knows the channel state information of all users. For grant free access, each user performs a blind transmission with no information about its propagation environment and interfering users, which makes the power determination more complex.…”
Section: Introductionmentioning
confidence: 99%