Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks

Jian Tang, Satyajayant Misra, Guoliang Xue

Research output: Contribution to journalArticle

85 Citations (Scopus)

Abstract

Cognitive radio and Dynamic Spectrum Access (DSA) enable wireless users to share a wide range of available spectrums. In this paper, we study joint spectrum allocation and scheduling problems in cognitive radio wireless networks with the objectives of achieving fair spectrum sharing. A novel Multi-Channel Contention Graph (MCCG) is proposed to characterize the impact of interference under the protocol model in such networks. Based on the MCCG, we present an optimal algorithm to compute maximum throughput solutions. As simply maximizing throughput may result in a severe bias on resource allocation, we take fairness into consideration by presenting optimal algorithms as well as fast heuristics to compute fair solutions based on a simplified max-min fairness model and the well-known proportional fairness model. Numerical results show that the performance given by our heuristic algorithms is very close to that of the optimal solution, and our proportional fair algorithms achieve a good tradeoff between throughput and fairness. In addition, we extend our research to the physical interference model, and propose effective heuristics for solving the corresponding problems.

Original languageEnglish (US)
Pages (from-to)2148-2158
Number of pages11
JournalComputer Networks
Volume52
Issue number11
DOIs
StatePublished - Aug 8 2008

Fingerprint

Cognitive radio
Wireless networks
Scheduling
Throughput
Heuristic algorithms
Resource allocation
Network protocols

Keywords

  • Cognitive radio
  • Dynamic spectrum access
  • Fairness
  • Scheduling
  • Spectrum allocation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks. / Tang, Jian; Misra, Satyajayant; Xue, Guoliang.

In: Computer Networks, Vol. 52, No. 11, 08.08.2008, p. 2148-2158.

Research output: Contribution to journalArticle

@article{99ef97e1bb4744f4b402c539f7558f89,
title = "Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks",
abstract = "Cognitive radio and Dynamic Spectrum Access (DSA) enable wireless users to share a wide range of available spectrums. In this paper, we study joint spectrum allocation and scheduling problems in cognitive radio wireless networks with the objectives of achieving fair spectrum sharing. A novel Multi-Channel Contention Graph (MCCG) is proposed to characterize the impact of interference under the protocol model in such networks. Based on the MCCG, we present an optimal algorithm to compute maximum throughput solutions. As simply maximizing throughput may result in a severe bias on resource allocation, we take fairness into consideration by presenting optimal algorithms as well as fast heuristics to compute fair solutions based on a simplified max-min fairness model and the well-known proportional fairness model. Numerical results show that the performance given by our heuristic algorithms is very close to that of the optimal solution, and our proportional fair algorithms achieve a good tradeoff between throughput and fairness. In addition, we extend our research to the physical interference model, and propose effective heuristics for solving the corresponding problems.",
keywords = "Cognitive radio, Dynamic spectrum access, Fairness, Scheduling, Spectrum allocation",
author = "Jian Tang and Satyajayant Misra and Guoliang Xue",
year = "2008",
month = "8",
day = "8",
doi = "10.1016/j.comnet.2008.03.010",
language = "English (US)",
volume = "52",
pages = "2148--2158",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "11",

}

TY - JOUR

T1 - Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks

AU - Tang, Jian

AU - Misra, Satyajayant

AU - Xue, Guoliang

PY - 2008/8/8

Y1 - 2008/8/8

N2 - Cognitive radio and Dynamic Spectrum Access (DSA) enable wireless users to share a wide range of available spectrums. In this paper, we study joint spectrum allocation and scheduling problems in cognitive radio wireless networks with the objectives of achieving fair spectrum sharing. A novel Multi-Channel Contention Graph (MCCG) is proposed to characterize the impact of interference under the protocol model in such networks. Based on the MCCG, we present an optimal algorithm to compute maximum throughput solutions. As simply maximizing throughput may result in a severe bias on resource allocation, we take fairness into consideration by presenting optimal algorithms as well as fast heuristics to compute fair solutions based on a simplified max-min fairness model and the well-known proportional fairness model. Numerical results show that the performance given by our heuristic algorithms is very close to that of the optimal solution, and our proportional fair algorithms achieve a good tradeoff between throughput and fairness. In addition, we extend our research to the physical interference model, and propose effective heuristics for solving the corresponding problems.

AB - Cognitive radio and Dynamic Spectrum Access (DSA) enable wireless users to share a wide range of available spectrums. In this paper, we study joint spectrum allocation and scheduling problems in cognitive radio wireless networks with the objectives of achieving fair spectrum sharing. A novel Multi-Channel Contention Graph (MCCG) is proposed to characterize the impact of interference under the protocol model in such networks. Based on the MCCG, we present an optimal algorithm to compute maximum throughput solutions. As simply maximizing throughput may result in a severe bias on resource allocation, we take fairness into consideration by presenting optimal algorithms as well as fast heuristics to compute fair solutions based on a simplified max-min fairness model and the well-known proportional fairness model. Numerical results show that the performance given by our heuristic algorithms is very close to that of the optimal solution, and our proportional fair algorithms achieve a good tradeoff between throughput and fairness. In addition, we extend our research to the physical interference model, and propose effective heuristics for solving the corresponding problems.

KW - Cognitive radio

KW - Dynamic spectrum access

KW - Fairness

KW - Scheduling

KW - Spectrum allocation

UR - http://www.scopus.com/inward/record.url?scp=46549088685&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46549088685&partnerID=8YFLogxK

U2 - 10.1016/j.comnet.2008.03.010

DO - 10.1016/j.comnet.2008.03.010

M3 - Article

VL - 52

SP - 2148

EP - 2158

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 11

ER -