DocumentCode
3134851
Title
Maximal independent set based channel allocation algorithm in cognitive radios
Author
Liu Yutao ; Mengxiong, Jiang ; Tan Xuezhi ; Lu, Fan
Author_Institution
Commun. Res. Center, Harbin Inst. of Technol., Harbin, China
fYear
2009
fDate
20-21 Sept. 2009
Firstpage
78
Lastpage
81
Abstract
An expanding model based on graph coloring is built for channel allocation, which is more suitable to the actual requirement of cognitive radios. Several representative channel allocation algorithms are analyzed contrastively, including list-coloring greedy algorithm and fair algorithm. A novel channel allocation algorithm using Maximal Independent Set (MIS) is proposed aiming at the characteristic and request of the cognitive radio systems. When taking no account of the spectrum diversity, this algorithm can give consideration to both utilization and fairness of channel allocation. Meanwhile, it can reduce the convergence time and the communication overhead. At last, simulation analysis and comparison are given about the average spectrum utilization, fairness and communication overhead, and the results demonstrate the efficiency for the conclusions.
Keywords
channel allocation; cognitive radio; diversity reception; graph colouring; greedy algorithms; cognitive radio; fair algorithm; graph coloring; list coloring greedy algorithm; maximal independent set based channel allocation algorithm; spectrum diversity; Algorithm design and analysis; Analytical models; Channel allocation; Cognitive radio; Convergence; Graph theory; Greedy algorithms; Interference; Power system modeling; Radio spectrum management; Cognitive radio; graph theory; maximal independent set; spectrum allocation;
fLanguage
English
Publisher
ieee
Conference_Titel
Information, Computing and Telecommunication, 2009. YC-ICT '09. IEEE Youth Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-5074-9
Electronic_ISBN
978-1-4244-5076-3
Type
conf
DOI
10.1109/YCICT.2009.5382422
Filename
5382422
Link To Document