Abstract
In this paper, we develop optimal energy scheduling algorithms for optical Poisson channels with energy harvesting devices. The objective is to maximize the channel sum-rate, assuming that the side information of 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(K) constraints making it hard to solve using a general convex solver since the computational complexity of a generic convex solver is exponential in the number of constraints. This paper gives an efficient energy scheduling algorithm that has a computational complexity of O(K2). The proposed algorithm is also shown to be optimal. The proposed energy schedule is piece-wise constant, which changes when the battery overflows or depletes. Numerical results depict significant improvement of the optimal strategy over benchmark strategies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have