• DocumentCode
    3391569
  • Title

    Time overhead and fairness in spectrum allocation for cognitive radio

  • Author

    Yutao, Liu ; Mengxiong, Jiang ; Xuezhi, Tan

  • Author_Institution
    Nat. Key Lab. of Sci. & Technol. on Inf. Transm. & Dissemination Technol. in Commun. Networks, Shijiazhuang, China
  • fYear
    2011
  • fDate
    17-19 Aug. 2011
  • Firstpage
    34
  • Lastpage
    38
  • Abstract
    The dynamic spectrum access technology can achieve near-optimal spectrum utilization by allowing cognitive users sense and utilize available spectrum opportunistically. Time overhead and fairness are part of the key evaluation criteria for the spectrum allocation algorithms, and a naive spectrum assignment can lead to significant unfairness and system overhead. In this paper, based on graph coloring model, the evaluation system and optimization goals are established. Aim at the poor fairness in the parallel algorithm, an improved algorithm is proposed. Without increasing time overhead, the improved parallel algorithm can improve the allocation fairness between cognitive users. Simulation and analysis prove this conclusion.
  • Keywords
    cognitive radio; graph colouring; allocation fairness; cognitive radio; cognitive users; dynamic spectrum access technology; graph coloring model; improved parallel algorithm; near-optimal spectrum utilization; spectrum allocation algorithms; spectrum assignment; time overhead; Approximation algorithms; Cognitive radio; Conferences; Interference; Optimization; Parallel algorithms; Resource management; cognitive radio; fairness; spectrum allocation; time overhead; utility;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications and Networking in China (CHINACOM), 2011 6th International ICST Conference on
  • Conference_Location
    Harbin
  • Print_ISBN
    978-1-4577-0100-9
  • Type

    conf

  • DOI
    10.1109/ChinaCom.2011.6158115
  • Filename
    6158115