Publications

Detailed Information

Sum-Rate Maximization under QoS Constraints for WPCN with User Cooperation

DC Field Value Language
dc.contributor.authorSong, Dongyeong-
dc.contributor.authorShin, Wonjae-
dc.contributor.authorLee, Jungwoo-
dc.date.accessioned2022-10-26T07:21:54Z-
dc.date.available2022-10-26T07:21:54Z-
dc.date.created2022-10-21-
dc.date.issued2018-12-
dc.identifier.citation2018 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), p. 18472359-
dc.identifier.issn2166-0069-
dc.identifier.urihttps://hdl.handle.net/10371/186819-
dc.description.abstractIn this paper, we consider a two-user wireless powered communication network (WPCN) with user cooperation, which consists of a hybrid access point (H-AP) and two users with energy harvesting circuit. The H-AP transfers energy to users during downlink (DL) and the users transmit information during uplink (UL) utilizing the harvested energy. To enhance user fairness, a user cooperation protocol is employed in which a user near from the H-AP relays the message of the other user by partially using its allocated time and energy resources. We maximize the sum-rate in the considered network subject to a set of quality of service (QoS) requirements by jointly optimizing the time allocation for DL energy transfer and UL information transmission. A novel closed-form solution is derived for the optimization problem using convex optimization techniques.-
dc.language영어-
dc.publisherIEEE-
dc.titleSum-Rate Maximization under QoS Constraints for WPCN with User Cooperation-
dc.typeArticle-
dc.identifier.doi10.1109/GLOCOMW.2018.8644129-
dc.citation.journaltitle2018 IEEE GLOBECOM WORKSHOPS (GC WKSHPS)-
dc.identifier.wosid000462817000042-
dc.identifier.scopusid2-s2.0-85063513892-
dc.citation.startpage18472359-
dc.description.isOpenAccessN-
dc.contributor.affiliatedAuthorLee, Jungwoo-
dc.type.docTypeProceedings Paper-
dc.description.journalClass1-
Appears in Collections:
Files in This Item:
There are no files associated with this item.

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share