Abstract
This work develops a joint design of user association and time allocation for wireless powered communication networks. A harvest-then-transmit protocol is applied with base stations (BSs) transfer wireless energy to users in the first downlink phase. Then, the users utilize the harvested energy for their information transmission to the BS in the subsequent uplink phase. In this configuration, we employ a general <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula> –fair utility to maximize the network throughput. In particular, the maximization of sum-rate, proportional fairness and minimum rate are investigated individually. We introduce a new message-passing based framework to provide an efficient distributed solution for the user association and optimize the time allocation between the downlink and uplink phase. To achieve this joint goal, each user selects a BS in a distributed manner to maximize the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula> –fair utility. After identifying the user association, the time allocation is determined by an efficient line search technique. Simulation results show that the proposed algorithm outperforms existing approaches.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
