Abstract | ||
---|---|---|
The non-orthogonal multiple access (NOMA) has been investigated recently as a candidate radio access technology for future wireless networks. This paper focuses on the proportional fair scheduling (PFS) for downlink single-carrier NOMA systems. Assuming an ideal NOMA system with an arbitrary number of multiplexed users, we derive a closed-form solution of the optimal power allocation for PFS. Based on this solution, we design a low-complexity algorithm for joint power allocation and user set selection (USS). Its performance is an upper bound for various PFS schemes in practical NOMA systems where the number of multiplexed users is limited. We utilize this algorithm to pre-select the candidate users and propose a pre-selection-based USS (PSU) scheme. The performance of the PSU scheme and various existing PFS schemes in the literature is evaluated by simulations and compared with the upper bound obtained in the ideal NOMA system. The proposed PSU scheme achieves the optimal performance that is close to the upper bound. Moreover, its computational complexity is significantly reduced and is nearly linear in the number of users. |
Year | Venue | Keywords |
---|---|---|
2017 | IEEE Global Communications Conference | Non-orthogonal multiple access,power allocation,user set selection,proportional fair scheduling |
Field | DocType | ISSN |
Wireless network,Noma,Mathematical optimization,Algorithm design,Upper and lower bounds,Computer science,Scheduling (computing),Computer network,Radio access technology,Proportionally fair,Telecommunications link | Conference | 2334-0983 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Fei Liu | 1 | 41 | 5.78 |
Marina Petrova | 2 | 32 | 5.32 |