An algorithm for proportional-fair downlink scheduling in the presence of energy harvesting

Abstract

This paper considers the allocation of time slots in a frame, as well as power and rate to multiple receivers on an energy harvesting downlink. Energy arrival times that will occur within the frame are known at the beginning of the frame. The goal is to solve an optimization problem designed to maximize a throughput-based utility function that provides proportional fairness among users. An optimal solution of the problem was obtained by using a Block Coordinate Descent based algorithm, (BCD), in earlier work. However, that solution has high complexity and is therefore not scalable to a large number of users or slots. This paper first establishes some structural characteristics of the optimal solution. Then, building on those, develops a simple and scalable, yet efficient heuristic, named ProNTO. Numerical and simulation results suggest that ProNTO can closely track the performance of BCD. © 2013 Springer-Verlag London.