4th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness

Research Article

Spectrum Allocation and Scheduling in Dynamic Spectrum Access Wireless Networks

  • @INPROCEEDINGS{10.1145/1577222.1577224,
        author={Jian Tang and Satyajayant Misra and Guoliang Xue},
        title={Spectrum Allocation and Scheduling in Dynamic Spectrum Access Wireless Networks},
        proceedings={4th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and  Robustness},
        publisher={ACM},
        proceedings_a={QSHINE},
        year={2007},
        month={8},
        keywords={Dynamic Spectrum Access Cognitive Radio Spectrum Al- location Scheduling Fairness.Algorithm Design Performance},
        doi={10.1145/1577222.1577224}
    }
    
  • Jian Tang
    Satyajayant Misra
    Guoliang Xue
    Year: 2007
    Spectrum Allocation and Scheduling in Dynamic Spectrum Access Wireless Networks
    QSHINE
    ACM
    DOI: 10.1145/1577222.1577224
Jian Tang1,*, Satyajayant Misra2,*, Guoliang Xue2,*
  • 1: Department of Computer Science Montana State University Bozeman, MT 59717-3880.
  • 2: Department of Computer Science and Engineering Arizona State University Tempe, AZ 85287-8809.
*Contact email: tang@cs.montana.edu, satyajayant@asu.edu, xue@asu.edu

Abstract

In this paper, we study the joint spectrum allocation and scheduling problems with the objectives of maximizing through- put and achieving certain fairness in Dynamic Spectrum Ac- cess (DSA) wireless networks. A novel Multi-Channel Con- tention Graph (MCCG) is proposed to characterize the im- pact of interference under the protocol interference model. Based on MCCG, we present an optimal scheme to com- pute maximum throughput solutions. As simply maximizing throughput may result in a severe bias on resource alloca- tion, we take fairness into consideration by presenting opti- mal schemes to compute fair solutions based on a simplifed max-min fairness model and the well-known proportional fairness model. Fast and effective heuristics are also pro- posed to provide high throughput and fair solutions. Numer- ical results show that compared with the optimal schemes, our heuristic schemes produce very close performance and our proportional fair schemes achieve a good tradeoff be- tween throughput and fairness. In addition, we extend our research to the physical interference model.