A Low Complexity Sub-Optimal Approach to Dynamic Spectrum Allocation for White Space Devices With Heterogeneous Bandwidth Requirements

This letter considers the decision-making method of dynamic spectrum allocation by a spectrum manager in a centralized white space cognitive radio communication network with various available frequency fragments and heterogeneous bandwidth requests. To achieve low complexity practical solution to this problem, we propose a hybrid sub-optimal dynamic programming-based algorithm. The performance of the proposed solution is compared with the optimal one and other alternative solutions. The numeric results show that the proposed solution achieves spectrum efficiency close to the optimal one and the complexity is considerably reduced to O((n+λ -1)!/(n!(λ -1)!)) as compared with that of the optimal solution O(Π
_i=1
ⁿ
B
₀
⁽ⁱ⁾
).