An Improved Channal Allocation Algorithm Based on List-coloring

被引:0
|
作者
Lin Yuqing [1 ]
Zhu Qi [1 ]
Cai Lili [1 ]
机构
[1] Nanjing Univ Posts & Telecommun, Jiangsu Key Lab Wireless Commun, Nanjing 210003, Jiangsu, Peoples R China
关键词
channel allocation; list coloring; priority mechanism; feed-back loop of call failingl probability(CFP); fairness; RADIO;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cognitive radio makes it possible for an unlicensed user to access a licensed spectrum opportunistically on the basis of non-interfering. In this paper, a novel version of list-coloring based channel allocation is proposed. The concept of priority is defined to guarantee the fairness of channel allocation. Moreover, the feed-back loop of call failing probability (CFP) is introduced to deepen the extent of fairness during channel allocation. It is shown by simulations that the proposed channel allocation strategies can achieve both substantial fairness gain and nice spectrum utilization as compared with the original list-coloring based channel allocation methods.
引用
收藏
页数:4
相关论文
共 50 条
  • [1] Between coloring and list-coloring: μ-coloring
    Bonomo, Flavia
    Cecowski Palacio, Mariano
    [J]. ARS COMBINATORIA, 2011, 99 : 383 - 398
  • [2] The analysis of a list-coloring algorithm on a random graph
    Achlioptas, D
    Molloy, M
    [J]. 38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 204 - 212
  • [3] On a list-coloring problem
    Gravier, S
    Maffray, F
    Mohar, B
    [J]. DISCRETE MATHEMATICS, 2003, 268 (1-3) : 303 - 308
  • [4] List-coloring based channel allocation for open-spectrum wireless networks
    Wang, W
    Liu, X
    [J]. VTC2005-FALL: 2005 IEEE 62ND VEHICULAR TECHNOLOGY CONFERENCE, 1-4, PROCEEDINGS, 2005, : 690 - 694
  • [5] Some (in)tractable Parameterizations of Coloring and List-Coloring
    Arora, Pranav
    Banik, Aritra
    Paliwal, Vijay Kumar
    Raman, Venkatesh
    [J]. FRONTIERS IN ALGORITHMICS (FAW 2018), 2018, 10823 : 126 - 139
  • [6] On list-coloring outerplanar graphs
    Hutchinson, Joan P.
    [J]. JOURNAL OF GRAPH THEORY, 2008, 59 (01) : 59 - 74
  • [7] List-coloring embedded graphs
    Dvorak, Zdenek
    Kawarabayashi, Ken-ichi
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1004 - 1012
  • [8] On the complexity of a restricted list-coloring problem
    Dror, M
    Finke, G
    Gravier, S
    Kubiak, W
    [J]. DISCRETE MATHEMATICS, 1999, 195 (1-3) : 103 - 109
  • [9] Exploring the complexity boundary between coloring and list-coloring
    Flavia Bonomo
    Guillermo Durán
    Javier Marenco
    [J]. Annals of Operations Research, 2009, 169 : 3 - 16
  • [10] Exploring the complexity boundary between coloring and list-coloring
    Bonomo, Flavia
    Duran, Guillermo
    Marenco, Javier
    [J]. ANNALS OF OPERATIONS RESEARCH, 2009, 169 (01) : 3 - 16