File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC45041.2023.10278912
- Scopus: eid_2-s2.0-85178262843
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Adaptive NGMA Scheme for IoT Networks: A Deep Reinforcement Learning Approach
Title | Adaptive NGMA Scheme for IoT Networks: A Deep Reinforcement Learning Approach |
---|---|
Authors | |
Issue Date | 2023 |
Citation | IEEE International Conference on Communications, 2023, v. 2023-May, p. 991-996 How to Cite? |
Abstract | An adaptive next generation multiple access (NGMA) downlink scheme is provided, where non-orthogonal multiple access (NOMA) and space division multiple access (SDMA) users are served with the same orthogonal time and frequency resource to address the energy constraints and massive connectivity issues of Internet-of-Things networks. Based on this scheme, the long-term power-constrained sum rate maximization problem is investigated, where beamforming, power allocation, and user clustering are jointly optimized, subject to a long-term total power constraint. To solve the formulated problem, a spatial correlation-based user clustering approach is proposed and a resource allocation algorithm is designed based on the trust region policy optimization (TRPO) algorithm, which demonstrates stable convergence under large learning rates. Numerical results verify that the sum rate of the proposed NGMA scheme outperforms the conventional NOMA and SDMA schemes. Moreover, the spatial correlation-based clustering algorithm achieves an increasing sum rate gain compared to the channel correlation-based baseline algorithm as the spatial correlation in the channel model increases. |
Persistent Identifier | http://hdl.handle.net/10722/349999 |
ISSN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zou, Yixuan | - |
dc.contributor.author | Yi, Wenqiang | - |
dc.contributor.author | Xu, Xiaodong | - |
dc.contributor.author | Liu, Yue | - |
dc.contributor.author | Chai, Kok Keong | - |
dc.contributor.author | Liu, Yuanwei | - |
dc.date.accessioned | 2024-10-17T07:02:23Z | - |
dc.date.available | 2024-10-17T07:02:23Z | - |
dc.date.issued | 2023 | - |
dc.identifier.citation | IEEE International Conference on Communications, 2023, v. 2023-May, p. 991-996 | - |
dc.identifier.issn | 1550-3607 | - |
dc.identifier.uri | http://hdl.handle.net/10722/349999 | - |
dc.description.abstract | An adaptive next generation multiple access (NGMA) downlink scheme is provided, where non-orthogonal multiple access (NOMA) and space division multiple access (SDMA) users are served with the same orthogonal time and frequency resource to address the energy constraints and massive connectivity issues of Internet-of-Things networks. Based on this scheme, the long-term power-constrained sum rate maximization problem is investigated, where beamforming, power allocation, and user clustering are jointly optimized, subject to a long-term total power constraint. To solve the formulated problem, a spatial correlation-based user clustering approach is proposed and a resource allocation algorithm is designed based on the trust region policy optimization (TRPO) algorithm, which demonstrates stable convergence under large learning rates. Numerical results verify that the sum rate of the proposed NGMA scheme outperforms the conventional NOMA and SDMA schemes. Moreover, the spatial correlation-based clustering algorithm achieves an increasing sum rate gain compared to the channel correlation-based baseline algorithm as the spatial correlation in the channel model increases. | - |
dc.language | eng | - |
dc.relation.ispartof | IEEE International Conference on Communications | - |
dc.title | Adaptive NGMA Scheme for IoT Networks: A Deep Reinforcement Learning Approach | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICC45041.2023.10278912 | - |
dc.identifier.scopus | eid_2-s2.0-85178262843 | - |
dc.identifier.volume | 2023-May | - |
dc.identifier.spage | 991 | - |
dc.identifier.epage | 996 | - |