Probabilistic Analysis of a Buffer Overflow Duration in Data Transmission in Wireless Sensor Networks

On the Time to Buffer Overflow in a Queueing Model with a General Independent Input Stream and Power-Saving Mechanism Based on Working Vacations

A single server GI/M/1 queue with a limited buffer and an energy-saving mechanism based on a single working vacation policy is analyzed. The general independent input stream and exponential service times are considered. When the queue is empty after a service completion epoch, the server lowers the service speed for a random amount of time following an exponential distribution. Packets that arrive while the buffer is saturated are rejected. The analysis is focused on the duration of the time period with no packet losses. A system of equations for the transient time to the first buffer overflow cumulative distribution functions conditioned by the initial state and working mode of the service unit is stated using the idea of an embedded Markov chain and the continuous version of the law of total probability. The explicit representation for the Laplace transform of considered characteristics is found using a linear algebra-based approach. The results are illustrated using numerical examples, and the impact of the key parameters of the model is investigated.