Spectrum efficiency maximization for cooperative power beacon-enabled wireless powered communication networks

• Published in: China communications Vol. 18; no. 12; pp. 230 - 251
• Main Authors: Xu, Wenjun, Chen, Wei, Fan, Yongjian, Zhang, Zhi, Shi, Xinxin
• Format: Journal Article
• Language: English
• Published: China Institute of Communications 01-12-2021; Key Lab of Universal Wireless Communications,Ministry of Education,Beijing University of Posts and Telecommunications,Beijing 100876,China%Hebei Key Laboratory of Security and Protection Information Sensing and Processing,Hebei University of Engineering,Handan 056038,China%State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China%Beijing Telecom Planning & Designing Institute Co.,Ltd.,Beijing 100048,China
• Subjects: Array signal processing; interference channel; Lead; MIMO communication; Performance evaluation; power beacon; Resource management; spectrum efficiency; time splitting; Wireless communication; wireless power transfer; Wireless sensor networks; WPCN; spectrum efficiency; wireless power transfer; time splitting; WPCN; power beacon; interference channel
• ISSN: 1673-5447
• DOI: 10.23919/JCC.2021.12.015

We consider a spectrum efficiency (SE) maximization problem for cooperative power beacon-enabled wireless powered communication networks (CPB-WPCNs), where each transmitter harvests energy from multi-antenna power beacons (PBs) and transmits data to the corresponding receiver. For data transmission, both orthogonal transmission, i.e., the time splitting (TS) mode, and non-orthogonal transmission, i.e., the interference channel (IC) mode, are considered. Aiming to improve the system SE, the energy beamformers of PBs, the transmit power, and the transmit time duration of transmitters are jointly optimized. For the TS mode, the original non-convex problem is transformed into a convex optimization problem by means of variable substitution and semidefinite relaxation (SDR). The rank-one nature of this SDR is proved, and then a Lagrange-dual based fast algorithm is proposed to obtain the optimal solution with much lower complexity. For the IC mode, to conquer the strong non-convexity of the problem, a branch-reduce-and-bound (BRB) monotonic optimization algorithm is designed as a benchmark. Furthermore, a low-complexity distributed successive convex approximation (SCA) algorithm is presented. Finally, simulation results validate the performance of the proposed algorithms, achieving optimality within only 1%∼2% computation time compared to the CVX solver in the TS mode and achieving 98% of the optimal performance in the IC mode.