How wireless queues benefit from motion: an analysis of the continuum between zero and infinite mobility

by   Nithin S. Ramesan, et al.

This paper considers the time evolution of a queue that is embedded in a Poisson point process of moving wireless interferers. The queue is driven by an external arrival process and is subject to a time-varying service process that is a function of the SINR that it sees. Static configurations of interferers result in an infinite queue workload with positive probability. In contrast, a generic stability condition is established for the queue in the case where interferers possess any non-zero mobility that results in displacements that are both independent across interferers and oblivious to interferer positions. The proof leverages the mixing property of the Poisson point process. The effect of an increase in mobility on queueing metrics is also studied. Convex ordering tools are used to establish that faster moving interferers result in a queue workload that is larger for the increasing convex stochastic order. As a corollary, mean workload and mean delay improve as network mobility increases. Positive correlation between SINR level-crossing events at different time points is established and the autocorrelation function is determined. System behaviour is empirically analyzed using discrete-event simulation. The performance of various mobility models is evaluated using heavy-traffic approximations.



There are no comments yet.


page 1

page 2

page 3

page 4


Steady-state analysis of single exponential vacation in a PH/MSP/1/∞ queue using roots

We consider an infinite-buffer single-server queue where inter-arrival t...

Mobility can drastically improve the heavy traffic performance from 1/(1-rho) to -log(1-rho)

We study a model of wireless networks where users move at speed s, which...

Interference Queueing Networks on Grids

Consider a countably infinite collection of coupled queues representing ...

Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates

Motivated by the work of Whitt, who studied stabilization of the mean vi...

Infinite Servers Queue Systems Busy Period Time Length Distribution and Parameters Study through Computational Simulation

A FORTRAN program to simulate the operation of infinite servers queues i...

Are You in the Line? RSSI-based Queue Detection in Crowds

Crowd behaviour analytics focuses on behavioural characteristics of grou...

Stabilizing a Queue Subject to Action-Dependent Server Performance

We consider a discrete-time system comprising an unbounded queue that lo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.