
Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/19274
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tripathi, Sharda | - |
dc.date.accessioned | 2025-08-30T06:57:32Z | - |
dc.date.available | 2025-08-30T06:57:32Z | - |
dc.date.issued | 2025-06 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/abstract/document/11020752 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/19274 | - |
dc.description.abstract | Recently, Rate-Splitting Multiple Access (RSMA) has emerged as a powerful paradigm for meeting the demanding performance requirements of 6G wireless networks through non-orthogonal high-rate data transmission. However, uplink access in RSMA necessitates optimizing the decoding order, which can lead to significant search latency. Besides, the process overlooks the Quality-of-Service (QoS) constraints of different traffic types, making current RSMA methods inadequate, especially for low-latency communication. Here, we address this issue by proposing QORA, short for QoS-aware One-shot Rate-splitting multiple Access, a multi-agent Deep Q-Network (DQN) framework that leverages a novel QoS-aware transmit power allocation and decoding order policy in uplink RSMA that achieves remarkable performance improvements while maintaining low latency and high admission rates. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | EEE | en_US |
dc.subject | Random access | en_US |
dc.subject | RSMA | en_US |
dc.subject | Uplink power allocation | en_US |
dc.subject | User admission policy | en_US |
dc.subject | Deep learning | en_US |
dc.title | A quality-of-service-centric uplink rate-splitting approach for next-generation multiple access | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Electrical and Electronics 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.