Abstract
We consider a wireless sensor node that gathers energy through harvesting and reaps data through sensing. The node has a wireless transmitter that sends out a data packet whenever there is at least one “energy packet” and one “data packet”, where an energy packet represents the amount of accumulated energy at the node that can allow the transmission of a data packet. We show that such a system is unstable when both the energy storage space and the data backlog buffer approach infinity, and we obtain the stable stationary solution when both buffers are finite. We then show that if a single energy packet is not sufficient to transmit a data packet, there are conditions under which the system is stable, and we provide the explicit expression for the joint probability distribution of the number of energy and data packets in the system. Since the two flows of energy and data can be viewed as flows that are instantaneously synchronised, this paper also provides a mathematical analysis of a fundamental problem in computer science related to the stability of the “join” synchronisation primitive.
Highlights
New applications of information technology such as the smart grid, remote and unattended sensors for monitoring or security [1,2] require that computation and communications occur without humanEnergies 2015, 8 intervention to replace batteries and without using the power mains, while spam and network attacks exacerbate the use of energy [3] in communications
There is a strong motivation in thrift energy use for ICT and to rely increasingly on energy harvesting [5,6], which can occur from mechanical vibrations, heat capture and the use of ambient natural or artificial light
We assume that an energy packet is exactly the amount of energy needed to transmit a data packet
Summary
New applications of information technology such as the smart grid, remote and unattended sensors for monitoring or security [1,2] require that computation and communications occur without human. This paper presents a complete analysis of this problem and in the process, we address a fundamental problem in computer science regarding the stability of the join synchronisation primitive [20,21,22] when the synchronisation time is negligibly small This can to apply to situations when data packets from voice or video arrive from the same source, but over distinct paths in a network, to an output Codec (decoder) at a receiving node or end user, and need to be synchronised and re-ordered before they are delivered to the end user [23]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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
