DeepAI AI Chat
Log In Sign Up

Scheduling in Wireless Networks with Spatial Reuse of Spectrum as Restless Bandits

by   Vivek S. Borkar, et al.
IIT Bombay

We study the problem of scheduling packet transmissions with the aim of minimizing the energy consumption and data transmission delay of users in a wireless network in which spatial reuse of spectrum is employed. We approach this problem using the theory of Whittle index for cost minimizing restless bandits, which has been used to effectively solve problems in a variety of applications. We design two Whittle index based policies the first by treating the graph representing the network as a clique and the second based on interference constraints derived from the original graph. We evaluate the performance of these two policies via extensive simulations, in terms of average cost and packets dropped, and show that they outperform the well-known Slotted ALOHA and maximum weight scheduling algorithms.


page 1

page 2

page 3

page 4


Scheduling in Wireless Networks using Whittle Index Theory

We consider the problem of scheduling packet transmissions in a wireless...

Two-sided Delay Constrained Scheduling: Managing Fresh and Stale Data

Energy or time-efficient scheduling is of particular interest in wireles...

Age of Information: Whittle Index for Scheduling Stochastic Arrivals

Age of information is a new concept that characterizes the freshness of ...

Dynamic Power Control for Packets with Deadlines

Wireless devices need to adapt their transmission power according to the...

Coverage probability in wireless networks with determinantal scheduling

We propose a new class of algorithms for randomly scheduling network tra...

Transmission Scheduling for Multi-loop Wireless Networked Control Based on LQ Cost Offset

In this paper, transmission scheduling for multiloop wireless networked ...

Multi-AP Coordinated Spatial Reuse for Wi-Fi 8: Group Creation and Scheduling

Multi-Access Point Coordination (MAPC) will be a key feature in next gen...