TY - JOUR
T1 - Delay Constrained Energy Harvesting Networks with Limited Energy and Data Storage
AU - Varan, Burak
AU - Yener, Aylin
N1 - Funding Information:
This work was supported in part by the National Science Foundation under Grant CNS 09-64364, Grant CCF 14-22347, and Grant CNS 15-26165.
Publisher Copyright:
© 2016 IEEE.
Copyright:
Copyright 2016 Elsevier B.V., All rights reserved.
PY - 2016/5
Y1 - 2016/5
N2 - This paper studies energy harvesting transmitters in the single user channel, the two-way channel, and the two-way relay channel with block fading. Each transmitter is equipped with a finite battery to store the harvested energy, and a finite buffer to store the data that arrive during the communication session. We consider delay sensitive applications and maximize throughput while enabling timely delivery of data with delay constraints. We show that the resulting delay limited throughput maximization problem can be solved using alternating maximization of two decoupled problems termed the energy scheduling problem and the data scheduling problem. We solve the energy scheduling problem using a modified directional waterfilling algorithm with right permeable taps, water pumps, and overflow bins and the data scheduling problem with forward induction. Additionally, we identify the online optimum policy for throughput maximization. We provide numerical results to verify our analytical findings and to demonstrate the impact of the finite data buffer capacity and the delay requirements on the throughput. We observe that larger buffer sizes become useful for more lenient delay requirements, and a data buffer size that is comparable to the throughput within one time slot accounts for the majority of the increase in throughput.
AB - This paper studies energy harvesting transmitters in the single user channel, the two-way channel, and the two-way relay channel with block fading. Each transmitter is equipped with a finite battery to store the harvested energy, and a finite buffer to store the data that arrive during the communication session. We consider delay sensitive applications and maximize throughput while enabling timely delivery of data with delay constraints. We show that the resulting delay limited throughput maximization problem can be solved using alternating maximization of two decoupled problems termed the energy scheduling problem and the data scheduling problem. We solve the energy scheduling problem using a modified directional waterfilling algorithm with right permeable taps, water pumps, and overflow bins and the data scheduling problem with forward induction. Additionally, we identify the online optimum policy for throughput maximization. We provide numerical results to verify our analytical findings and to demonstrate the impact of the finite data buffer capacity and the delay requirements on the throughput. We observe that larger buffer sizes become useful for more lenient delay requirements, and a data buffer size that is comparable to the throughput within one time slot accounts for the majority of the increase in throughput.
UR - http://www.scopus.com/inward/record.url?scp=84976407049&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84976407049&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2016.2545418
DO - 10.1109/JSAC.2016.2545418
M3 - Article
AN - SCOPUS:84976407049
VL - 34
SP - 1550
EP - 1564
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
SN - 0733-8716
IS - 5
M1 - 7438752
ER -