ABSTRACT Energy harvesting enables the wireless devices to obtain energy for communication from the ambient environment. A general theme in prior works is to investigate the power scheduling policies to increase the utility ratio of the harvested energy, which arrives at random. One key assumption is the infinite data backlog, which means that as long as there is energy, there is data to transmit. However, in real systems, the buffer size is limited, and the arrival of data is also random. When the data backlog fills up the buffer, the subsequent arrival packets will be discarded directly. Therefore, we are motivated to jointly consider the data arrival and energy arrival processes in an energy harvesting communication system (EHCS). Specifically, we first derive the maximum average throughputr that EHCS can support with a simple online power scheduling scheme. Then, given a data arrival process whose average rate λ <r, we characterize the average data backlog for both constant and random data arrivals. Some further analyses are conducted to the variation of data backlog. To achieve a same packet drop rate, the buffer size needed for constant data arrivals is much smaller than that for random data arrivals, which can be seen from both our theoretical and simulation results. The analysis in this paper initiates a first step towards a more dynamic energy harvesting system, where data arrivals are of importance. , data backlog, queueing network.
Finally, the authors in REF characterized the average backlog for both constant and random data arrivals at a finite-size data buffer considering a Bernoulli energy arrival process.
Data Backlog Analysis in Energy Harvesting Communication Systems
IEEE Access
IEEE Access
Computer Science