Sum Rate Maximization for Multi-user Wireless Powered IoT Network With Non-linear Energy Harvester: Time and Power Allocation

2019 
We consider the “harvest-then-transmit” protocol in a wireless powered communication network (WPCN), where an energy-constrained access point (AP) harvests energy from the radio-frequency signals transmitted by a power beacon (PB) for assisting user data transmission. In the wireless information transfer (WIT) phase, AP employs the harvested energy to convey independent signals to multiple users through either time-division multiple access (TDMA) or orthogonal frequency-division multiple access (OFDMA). Aiming to maximize the sum rate (SR) of the WPCN, we jointly optimize the energy harvesting (EH) time and the AP power allocation, considering both the conventional linear and practical nonlinear EH models at the AP. The optimization problems of both TDMA- and OFDMA-enabled WPCNs are formulated as nonconvex programs, which are challenging to solve globally. To achieve an efficient optimal solution to the problem of TDMA-enabled WPCN, we first decompose the original nonconvex problem into three convex subproblems, and then propose a low-complexity iterative algorithm for its solution. For the OFDMA-enabled WPCN, the problem belongs to a difficult class of mixed-integer nonconvex programming due to the involvement of binary variables for subcarrier allocation. To overcome this issue, we convert the problem to a quasi-convex problem and then employ a bisection search to obtain the optimal solution. Simulation results are provided to confirm the benefit of jointly optimizing the EH time and the AP power allocation compared to baseline schemes. The performance of the proposed TDMA-enabled WPCN is shown to be superior to that of the proposed OFDMA-enabled WPCN in terms of SR when the transmit power of PB and the number of antennas of AP are relatively large.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    25
    References
    4
    Citations
    NaN
    KQI
    []