Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIT.2010.5513719
Title: Optimal energy allocation for wireless communications powered by energy harvesters
Authors: Ho, C.K.
Zhang, R. 
Issue Date: 2010
Source: Ho, C.K., Zhang, R. (2010). Optimal energy allocation for wireless communications powered by energy harvesters. IEEE International Symposium on Information Theory - Proceedings : 2368-2372. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIT.2010.5513719
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 a time varying channel and energy source, so as to maximize the throughput. Two types of side information are assumed to be available: causal side information of the immediate past channel condition and harvested energy, and full side information. 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, we prove the optimality of a water-filling energy allocation solution with multiple, non-decreasing water levels. © 2010 IEEE.
Source Title: IEEE International Symposium on Information Theory - Proceedings
URI: http://scholarbank.nus.edu.sg/handle/10635/51229
ISBN: 9781424469604
ISSN: 21578103
DOI: 10.1109/ISIT.2010.5513719
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

67
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

39
checked on Nov 21, 2017

Page view(s)

16
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.