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

MaRDI QIDQ5500149zbMATH OpenFDO

Authors Johan S. H. van Leeuwaarden, Niek Bouman, Sem Borst

Publication date 5 August 2015

Full work available at URL https://arxiv.org/abs/1012.3364

zbMATH Keywords

admissible-set schedulingHarris recurrenceLyapunov functionMarkov chainmeasure-valued processthroughput-optimalitywireless networks

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18) Stochastic scheduling theory in operations research (90B36) Continuous location (90B85)

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.

Recommendations

• A Random Multiple-Access Protocol with Spatial Interactions
• Stability of spatial queueing systems
• Dynamic Distributed Scheduling in Random Access Networks
• Randomized scheduling algorithm for queueing networks
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

Cited in

(3)

• Stability and delay analysis of an adaptive channel-aware random access wireless network
• On Time-Varying Bit-Allocation Maintaining Stability and Performance: A Convex Parameterization
• scientific article; zbMATH DE number 7070910 (Why is no real title available?)

This page was built for publication: Stability of random admissible-set scheduling in spatially continuous wireless systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500149)