Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2018
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/1805.11722 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914995127713792 |
|---|---|
| author | Evangelista, Joao V. C. Sattar, Zeeshan Kaddoum, Georges Chaaban, Anas |
| author_facet | Evangelista, Joao V. C. Sattar, Zeeshan Kaddoum, Georges Chaaban, Anas |
| contents | 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 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 original problem. Moreover, we evaluate the algorithms' robustness against outdated channel state information (CSI), present an analysis of the convergence of the algorithms, and a comparison of the sum-rate and Jain's fairness index of the novel algorithms with three other algorithms proposed in the literature. The Max-SR algorithm outperforms the others in the sum-rate sense, while the Max-Min outperforms them in the fairness sense. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1805_11722 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Fairness and Sum-Rate Maximization via Joint Channel and Power Allocation in Uplink SCMA Networks Evangelista, Joao V. C. Sattar, Zeeshan Kaddoum, Georges Chaaban, Anas Information Theory 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 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 original problem. Moreover, we evaluate the algorithms' robustness against outdated channel state information (CSI), present an analysis of the convergence of the algorithms, and a comparison of the sum-rate and Jain's fairness index of the novel algorithms with three other algorithms proposed in the literature. The Max-SR algorithm outperforms the others in the sum-rate sense, while the Max-Min outperforms them in the fairness sense. |
| title | Fairness and Sum-Rate Maximization via Joint Channel and Power Allocation in Uplink SCMA Networks |
| topic | Information Theory |
| url | https://arxiv.org/abs/1805.11722 |