Skip navigation

Please use this identifier to cite or link to this item: http://10.10.120.238:8080/xmlui/handle/123456789/376
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAmin I.en_US
dc.contributor.authorMishra D.en_US
dc.contributor.authorSaini R.en_US
dc.contributor.authorAïssa S.en_US
dc.date.accessioned2023-11-30T08:30:42Z-
dc.date.available2023-11-30T08:30:42Z-
dc.date.issued2022-
dc.identifier.issn1089-7798-
dc.identifier.otherEID(2-s2.0-85118635015)-
dc.identifier.urihttps://dx.doi.org/10.1109/LCOMM.2021.3124902-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/376-
dc.description.abstractThis 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.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.sourceIEEE Communications Lettersen_US
dc.subjectNOMAen_US
dc.subjectrelayingen_US
dc.subjectsecrecy rateen_US
dc.subjectuntrusted usersen_US
dc.titleQoS-Aware Secrecy Rate Maximization in Untrusted NOMA with Trusted Relayen_US
dc.typeJournal Articleen_US
Appears in Collections:Journal Article

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.