On the queue-overflow probabilities of a class of distributed scheduling algorithms

In this paper, we are interested in using large-deviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless scheduling algorithms, as the overflow threshold approaches infinity. We consider ad hoc wireless networks where each link interferes...

Ausführliche Beschreibung