http://10.10.120.238:8080/xmlui/handle/123456789/111
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 | Singh V. | en_US |
dc.date.accessioned | 2023-11-30T07:31:16Z | - |
dc.date.available | 2023-11-30T07:31:16Z | - |
dc.date.issued | 2021 | - |
dc.identifier.isbn | 978-1665448932 | - |
dc.identifier.issn | 2153-1684 | - |
dc.identifier.other | EID(2-s2.0-85142372420) | - |
dc.identifier.uri | https://dx.doi.org/10.1109/ANTS52808.2021.9936920 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/111 | - |
dc.description.abstract | In 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.iso | en | en_US |
dc.publisher | IEEE Computer Society | en_US |
dc.source | International Symposium on Advanced Networks and Telecommunication Systems, ANTS | 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 | Secrecy Rate Maximization at Near User in Untrusted NOMA with Trusted DF Relay | en_US |
dc.type | Conference Paper | en_US |
Appears in Collections: | Conference Paper |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.