Skip navigation

Please use this identifier to cite or link to this item: http://10.10.120.238:8080/xmlui/handle/123456789/110
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-30T07:31:15Z-
dc.date.available2023-11-30T07:31:15Z-
dc.date.issued2023-
dc.identifier.isbn978-1665491228-
dc.identifier.issn1525-3511-
dc.identifier.otherEID(2-s2.0-85159789492)-
dc.identifier.urihttps://dx.doi.org/10.1109/WCNC55385.2023.10119096-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/110-
dc.description.abstractNon-orthogonal multiple access (NOMA) has emerged as an enabling solution for 5th generation and beyond networks, but the often-neglected issues due to successive interference cancellation (SIC) based decoding might seriously hamper its performance. In this paper, we study a downlink NOMA system with cooperative half-duplex relaying with imperfect SIC, where the base station is communicating with two untrusted users with the aid of a trusted decode-and-forward relay while also considering the availability of direct links from the source. An optimization problem is formulated for maximizing the secrecy rate of the near user while fulfilling the quality-of-service requirements of the far user. The optimal power allocation solution is derived while considering the impact of SIC error. The simulation results illustrate the exactness of the theoretical analysis alongside insightful discussions to investigate the impact of imperfect SIC. © 2023 IEEE.en_US
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.sourceIEEE Wireless Communications and Networking Conference, WCNCen_US
dc.titleSecrecy Rate Maximization in Relay-Assisted NOMA with Imperfect SICen_US
dc.typeConference Paperen_US
Appears in Collections:Conference Paper

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.