Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleOptimal energy allocation for wireless communications with energy harvesting constraints
dc.contributor.authorHo, C.K.
dc.contributor.authorZhang, R.
dc.identifier.citationHo, 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.
dc.description.abstractWe 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.
dc.subjectConvex optimization
dc.subjectdynamic programming
dc.subjectenergy harvesting
dc.subjectoptimal policy
dc.subjectwireless communications
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleIEEE Transactions on Signal Processing
Appears in Collections:Staff Publications

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

Google ScholarTM



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