Collaborative spectrum sharing based on information pooling for cognitive radio networks with channel heterogeneity

Longwei Wang, Xianfu Chen, Zhifeng Zhao, Honggang Zhang
{"title":"Collaborative spectrum sharing based on information pooling for cognitive radio networks with channel heterogeneity","authors":"Longwei Wang, Xianfu Chen, Zhifeng Zhao, Honggang Zhang","doi":"10.1109/ISCIT.2011.6092154","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the problem of multiuser channel selection in cognitive radio networks (CRN) with heterogenous channel availability. We consider a practical scenario where the channel availability statistics are unknown. Due to limited sensing capabilities, secondary users (SUs) can only sense partial of the channels. In this case, secondary users can collaboratively share their respective sensing results to gather enough information about the statistics of the unknown channels. By taking into account the competition among SUs, We formulate the problem of multiuser channel selection as an evolutionary game in which SUs make their decisions under replicator dynamics. Furthermore, we develop a decentralized channel selection algorithm based on learning automata, and prove that the replicator dynamics can converge to the evolutionary stable strategy efficiently. Simulation results show that our proposed learning algorithm helps SUs share the spectrum efficiently and the system throughput obtained outperforms that of the random access scheme.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2011.6092154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we investigate the problem of multiuser channel selection in cognitive radio networks (CRN) with heterogenous channel availability. We consider a practical scenario where the channel availability statistics are unknown. Due to limited sensing capabilities, secondary users (SUs) can only sense partial of the channels. In this case, secondary users can collaboratively share their respective sensing results to gather enough information about the statistics of the unknown channels. By taking into account the competition among SUs, We formulate the problem of multiuser channel selection as an evolutionary game in which SUs make their decisions under replicator dynamics. Furthermore, we develop a decentralized channel selection algorithm based on learning automata, and prove that the replicator dynamics can converge to the evolutionary stable strategy efficiently. Simulation results show that our proposed learning algorithm helps SUs share the spectrum efficiently and the system throughput obtained outperforms that of the random access scheme.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
信道异构认知无线网络中基于信息池的协同频谱共享
本文研究了具有异构信道可用性的认知无线网络(CRN)中的多用户信道选择问题。我们考虑一个实际场景,其中通道可用性统计数据是未知的。由于感应能力有限,辅助用户(su)只能感应部分信道。在这种情况下,辅助用户可以协作共享各自的感知结果,以收集有关未知通道统计信息的足够信息。考虑到用户之间的竞争,我们将多用户信道选择问题描述为一个进化博弈,其中用户在复制因子动力学下做出决策。在此基础上,提出了一种基于学习自动机的去中心化信道选择算法,并证明了复制器动态可以有效地收敛到进化稳定策略。仿真结果表明,所提出的学习算法有助于SUs有效地共享频谱,系统吞吐量优于随机接入方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Opportunistic routing in multi-channel cognitive radio networks Improved roughening algorithm and hardware implementation for particle filter applied to bearings-only tracking A design of smart radio research platform for universal access in a multi-RAT environment Distributed anomaly event detection in wireless networks using compressed sensing Constructing (k, r)-connected dominating sets for robust backbone in wireless sensor networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1