Optimal time allocation for dynamic-TDMA-based wireless powered communication networks

Abstract

In this paper, we consider a wireless communication network with a hybrid access point (HAP) and a set of wireless users with energy harvesting capabilities. The HAP is assumed to have two antennas: one for transferring wireless energy in the downlink and one for receiving wireless information in the uplink. Without fixed energy sources, users first have to harvest energy from the wireless signals broadcast by the HAP, and then using the harvested energy to transmit their individual information to the HAP through dynamic-time-division-multiple-access (D-TDMA). We investigate the optimal time allocation to maximize the throughput of the proposed system subject to a total time constant. The formulated throughput maximization problem is proved to be a convex optimization problem. By using convex optimization techniques, the optimal time allocation strategy is obtained in closed-form expression. We show that the optimal time allocation can be obtained with linear complexity. It is then shown by simulations that the total throughput of the network increases with the number of users. It is also shown by simulations that the users with low SNR should be scheduled to transmit first.