Skip navigation

Please use this identifier to cite or link to this item: http://10.10.120.238:8080/xmlui/handle/123456789/573
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKatiyar B.en_US
dc.contributor.authorMishra D.en_US
dc.contributor.authorModem S.en_US
dc.contributor.authorSaini R.en_US
dc.date.accessioned2023-11-30T08:42:12Z-
dc.date.available2023-11-30T08:42:12Z-
dc.date.issued2022-
dc.identifier.issn1089-7798-
dc.identifier.otherEID(2-s2.0-85136904900)-
dc.identifier.urihttps://dx.doi.org/10.1109/LCOMM.2022.3199877-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/573-
dc.description.abstractThis letter is a novel attempt to consider intelligent reflecting surfaces (IRS) assisted user cooperation adopting the practical non-linear phase-shift model in a wireless-powered communication network (WPCN). Specifically, we aim to maximize both max-min fairness and sum throughput among the energy harvesting users while adopting the practical IRS model. We propose an alternating optimization (AO) algorithm exploiting convex relaxation and semidefinite programming to optimize the phase-shift matrices at IRS along with time and power allocation at the hybrid access point serving the users. Simulation results corroborate key analytical claims and show that the proposed jointly-optimal design provides better performance gain for max-min and sum-rate maximization over the existing benchmark schemes. © 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.subjectenergy harvestingen_US
dc.subjectIntelligent reflecting surfaceen_US
dc.subjectnon-linear phase-shift modelen_US
dc.subjectoptimizationen_US
dc.subjectuser cooperationen_US
dc.titleOptimal User Cooperation in IRS Assisted WPCN for Practical Non-Linear Phase-Shift Modelen_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.