Open AccessGlobal proportional fairness scheduling algorithm based on spectrum aggregation in cognitive radio
Author(s) -
Cong Yin,
Xuezhi Tan,
Lin Ma,
Yang Yu
Publication year - 2014
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.63.118402
Subject(s) - computer science , cognitive radio , fairness measure , maximum throughput scheduling , proportionally fair , scheduling (production processes) , queue , dynamic priority scheduling , algorithm , fair queuing , max min fairness , round robin scheduling , fair share scheduling , distributed computing , throughput , quality of service , computer network , mathematical optimization , resource allocation , wireless , telecommunications , mathematics
In a cognitive radio system, it is still a problem that resource scheduling among secondary users (SUs) is distributed unfairly when spectrum aggregation technology is involved to support high-speed data transmission. A global proportional fair scheduling algorithm is proposed based on spectrum aggregation to solve the problem. This paper focuses on the relation between the fairness for SUs and spectrum aggregation. Throughput fairness can be guaranteed as much as possible after considering two parameters, the span of spectrum aggregation and the remaining data queue length of SUs. Simulation results show that the proposed scheduling algorithm takes advantage of fairness and the delay of system service as compared with the other two scheduling algorithms, max C/I and partial proportional fairness. Meanwhile, it is shown that the proposed scheduling algorithm has lower throughput shake to make sure of fairness among SUs and high efficiency of system.