Abstract

Energy harvesting communication systems provide a “green” solution by obtaining energy from ambient sources, such as sunlight or vibrations. This energy is stored for transmission of data packets which arrive at the link layer of an energy harvesting transmitter. Since the data and energy arrival processes are independent and random, the data packets wait in a queue for the accumulation of sufficient amount of energy and for service completion of previously arrived packets. Thus, the energy arrival process and the data service process jointly impact the data queue dynamics. This makes the queueing analysis of an energy harvesting communication system challenging. In this paper, we formulate a two stage virtual queueing system which decouples the wait stages for the energy arrival process and the service process. This virtual queueing system leads to closed-form expressions for the average packet delay and the probability of data packet loss due to buffer overflow. We assume that the data and energy arrivals are independent Poisson processes and the service time for data packets may have any general distribution. The expressions for the average packet delay and the probability of buffer overflow are shown to be exact when the service time becomes negligible, and the packet delay gets dominated by data packets waiting for arrival of sufficient energy. These expressions are compared with Monte Carlo simulations and are shown to be robust even when the service time is increased up to sixty percent of the average packet delay.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.