Spectrum allocation algorithm under the novel channel handover constraint in cognitive radio network
- 10.2991/csss-14.2014.159How to use a DOI?
- Cognitive radio; Markov process; spectrum allocation; channel handover; graph coloring theory
Dynamic spectrum (channel) allocation in cognitive radio network is the effective measure to solve the low utility of spectrum resource. Spectrum (channel) handover will degrade network performance and cause large amounts of energy consumption. This paper proposes a novel spectrum allocation algorithm to reduce the channel handover which allocates the channel that its conditional expectation is larger than the required slot that user’s data need be completely transmitted once to user. We firstly model the channel as first-order two-state Markov process and achieve the channel statistical characteristic. Then we construct the spectrum allocation optimization with the interference constraints, channel availability constraint and channel handover constraint, which is solved by the color-sensitive graph coloring theory. Simulation results show that the proposed algorithm can more effectively reduce the number of channel handover of cognitive users compared to the CSGC algorithm and RDA algorithm and can achieve the satisfying system bandwidth and fairness.
- © 2014, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Chen Kuangyu AU - Zeng Fanzi AU - Zeng Qingguang PY - 2014/06 DA - 2014/06 TI - Spectrum allocation algorithm under the novel channel handover constraint in cognitive radio network BT - Proceedings of the 3rd International Conference on Computer Science and Service System PB - Atlantis Press SP - 686 EP - 689 SN - 1951-6851 UR - https://doi.org/10.2991/csss-14.2014.159 DO - 10.2991/csss-14.2014.159 ID - Kuangyu2014/06 ER -