Stability of random admissible-set scheduling in spatially continuous wireless systems

Research output: Contribution to journalArticleAcademicpeer-review


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, at each discrete time instant, 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.

Keywords: Harris recurrent, Foster\tire Lyapunov, continuous space, measure-valued process, throughput-optimal, wireless systems, scheduling
Original languageEnglish
Pages (from-to)85-108
JournalMarkov Processes and Related Fields
Issue number1
Publication statusPublished - 2015


Dive into the research topics of 'Stability of random admissible-set scheduling in spatially continuous wireless systems'. Together they form a unique fingerprint.

Cite this