Dynamic Scheduling for Delay Guarantees for Heterogeneous Cognitive Radio Users

TL;DR

This paper introduces a novel scheduling algorithm for heterogeneous cognitive radio networks that guarantees arbitrary average delays for secondary users while respecting interference constraints, outperforming traditional methods.

Contribution

The paper presents a Lyapunov-based scheduling algorithm that provides customizable delay guarantees for diverse secondary users in cognitive radio systems.

Findings

The proposed algorithm ensures bounded queues and adherence to interference constraints.

Simulation results demonstrate its superiority over the Max-Weight algorithm.

The method effectively manages heterogeneous delay performances among users.

Abstract

We study an uplink multi secondary user (SU) system having statistical delay constraints, and an average interference constraint to the primary user (PU). SUs with heterogeneous interference channel statistics, to the PU, experience heterogeneous delay performances since SUs causing low interference are scheduled more frequently than those causing high interference. We propose a scheduling algorithm that can provide arbitrary average delay guarantees to SUs irrespective of their statistical channel qualities. We derive the algorithm using the Lyapunov technique and show that it yields bounded queues and satisfy the interference constraints. Using simulations, we show its superiority over the Max-Weight algorithm.