Maximal independent set based channel allocation algorithm in cognitive radios
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 chan...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
DOI: | 10.1109/YCICT.2009.5382422 |