Iterative Dynamic Water-Filling for Fading Multiple-Access Channels With Energy Harvesting

• Published in: IEEE journal on selected areas in communications Vol. 33; no. 3; pp. 382 - 395
• Main Authors: Zhe Wang, Aggarwal, Vaneet, Xiaodong Wang
• Format: Journal Article
• Language: English
• Published: IEEE 01.03.2015
• Subjects: Batteries; convex optimization; dynamic water-filling; Energy consumption; Energy harvesting; Energy schedule; Fading; fading multiple-access channel; Heuristic algorithms; KKT conditions; Schedules; Transmitters; energy harvesting; dynamic water-filling; Convex optimization; KKT conditions; fading multiple-access channel; energy schedule
• DOI: 10.1109/JSAC.2015.2391571
• ISSN: 0733-8716

In this paper, we develop optimal energy scheduling algorithms for N-user fading multiple-access channels with energy harvesting to maximize the channel sum-rate, assuming that the side information of both the channel states and energy harvesting states for K time slots is known a priori, and the battery capacity and the maximum energy consumption in each time slot are bounded. The problem is formulated as a convex optimization problem with O (NK) constraints making it hard to solve using a general convex solver since the computational complexity of a generic convex solver becomes impractically high when the number of constraints is large. This paper gives an efficient energy scheduling algorithm, called the iterative dynamic water-filling algorithm, that has a computational complexity of O(NK 2 ) per iteration. For the single-user case, a dynamic water-filling method is shown to be optimal. Unlike the traditional water-filling algorithm, in dynamic water-filling, the water level is not constant but changes when the battery overflows or depletes. An iterative version of the dynamic water-filling algorithm is shown to be optimal for the case of multiple users. Even though in principle the optimality is achieved under large number of iterations, in practice convergence is reached in only a few iterations. Moreover, a single iteration of the dynamic water-filling algorithm achieves a sum-rate that is within (N-1)K nats of the optimal sum-rate.