Message-Passing Based Joint User Association and Time Allocation for Wireless Powered Communication Networks
- Authors
- Lee, H.; Moon, J.; Song, C.; Lee, S.H.; Lee, I.
- Issue Date
- 1월-2022
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Wireless powered communication networks; message-passing algorithm; user association; time allocation
- Citation
- IEEE Transactions on Wireless Communications, v.21, no.1, pp.34 - 47
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE Transactions on Wireless Communications
- Volume
- 21
- Number
- 1
- Start Page
- 34
- End Page
- 47
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/135349
- DOI
- 10.1109/TWC.2021.3093317
- ISSN
- 1536-1276
- 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 α–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 α–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. IEEE
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.