Improved list coloring algorithm in cognitive radio based on time cost and demand satisfaction
Yurong Qin, Hongmei Hu, Dongli Huang, Hao Lin · Radioelectronics and Communications Systems · 2013
For the cognitive users to access the licensed frequency bands opportunistically, cognitive radio is the best solution to mitigate the spectrum resource scarcity at the moment. Dynamic spectrum allocation is a key technology to implement cognitive radio efficiently on the condition that the licensed users must not be interfered. Up to now, the spectrum allocation algorithms based on the graph model seldom focus on enhancing spectrum utilization, speedy accomplishing and requirement satisfaction simultaneously. In this paper, an improved algorithm is proposed to decrease time cost and increase demand satisfaction simultaneously based on a List-Coloring algorithm provided by Wei Wang research group. This improved algorithm was studied by handling connected component in parallel and depressing user’s priority which demand has been met, respectively. And the spectrum utilization is effectively guaranteed at the same time. Our experimental results show that the proposed algorithm is an efficient method. Compared with the original List-Coloring algorithm, the time cost is reduced obviously and the demand satisfaction is greatly improved while only a few bandwidth rewards are lost by using the algorithm proposed in our study.