Distributed Scheduling and Its Asymptotic Analysis for Cognitive Radio Networks Under the Many-Channel Regime

The design of efficient and distributed scheduling algorithms is essential to garner the full potential of cognitive radio networks (CRNs). In this paper, we propose a distributed orthogonal frequency-division multiplexing (OFDM)-based scheduling algorithm, which is called the collision-queue-regula...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2014-10, Vol.63 (8), p.4053-4063
Main Authors: Dongyue Xue, Ekici, Eylem
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Asymptotic properties
Cognitive radio
Constants
Equivalence
Networks
OFDM
Orthogonal Frequency Division Multiplexing
Queueing analysis
Schedules
Scheduling
Scheduling algorithms
Throughput
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The design of efficient and distributed scheduling algorithms is essential to garner the full potential of cognitive radio networks (CRNs). In this paper, we propose a distributed orthogonal frequency-division multiplexing (OFDM)-based scheduling algorithm, which is called the collision-queue-regulated algorithm, that aims to limit the collision rate to a level imposed by primary users of a CRN. Via a novel equivalent queue system analysis, we prove that the proposed algorithm can achieve at least a constant fraction of the capacity region in the many-channel regime, and our numerical studies indicate that the proposed distributed collision-queue-regulated algorithm achieves a throughput very close to that achievable by a centralized throughput-optimal back-pressure-based scheduling algorithm.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2014.2303089