4th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications

Research Article

Interference-throughput tradeoff in dynamic spectrum access: Analysis based on discrete-time queuing subjected to bursty preemption

  • @INPROCEEDINGS{10.1109/CROWNCOM.2009.5188938,
        author={Yuhua  Xu and Jinlong Wang and Qihui Wu  Wu},
        title={Interference-throughput tradeoff in dynamic spectrum access: Analysis based on discrete-time queuing subjected to bursty preemption},
        proceedings={4th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications},
        publisher={IEEE},
        proceedings_a={CROWNCOM},
        year={2009},
        month={8},
        keywords={Dynamic spectrum access; discrete-time queuing;  preemption priority},
        doi={10.1109/CROWNCOM.2009.5188938}
    }
    
  • Yuhua Xu
    Jinlong Wang
    Qihui Wu Wu
    Year: 2009
    Interference-throughput tradeoff in dynamic spectrum access: Analysis based on discrete-time queuing subjected to bursty preemption
    CROWNCOM
    IEEE
    DOI: 10.1109/CROWNCOM.2009.5188938
Yuhua Xu1,2,*, Jinlong Wang1,3, Qihui Wu Wu1,3
  • 1: Institute of Communications Engineering, PLA University of Science and Technology
  • 2: Nanjing, P.R China.
  • 3: Nanjing, P.R China
*Contact email: yuhuaenator@gmail.com

Abstract

This article considers the issue of dynamic spectrum access in time domain, in which the secondary user seeks spectrum vacancy between bursty transmissions of the primary user to communicate. Since spectrum sensing and data transmission can not be done simultaneously in the same band, the secondary user should employ the sense-then-transmit strategy to detect the presence of primary user before accessing the licensed band. We model the behavior of the secondary user as a discrete-time queuing subjected to bursty preemption, which is an abstraction of temporal channel unavailability due to the random presence of the primary user. We formulate an interference-throughput tradeoff problem under the discrete-time queuing framework, and find the optimal slot duration to maximize the throughput of the secondary user, yet to ensure the primary interfered time ratio (PITR) is less than a tolerable threshold. Finally, the computer simulation results validate our theoretical approach.