2nd International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications

Research Article

Distributed Scheduling and Resource Allocation for Cognitive OFDMA Radios

  • @INPROCEEDINGS{10.1109/CROWNCOM.2007.4549822,
        author={Juan-Andres Bazerque and Georgios B. Giannakis},
        title={Distributed Scheduling and Resource Allocation for Cognitive OFDMA Radios},
        proceedings={2nd International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications},
        publisher={IEEE},
        proceedings_a={CROWNCOM},
        year={2008},
        month={6},
        keywords={Bandwidth  Chromium  Cognitive radio  Dynamic scheduling  Fading  Frequency conversion  Interference constraints  Iterative algorithms  Optimal scheduling  Resource management},
        doi={10.1109/CROWNCOM.2007.4549822}
    }
    
  • Juan-Andres Bazerque
    Georgios B. Giannakis
    Year: 2008
    Distributed Scheduling and Resource Allocation for Cognitive OFDMA Radios
    CROWNCOM
    IEEE
    DOI: 10.1109/CROWNCOM.2007.4549822
Juan-Andres Bazerque1,*, Georgios B. Giannakis1,*
  • 1: Dept. of ECE, Univ. of Minnesota Minneapolis, MN 55414, USA
*Contact email: bazer002@umn.edu, georgios@umn.edu

Abstract

Scheduling spectrum access and allocating power and rate resources are tasks affecting critically the performance of wireless cognitive radio (CR) networks. The present contribution develops a primal-dual optimization framework to schedule any-to-any CR communications based on orthogonal frequency division multiple access (OFDMA) and allocate power so as to maximize the weighted average sum-rate of all users. Fairness is ensured among CR communicators and possible hierarchies are respected by guaranteeing minimum rate requirements for primary users while allowing secondary users to access the spectrum opportunistically. The framework leads to an iterative channel-adaptive distributed algorithm whereby nodes rely only on local information exchanges with their neighbors to attain global optimality. Simulations confirm that the distributed online algorithm does not require knowledge of the underlying fading channel distribution and converges to the optimum almost surely from any initialization.