Skip navigation

Please use this identifier to cite or link to this item: http://10.10.120.238:8080/xmlui/handle/123456789/111
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.authorSingh V.en_US
dc.date.accessioned2023-11-30T07:31:16Z-
dc.date.available2023-11-30T07:31:16Z-
dc.date.issued2021-
dc.identifier.isbn978-1665448932-
dc.identifier.issn2153-1684-
dc.identifier.otherEID(2-s2.0-85142372420)-
dc.identifier.urihttps://dx.doi.org/10.1109/ANTS52808.2021.9936920-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/111-
dc.description.abstractIn this paper, we consider a cooperative non-orthogonal multiple access (NOMA) system with two untrusted users and a trusted decode-and-forward (DF) relay. We formulate two optimization problems to maximize the secrecy rate of near user under two scenarios, namely joint and individual power budget constraints on source and relay. Closed-form expressions are obtained for power sharing between source and relay, along with energy-efficient power allocation coefficients for both the users. Numerical results are provided, which verify the exactness of the theoretical analysis and present insights on the design of a secure cooperative communication network. © 2021 IEEE.en_US
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.sourceInternational Symposium on Advanced Networks and Telecommunication Systems, ANTSen_US
dc.subjectNOMAen_US
dc.subjectrelayingen_US
dc.subjectsecrecy rateen_US
dc.subjectuntrusted usersen_US
dc.titleSecrecy Rate Maximization at Near User in Untrusted NOMA with Trusted DF Relayen_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.