6th International ICST Symposium on Modeling and Optimization

Research Article

Optimal Medium Access Protocols for Cognitive Radio Networks

Download424 downloads
  • @INPROCEEDINGS{10.4108/ICST.WIOPT2008.3180,
        author={Lifeng Lai and Hesham El Gamal and Hai Jiang and H. Vincent  Poor},
        title={Optimal Medium Access Protocols for Cognitive Radio Networks},
        proceedings={6th International ICST Symposium on Modeling and Optimization},
        publisher={IEEE},
        proceedings_a={WIOPT},
        year={2008},
        month={8},
        keywords={Access protocols Cognitive radio Computational complexity Frequency Media Access Protocol Probability Probes Telecommunication traffic Throughput Wireless networks},
        doi={10.4108/ICST.WIOPT2008.3180}
    }
    
  • Lifeng Lai
    Hesham El Gamal
    Hai Jiang
    H. Vincent Poor
    Year: 2008
    Optimal Medium Access Protocols for Cognitive Radio Networks
    WIOPT
    IEEE
    DOI: 10.4108/ICST.WIOPT2008.3180
Lifeng Lai1,*, Hesham El Gamal2,*, Hai Jiang3,*, H. Vincent Poor1,*
  • 1: Department of Electrical Engineering, Princeton University.
  • 2: Department of Electrical and Computer Engineering, Ohio State University
  • 3: Department of Electrical and Computer Engineering, University of Alberta.
*Contact email: llai@princeton.edu, helgamal@ece.osu.edu, hai.jiang@ece.ualberta.ca, poorg@princeton.edu

Abstract

This paper focuses on the design of medium access control protocols for cognitive radio networks. The scenario in which a single cognitive user wishes to opportunistically exploit the availability of empty frequency bands within parts of the radio spectrum having multiple bands is first considered. In this scenario, the availability probability of each channel is unknown a priori to the cognitive user. Hence efficient medium access strategies must strike a balance between exploring (learning) the availability probability of the channels and exploiting the knowledge of the availability probability identified thus far. For this scenario, an optimal medium access strategy is derived and its underlying recursive structure is illustrated via examples. To avoid the prohibitive computational complexity of this optimal strategy, a low complexity asymptotically optimal strategy is developed. Next, the multi-cognitive user scenario is considered and low complexity medium access protocols, which strike an optimal balance between exploration and exploitation in such competitive environments, are developed.