Aware channel assignment algorithm for cognitive networks

V. Gardellin, L. Lenzini, Valentina Fontana
{"title":"Aware channel assignment algorithm for cognitive networks","authors":"V. Gardellin, L. Lenzini, Valentina Fontana","doi":"10.1145/2030678.2030682","DOIUrl":null,"url":null,"abstract":"Several recent studies have shown that Cognitive Networks (CNs) can effectively address the spectrum shortage problem in wireless networks, which is mainly caused by the increasing number of wireless services and applications operating in unlicensed channels. However, these studies fail to consider the differences between channel characteristics, i.e. they do not consider that channels are on different frequencies.\n In this paper, we fill this gap by providing a technique that classifies channels based on their operating frequency. We enable each cognitive device to choose the best channel depending on its traffic demand. We focus on the IEEE 802.22 physical layer in order to analyze and classify channels, and we propose the aware channel assignment algorithm for cognitive networks (Aaron). Aaron assigns channels to cognitive devices with the goal of satisfying the capacity demand of the largest number of end-users in order to maximize the throughput.\n We evaluate Aaron using an ad-hoc event-driven simulator for CNs. In addition we compare it with the Dumb algorithm, where cognitive devices are not able to characterize channels, and with the Upper Bound, where no packet is lost due to the channel assignment algorithm. Simulation studies demonstrate that Aaron performs considerably better than Dumb and very close to the Upper Bound.","PeriodicalId":202655,"journal":{"name":"CoRoNet '11","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CoRoNet '11","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2030678.2030682","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Several recent studies have shown that Cognitive Networks (CNs) can effectively address the spectrum shortage problem in wireless networks, which is mainly caused by the increasing number of wireless services and applications operating in unlicensed channels. However, these studies fail to consider the differences between channel characteristics, i.e. they do not consider that channels are on different frequencies. In this paper, we fill this gap by providing a technique that classifies channels based on their operating frequency. We enable each cognitive device to choose the best channel depending on its traffic demand. We focus on the IEEE 802.22 physical layer in order to analyze and classify channels, and we propose the aware channel assignment algorithm for cognitive networks (Aaron). Aaron assigns channels to cognitive devices with the goal of satisfying the capacity demand of the largest number of end-users in order to maximize the throughput. We evaluate Aaron using an ad-hoc event-driven simulator for CNs. In addition we compare it with the Dumb algorithm, where cognitive devices are not able to characterize channels, and with the Upper Bound, where no packet is lost due to the channel assignment algorithm. Simulation studies demonstrate that Aaron performs considerably better than Dumb and very close to the Upper Bound.
认知网络的感知信道分配算法
最近的一些研究表明,认知网络(CNs)可以有效地解决无线网络中的频谱短缺问题,这主要是由于无线业务和应用数量的增加而导致的。然而,这些研究没有考虑到信道特性之间的差异,即没有考虑到信道在不同的频率上。在本文中,我们通过提供一种基于其工作频率对信道进行分类的技术来填补这一空白。我们使每个认知设备能够根据其流量需求选择最佳信道。针对IEEE 802.22物理层对信道进行分析和分类,提出了面向认知网络的感知信道分配算法(Aaron)。Aaron为认知设备分配通道,目标是满足最大数量的最终用户的容量需求,以最大限度地提高吞吐量。我们用一个特别的事件驱动模拟器来评估Aaron。此外,我们将其与Dumb算法进行比较,其中认知设备无法表征信道,并与Upper Bound进行比较,其中由于信道分配算法,没有数据包丢失。仿真研究表明,Aaron的表现比Dumb好得多,并且非常接近上限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信