Stability of Random Admissible-Set Scheduling in Spatially Continuous Wireless Systems

TL;DR

This paper proves that a random admissible-set scheduling policy in spatially distributed wireless networks can achieve maximum stability under certain conditions, using measure-valued processes and Lyapunov functions.

Contribution

It demonstrates maximum stability of random admissible-set scheduling in spatial wireless networks, extending stability results to continuous spatial models.

Findings

Achieves maximum stability under mild conditions

Applicable to symmetric and broad scenarios

Uses measure-valued process and Lyapunov function for proof

Abstract

We examine the stability of wireless networks whose users are distributed over a compact space. A subset of users is called {\it admissible} when their simultaneous activity obeys the prevailing interference constraints and, in each time slot, an admissible subset of users is selected uniformly at random to transmit one packet. We show that, under a mild condition, this random admissible-set scheduling mechanism achieves maximum stability in a broad set of scenarios, and in particular in symmetric cases. The proof relies on a description of the system as a measure-valued process and the identification of a Lyapunov function.