Skip navigation

Please use this identifier to cite or link to this item: http://10.10.120.238:8080/xmlui/handle/123456789/270
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSaini R.en_US
dc.contributor.authorMishra D.en_US
dc.contributor.authorKotha V.en_US
dc.date.accessioned2023-11-30T08:17:30Z-
dc.date.available2023-11-30T08:17:30Z-
dc.date.issued2021-
dc.identifier.isbn978-1728197944-
dc.identifier.otherEID(2-s2.0-85102978894)-
dc.identifier.urihttps://dx.doi.org/10.1109/CCNC49032.2021.9369642-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/270-
dc.description.abstractThis paper presents a novel joint transmit power sharing and relay placement scheme for decode-and-forward relay assisted secure communication to a legitimate user in presence of external eavesdropper. Observing that secrecy outage minimization problem for the trusted user is non-convex, key insights on optimal power sharing between source and relay are first presented to derive an equivalent single variable problem. Next, tight analytical bounds for optimal relay placement are discoursed to ultimately come up with a computationally-efficient jointly global optimization algorithm. Finally, selected numerical results validate analysis, present key insights, and demonstrate performance gains of around 30dB over benchmark schemes. © 2021 IEEE.en_US
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.source2021 IEEE 18th Annual Consumer Communications and Networking Conference, CCNC 2021en_US
dc.subjectCooperative secure communicationen_US
dc.subjectDecode and forwarden_US
dc.subjectGlobal optimizationen_US
dc.subjectPower allocationen_US
dc.subjectRelay placementen_US
dc.titlePower allocation and relay placement for secrecy outage minimization over DF relayed systemen_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.