A Low-Complexity Algorithm for Throughput Maximization in Wireless Powered Communication Networks
Abstract
This paper investigates a wireless powered communication network (WPCN) under the protocol of harvest-then-transmit,where a hybrid access point with constant power supply replenishes the passive user nodes by wireless power transfer in the downlink,then each user node transmit independent information to the hybrid AP in a time division multiple access (TDMA) scheme in the uplink.The sum-throughput maximization and min-throughput maximization problems are considered in this paper.The optimal time allocation for the sum-throughput maximization is proposed based on the Jensen's inequality,which provides more insight into the design of WPCNs.A low-complexity fixed-point iteration algorithm for the min-throughput maximization problem,which promises a much better computation complexity than the state-of-the-art algorithm.Simulation results confirm the effectiveness of the proposed algorithm.
Cite
@article{arxiv.1403.3665,
title = {A Low-Complexity Algorithm for Throughput Maximization in Wireless Powered Communication Networks},
author = {Qian Sun and Gang Zhu and Chao Shen and Xuan Li and Zhangdui Zhong},
journal= {arXiv preprint arXiv:1403.3665},
year = {2014}
}
Comments
in Proc.IEEE Intell.Green Build.Smart Grid (IGBSG),accepted for pulication. Apr. 2014