Time Allocation and Scheduling in Energy Harvesting Wireless Networks

Abstract

The increasing demand for data services has given rise to efficient utilization of available resources (e.g., energy) in modern wireless communication. In order to address the energy requirements a wireless powered communication network (WPCN) with separate energy source (ES) and access point (AP) is considered in this work. The transmitters here adopt harvest-then-transmit (HTT) protocol for transmission to AP. An optimal dynamic time allocation and scheduling policy is considered which maximizes the throughput of the system. The throughput maximization problem formulated is convex in nature and solved using convex optimization techniques. The fairness of proposed policy is compared with max-min policy which use harvest-or-transmit (HOT) protocol in terms of Jain's fairness index. Simulation results highlights the trade-off between throughput and fairness and show that the proposed policy is more reliable for the overcrowded scenario.