Delay Constrained Energy Harvesting Networks with Limited Energy and Data Storage

Delay Constrained Energy Harvesting Networks with Limited Energy and Data Storage
复制标题

DOI:
10.1109/jsac.2016.2545418
复制
发表时间:
2016-03
影响因子:
16.4
通讯作者:
Burak Varan;A. Yener
Burak Varan;A. Yener
中科院分区:
计算机科学1区
文献类型:
--
作者:
Burak Varan;A. Yener

文献摘要

被引文献

相似文献

本文研究了单用户信道、双向信道和具有块衰落的双向中继信道中的能量收集发射机。每个发射器都配备了有限的电池来存储收集到的能量,以及有限的缓冲区来存储通信会话期间到达的数据。我们考虑对延迟敏感的应用程序并最大化吞吐量,同时在延迟约束下及时交付数据。我们表明,所产生的延迟有限吞吐量最大化问题可以使用称为能量调度问题和数据调度问题的两个解耦问题的交替最大化来解决。我们使用改进的定向注水算法(具有正确的渗透性水龙头、水泵和溢流箱)来解决能源调度问题,并通过前向归纳来解决数据调度问题。此外,我们还确定了吞吐量最大化的在线最佳策略。我们提供数值结果来验证我们的分析结果,并证明有限数据缓冲区容量和延迟要求对吞吐量的影响。我们观察到,较大的缓冲区大小对于更宽松的延迟要求非常有用,并且与一个时隙内的吞吐量相当的数据缓冲区大小占吞吐量增加的大部分。
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.