Maximal independent set based channel allocation algorithm in cognitive radios

Yutao Liu, Jiang Mengxiong, Xuezhi Tan, Fanlei Lu
{"title":"Maximal independent set based channel allocation algorithm in cognitive radios","authors":"Yutao Liu, Jiang Mengxiong, Xuezhi Tan, Fanlei Lu","doi":"10.1109/YCICT.2009.5382422","DOIUrl":null,"url":null,"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 comparation are given about the average spectrum utilization, fairness and communication overhead, and the results demonstrate the efficiency for the conclusions.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2009.5382422","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

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 comparation are given about the average spectrum utilization, fairness and communication overhead, and the results demonstrate the efficiency for the conclusions.
基于最大独立集的认知无线电信道分配算法
建立了一种基于图着色的信道分配扩展模型,该模型更适合认知无线电的实际需求。对比分析了几种代表性的信道分配算法,包括列表着色贪心算法和公平算法。针对认知无线电系统的特点和要求,提出了一种基于最大独立集的信道分配算法。在不考虑频谱分集的情况下,该算法兼顾了信道分配的利用率和公平性。同时减少了收敛时间和通信开销。最后,对平均频谱利用率、公平性和通信开销进行了仿真分析和比较,结果证明了所得结论的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信