Joint Time and Power Allocation in Multi-Cell Wireless Powered Communication Networks

被引:17
作者
Liang, Jiaqian [1 ]
Feng, Daquan [1 ]
He, Chunlong [1 ]
Qian, Gongbin [2 ]
Guo, Chongtao [1 ]
Zhang, Nan [1 ]
机构
[1] Shenzhen Univ, Guangdong Key Lab Intelligent Informat Proc, Shenzhen 518060, Peoples R China
[2] Shenzhen Univ, Coll Informat Engn, Shenzhen Key Lab Adv Machine Learning & Applicat, Shenzhen 518060, Peoples R China
关键词
Time allocation; power allocation; max-min throughput; max-sum throughput; wireless powered communication network (WPCN); THROUGHPUT MAXIMIZATION; RESOURCE-ALLOCATION;
D O I
10.1109/ACCESS.2019.2908240
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper investigates the joint time and power allocation in a multi-cell wireless powered communication network (WPCN) with successive interference cancellation. In the WPCN, the hybrid access points broadcast wireless energy to all users and then the users utilize the harvested energy to transmit information simultaneously in a spectrum-sharing fashion. The max-min fairness throughput optimization and max-sum throughput optimization problems are formulated to analyze the system performance. However, both of the two optimization problems are nonconvex due to the complicated co-channel interference and the coupled time and power variables. To deal with this challenge, efficient two-stage approaches are proposed to transform them into more tractable ones. Specifically, for the max-min fairness throughput optimization problem, we first convert the power allocation problem into geometric programming (GP) problem for given time allocation and then optimize the time allocation. For the max-sum throughput optimization problem, we first transform the power allocation problem into a signomial programming problem with fixed time allocation, which is further approximated as a GP one. Then, time allocation is optimized. The simulation results validate the effectiveness of the two proposed approaches. In addition, it is shown that the "doubly near-far" issue can be well addressed by the max-min fairness throughput optimization.
引用
收藏
页码:43555 / 43563
页数:9
相关论文
共 31 条
[1]  
[Anonymous], 1998, A quantitative measure of fairness and discrimination for resource allocation in shared computer systems
[2]   A tutorial on geometric programming [J].
Boyd, Stephen ;
Kim, Seung-Jean ;
Vandenberghe, Lieven ;
Hassibi, Arash .
OPTIMIZATION AND ENGINEERING, 2007, 8 (01) :67-127
[3]  
Boyd Stephen P., 2014, Convex Optimization
[4]   Spatial Throughput Maximization of Wireless Powered Communication Networks [J].
Che, Yue Ling ;
Duan, Lingjie ;
Zhang, Rui .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2015, 33 (08) :1534-1548
[5]   Power control by geometric programming [J].
Chiang, Mung ;
Tan, Chee Wei ;
Palomar, Daniel P. ;
O'Neill, Daniel ;
Julian, David .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007, 6 (07) :2640-2651
[6]   Resource Allocation in Wireless Powered Communication Networks With Non-Orthogonal Multiple Access [J].
Chingoska, Hristina ;
Hadzi-Velkov, Zoran ;
Nikoloska, Ivana ;
Zlatanov, Nikola .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2016, 5 (06) :684-687
[7]   Optimal Resource Allocation in Wirelessly Powered Communication Networks With User Cooperation [J].
Di, Xiaofei ;
Xiong, Ke ;
Fan, Pingyi ;
Yang, Hong-Chuan ;
Ben Letaief, Khaled .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (12) :7936-7949
[8]   Wireless-Powered Communications With Non-Orthogonal Multiple Access [J].
Diamantoulakis, Panagiotis D. ;
Pappi, Koralia N. ;
Ding, Zhiguo ;
Karagiannidis, George K. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (12) :8422-8436
[9]   A Survey of Energy-Efficient Wireless Communications [J].
Feng, Daquan ;
Jiang, Chenzi ;
Lim, Gubong ;
Cimini, Leonard J., Jr. ;
Feng, Gang ;
Li, Geoffrey Ye .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2013, 15 (01) :167-178
[10]   Minimum Secrecy Throughput Maximization in Wireless Powered Secure Communications [J].
Guo, Chongtao ;
Liao, Bin ;
Feng, Daquan ;
He, Chunlong ;
Ma, Xiao .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (03) :2571-2581