Please use this identifier to cite or link to this item:
https://dspace.iiti.ac.in/handle/123456789/11433
Title: | α-Fairness based User Pairing for Downlink NOMA Systems with Imperfect SIC |
Authors: | Upadhyay, Prabhat Kumar |
Keywords: | Computational complexity;Energy efficiency;Multiple access interference;Fairness;Imperfect successive interference can-cellation;Low bound;Multiple access;Multiple access systems;Non-orthogonal;Non-orthogonal multiple access;Power allocations;Spectral efficiencies;Successive interferences;Spectrum efficiency |
Issue Date: | 2022 |
Publisher: | Institute of Electrical and Electronics Engineers Inc. |
Citation: | Mouni, N. S., Reddy, P. M., Kumar, A., & Upadhyay, P. K. (2022). α-Fairness based user pairing for downlink NOMA systems with imperfect SIC. Paper presented at the 2022 IEEE Global Communications Conference, GLOBECOM 2022 - Proceedings, 1679-1684. doi:10.1109/GLOBECOM48099.2022.10001663 Retrieved from www.scopus.com |
Abstract: | Non-orthogonal multiple access (NOMA) is consid-ered as one of the predominant multiple access techniques for next-generation cellular networks. We consider a 2-user pair downlink NOMA system with imperfect successive interference cancellation (SIC). We consider bounds on the power allocation factors and then formulate the power allocation as an optimization problem to achieve α-Fairness among the paired users. We show that α-Fairness based power allocation factor coincides with lower bound on power allocation factor in case of perfect SIC and alpha > 2. Further, as long as the proposed criterion is satisfied, it converges to the upper bound with increasing imperfection in SIC. Similarly, we show that for 0 < alpha < 1, the optimal power allocation factor coincides with the derived lower bound on power allocation. Based on these observations, we then propose a low complexity sub-optimal algorithm. Through extensive simulations, we analyze the performance of the proposed algorithm and compare it against the state-of-the-art algorithms. We show that the proposed optimal and sub-optimal algorithms ensure that each user achieves a rate at least equivalent to its orthogonal multiple access counterparts. Further, we also show significant improvements in terms of fairness with the proposed algorithm as compared to the state-of-the-art algorithms. © 2022 IEEE. |
URI: | https://doi.org/10.1109/GLOBECOM48099.2022.10001663 https://dspace.iiti.ac.in/handle/123456789/11433 |
ISBN: | 978-1665435406 |
Type of Material: | Conference Paper |
Appears in Collections: | Department of Electrical Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Altmetric Badge: