File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TWC.2017.2716921
- Scopus: eid_2-s2.0-85021828753
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Spectrum Allocation and Power Control for Non-Orthogonal Multiple Access in HetNets
Title | Spectrum Allocation and Power Control for Non-Orthogonal Multiple Access in HetNets |
---|---|
Authors | |
Keywords | Fairness heterogeneous networks (HetNets) matching game non-orthogonal multiple access (NOMA) sequential convex programming sum rate |
Issue Date | 2017 |
Citation | IEEE Transactions on Wireless Communications, 2017, v. 16, n. 9, p. 5825-5837 How to Cite? |
Abstract | In this paper, a novel resource allocation design is investigated for non-orthogonal multiple access (NOMA) enhanced heterogeneous networks (HetNets), where small cell base stations (SBSs) are capable of communicating with multiple small cell users (SCUs) via the NOMA protocol. With the aim of maximizing the sum rate of SCUs while taking the fairness issue into consideration, a joint problem of spectrum allocation and power control is formulated. In particular, the spectrum allocation problem is modeled as a many-to-one matching game with peer effects. We propose a novel algorithm where the SBSs and resource blocks interact to decide their desired allocation. The proposed algorithm is proved to converge to a two-sided exchange-stable matching. Furthermore, we introduce the concept of 'exploration' into the matching game for further improving the SCUs' sum rate. The power control of each SBS is formulated as a non-convex problem, where the sequential convex programming is adopted to iteratively update the power allocation result by solving the approximate convex problem. The obtained solution is proved to satisfy the Karush-Kuhn-Tucker conditions. We unveil that: 1) the proposed algorithm closely approaches the optimal solution within a limited number of iterations; 2) the 'exploration' action is capable of further enhancing the performance of the matching algorithm; and 3) the developed NOMA-enhanced HetNets achieve a higher SCUs' sum rate compared with the conventional OMA-based HetNets. |
Persistent Identifier | http://hdl.handle.net/10722/349184 |
ISSN | 2023 Impact Factor: 8.9 2023 SCImago Journal Rankings: 5.371 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhao, Jingjing | - |
dc.contributor.author | Liu, Yuanwei | - |
dc.contributor.author | Chai, Kok Keong | - |
dc.contributor.author | Nallanathan, Arumugam | - |
dc.contributor.author | Chen, Yue | - |
dc.contributor.author | Han, Zhu | - |
dc.date.accessioned | 2024-10-17T06:56:49Z | - |
dc.date.available | 2024-10-17T06:56:49Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | IEEE Transactions on Wireless Communications, 2017, v. 16, n. 9, p. 5825-5837 | - |
dc.identifier.issn | 1536-1276 | - |
dc.identifier.uri | http://hdl.handle.net/10722/349184 | - |
dc.description.abstract | In this paper, a novel resource allocation design is investigated for non-orthogonal multiple access (NOMA) enhanced heterogeneous networks (HetNets), where small cell base stations (SBSs) are capable of communicating with multiple small cell users (SCUs) via the NOMA protocol. With the aim of maximizing the sum rate of SCUs while taking the fairness issue into consideration, a joint problem of spectrum allocation and power control is formulated. In particular, the spectrum allocation problem is modeled as a many-to-one matching game with peer effects. We propose a novel algorithm where the SBSs and resource blocks interact to decide their desired allocation. The proposed algorithm is proved to converge to a two-sided exchange-stable matching. Furthermore, we introduce the concept of 'exploration' into the matching game for further improving the SCUs' sum rate. The power control of each SBS is formulated as a non-convex problem, where the sequential convex programming is adopted to iteratively update the power allocation result by solving the approximate convex problem. The obtained solution is proved to satisfy the Karush-Kuhn-Tucker conditions. We unveil that: 1) the proposed algorithm closely approaches the optimal solution within a limited number of iterations; 2) the 'exploration' action is capable of further enhancing the performance of the matching algorithm; and 3) the developed NOMA-enhanced HetNets achieve a higher SCUs' sum rate compared with the conventional OMA-based HetNets. | - |
dc.language | eng | - |
dc.relation.ispartof | IEEE Transactions on Wireless Communications | - |
dc.subject | Fairness | - |
dc.subject | heterogeneous networks (HetNets) | - |
dc.subject | matching game | - |
dc.subject | non-orthogonal multiple access (NOMA) | - |
dc.subject | sequential convex programming | - |
dc.subject | sum rate | - |
dc.title | Spectrum Allocation and Power Control for Non-Orthogonal Multiple Access in HetNets | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/TWC.2017.2716921 | - |
dc.identifier.scopus | eid_2-s2.0-85021828753 | - |
dc.identifier.volume | 16 | - |
dc.identifier.issue | 9 | - |
dc.identifier.spage | 5825 | - |
dc.identifier.epage | 5837 | - |