http://10.10.120.238:8080/xmlui/handle/123456789/376
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Amin I. | en_US |
dc.contributor.author | Mishra D. | en_US |
dc.contributor.author | Saini R. | en_US |
dc.contributor.author | Aïssa S. | en_US |
dc.date.accessioned | 2023-11-30T08:30:42Z | - |
dc.date.available | 2023-11-30T08:30:42Z | - |
dc.date.issued | 2022 | - |
dc.identifier.issn | 1089-7798 | - |
dc.identifier.other | EID(2-s2.0-85118635015) | - |
dc.identifier.uri | https://dx.doi.org/10.1109/LCOMM.2021.3124902 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/376 | - |
dc.description.abstract | This letter considers a trusted decode-and-forward relay-assisted two-user non-orthogonal multiple access (NOMA) communication system, and tackles the secure rate maximization problem at the near user. The problem is solved optimally using KKT conditions, while satisfying the quality of service (QoS) requirements of the far user. Particularly, closed-form expressions for the power sharing between the source and the relay, and the power allocation coefficients corresponding to power-domain NOMA for both users are obtained. An upper-bound on the threshold rate of the far user is also derived, which indicates the best QoS that can be ensured. Numerical results showed that the relay-user link acts as the bottleneck and provide design insights on optimal power allocation satisfying the tradeoff between the rate secrecy at the near user and the QoS requirements of the far user. © 1997-2012 IEEE. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.source | IEEE Communications Letters | en_US |
dc.subject | NOMA | en_US |
dc.subject | relaying | en_US |
dc.subject | secrecy rate | en_US |
dc.subject | untrusted users | en_US |
dc.title | QoS-Aware Secrecy Rate Maximization in Untrusted NOMA with Trusted Relay | en_US |
dc.type | Journal Article | en_US |
Appears in Collections: | Journal Article |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.