适应主要网络条件的动态频谱接入分布式随机学习

M. Zandi, Min Dong, A. Grami
{"title":"适应主要网络条件的动态频谱接入分布式随机学习","authors":"M. Zandi, Min Dong, A. Grami","doi":"10.1109/SPAWC.2014.6941869","DOIUrl":null,"url":null,"abstract":"We consider the problem of decentralized online learning and channel access among M secondary users (SUs) in a cognitive radio network. We aim at designing an adaptive policy that can effectively respond to different primary network conditions. By applying stochastic learning automata, we propose an adaptive decentralized access policy. Each SU probabilistically chooses one of the M-best channels to access. The channel selection probability is then updated based on collision events. Our proposed adaptive policy utilizes two underlying distributed learning algorithms: one is to learn from sensing history on the primary channel availability, and the other is to learn from collision history on channel selections among SUs to avoid further collision. Some previously proposed distributed access policies can be viewed as special cases of our proposed adaptive policy, with a set of pre-set channel selection probabilities. Simulation results demonstrate the effectiveness of our proposed adaptive policy in various distributions of mean channel availabilities across primary channels, as compared with other existing policies.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed stochastic learning for dynamic spectrum access adaptive to primary network conditions\",\"authors\":\"M. Zandi, Min Dong, A. Grami\",\"doi\":\"10.1109/SPAWC.2014.6941869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of decentralized online learning and channel access among M secondary users (SUs) in a cognitive radio network. We aim at designing an adaptive policy that can effectively respond to different primary network conditions. By applying stochastic learning automata, we propose an adaptive decentralized access policy. Each SU probabilistically chooses one of the M-best channels to access. The channel selection probability is then updated based on collision events. Our proposed adaptive policy utilizes two underlying distributed learning algorithms: one is to learn from sensing history on the primary channel availability, and the other is to learn from collision history on channel selections among SUs to avoid further collision. Some previously proposed distributed access policies can be viewed as special cases of our proposed adaptive policy, with a set of pre-set channel selection probabilities. Simulation results demonstrate the effectiveness of our proposed adaptive policy in various distributions of mean channel availabilities across primary channels, as compared with other existing policies.\",\"PeriodicalId\":420837,\"journal\":{\"name\":\"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"volume\":\"222 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2014.6941869\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2014.6941869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

研究了认知无线网络中M个辅助用户(su)之间的分散在线学习和信道访问问题。我们的目标是设计一种能够有效响应不同主要网络条件的自适应策略。利用随机学习自动机,提出了一种自适应分散访问策略。每个SU都可能从m个最佳信道中选择一个来访问。然后根据碰撞事件更新通道选择概率。我们提出的自适应策略利用了两种底层分布式学习算法:一种是从主通道可用性的感知历史中学习,另一种是从SUs之间通道选择的冲突历史中学习,以避免进一步的冲突。一些先前提出的分布式访问策略可以看作是我们提出的自适应策略的特殊情况,具有一组预先设置的信道选择概率。仿真结果表明,与其他现有策略相比,我们提出的自适应策略在主信道平均可用性的各种分布下是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed stochastic learning for dynamic spectrum access adaptive to primary network conditions
We consider the problem of decentralized online learning and channel access among M secondary users (SUs) in a cognitive radio network. We aim at designing an adaptive policy that can effectively respond to different primary network conditions. By applying stochastic learning automata, we propose an adaptive decentralized access policy. Each SU probabilistically chooses one of the M-best channels to access. The channel selection probability is then updated based on collision events. Our proposed adaptive policy utilizes two underlying distributed learning algorithms: one is to learn from sensing history on the primary channel availability, and the other is to learn from collision history on channel selections among SUs to avoid further collision. Some previously proposed distributed access policies can be viewed as special cases of our proposed adaptive policy, with a set of pre-set channel selection probabilities. Simulation results demonstrate the effectiveness of our proposed adaptive policy in various distributions of mean channel availabilities across primary channels, as compared with other existing policies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信