Please use this identifier to cite or link to this item:
|Title:||Optimal energy allocation for wireless communications with energy harvesting constraints||Authors:||Ho, C.K.
|Issue Date:||2012||Citation:||Ho, C.K., Zhang, R. (2012). Optimal energy allocation for wireless communications with energy harvesting constraints. IEEE Transactions on Signal Processing 60 (9) : 4808-4818. ScholarBank@NUS Repository. https://doi.org/10.1109/TSP.2012.2199984||Abstract:||We consider the use of energy harvesters, in place of conventional batteries with fixed energy storage, for point-to-point wireless communications. In addition to the challenge of transmitting in a channel with time selective fading, energy harvesters provide a perpetual but unreliable energy source. In this paper, we consider the problem of energy allocation over a finite horizon, taking into account channel conditions and energy sources that are time varying, so as to maximize the throughput. Two types of side information (SI) on the channel conditions and harvested energy are assumed to be available: causal SI (of the past and present slots) or full SI (of the past, present and future slots). We obtain structural results for the optimal energy allocation, via the use of dynamic programming and convex optimization techniques. In particular, if unlimited energy can be stored in the battery with harvested energy and the full SI is available, we prove the optimality of a water-filling energy allocation solution where the so-called water levels follow a staircase function. © 1991-2012 IEEE.||Source Title:||IEEE Transactions on Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/71282||ISSN:||1053587X||DOI:||10.1109/TSP.2012.2199984|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 13, 2021
WEB OF SCIENCETM
checked on Apr 6, 2021
checked on Apr 12, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.