By Topic

Optimal Broadcast Scheduling for an Energy Harvesting Rechargeable Transmitter with a Finite Capacity Battery

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ozel, O. ; Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA ; Jing Yang ; Ulukus, Sennur

We consider the minimization of the transmission completion time with a battery limited energy harvesting transmitter in an M-user AWGN broadcast channel where the transmitter is able to harvest energy from the nature, using a finite storage capacity rechargeable battery. The harvested energy is modeled to arrive (be harvested) at the transmitter during the course of transmissions at arbitrary time instants. The transmitter has fixed number of packets for each receiver. Due to the finite battery capacity, 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 exist M-1 cut-off power levels such that user i is allocated the power between the i-1st and the ith cut-off power levels subject to the availability of the allocated total power level. Based on these properties, we propose an algorithm that gives the globally optimal offline policy. The proposed algorithm uses directional water-filling repetitively. Finally, we illustrate the optimal policy and compare its performance with several suboptimal policies under different settings.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:11 ,  Issue: 6 )