TY - GEN
T1 - Broadcasting with a battery limited energy harvesting rechargeable transmitter
AU - Ozel, Omur
AU - Yang, Jing
AU - Ulukus, Sennur
PY - 2011
Y1 - 2011
N2 - We consider the minimization of the transmission completion time with a battery limited energy harvesting transmitter in a two-user AWGN broadcast channel. The transmitter has fixed number of packets for each receiver and energy is modeled to arrive (be harvested) at the transmitter at random instants. The battery at the transmitter has a finite storage capacity, hence energy may overflow without being utilized for data transmission. We derive the optimal offline transmission policy that minimizes the time by which all of the data packets are delivered to their respective destinations. We analyze the structural properties of the optimal transmission policy using a dual problem. We find the optimal total transmit power sequence by a directional water-filling algorithm. We prove that there exists a cut-off power level such that if the allocated power is lower than this level, then only the stronger user is served in that epoch; otherwise, the power above this level is allocated to the weaker user. Based on these properties, we propose an algorithm that gives the globally optimal offline policy. The proposed algorithm uses directional water-filling repetitively.
AB - We consider the minimization of the transmission completion time with a battery limited energy harvesting transmitter in a two-user AWGN broadcast channel. The transmitter has fixed number of packets for each receiver and energy is modeled to arrive (be harvested) at the transmitter at random instants. The battery at the transmitter has a finite storage capacity, hence energy may overflow without being utilized for data transmission. We derive the optimal offline transmission policy that minimizes the time by which all of the data packets are delivered to their respective destinations. We analyze the structural properties of the optimal transmission policy using a dual problem. We find the optimal total transmit power sequence by a directional water-filling algorithm. We prove that there exists a cut-off power level such that if the allocated power is lower than this level, then only the stronger user is served in that epoch; otherwise, the power above this level is allocated to the weaker user. Based on these properties, we propose an algorithm that gives the globally optimal offline policy. The proposed algorithm uses directional water-filling repetitively.
UR - http://www.scopus.com/inward/record.url?scp=79960576018&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960576018&partnerID=8YFLogxK
U2 - 10.1109/WIOPT.2011.5930017
DO - 10.1109/WIOPT.2011.5930017
M3 - Conference contribution
AN - SCOPUS:79960576018
SN - 9781612848242
T3 - 2011 International Symposium on Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks, WiOpt 2011
SP - 205
EP - 212
BT - 2011 International Symposium on Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks, WiOpt 2011
T2 - 2011 International Symposium of on Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks, WiOpt 2011
Y2 - 9 May 2011 through 13 May 2011
ER -