Fast multichannel spectrum scanning with multiple simultaneous observations

Raied Caromi, Yan Xin, L. Lai
{"title":"Fast multichannel spectrum scanning with multiple simultaneous observations","authors":"Raied Caromi, Yan Xin, L. Lai","doi":"10.1109/WCSP.2010.5634039","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of how to quickly and accurately scan a multichannel spectrum to determine the availability of each channel for a secondary user in a cognitive radio network. The secondary user is able to simultaneously observe more than one channel. We consider a sequential decision setup. After taking each sample, the secondary user should decide either to stop or continue scanning. If the secondary user decides to stop scanning, it then needs to make decisions on the busy/idle status of each channel. If the secondary user decides to continue scanning, it then needs to select a subset of the channels to sense. Two scenarios are investigated. In the first scenario, there is a strict delay constraint on the scanning process. That is, the spectrum scanning needs to be completed within a certain period of time. In the second scenario, there is no strict delay constraint. That is, the spectrum scanning continues until the completion of the detection process. In both scenarios, optimal algorithms for multichannel scanning with multiple simultaneous observations are developed to minimize a cost function that strikes a balance between detection error probabilities and detection delay. Low-complexity approximation schemes are also developed to reduce the complexity of the optimal schemes. Simulation examples are provided to illustrate the effectiveness of the proposed algorithms.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"190 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2010.5634039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper considers the problem of how to quickly and accurately scan a multichannel spectrum to determine the availability of each channel for a secondary user in a cognitive radio network. The secondary user is able to simultaneously observe more than one channel. We consider a sequential decision setup. After taking each sample, the secondary user should decide either to stop or continue scanning. If the secondary user decides to stop scanning, it then needs to make decisions on the busy/idle status of each channel. If the secondary user decides to continue scanning, it then needs to select a subset of the channels to sense. Two scenarios are investigated. In the first scenario, there is a strict delay constraint on the scanning process. That is, the spectrum scanning needs to be completed within a certain period of time. In the second scenario, there is no strict delay constraint. That is, the spectrum scanning continues until the completion of the detection process. In both scenarios, optimal algorithms for multichannel scanning with multiple simultaneous observations are developed to minimize a cost function that strikes a balance between detection error probabilities and detection delay. Low-complexity approximation schemes are also developed to reduce the complexity of the optimal schemes. Simulation examples are provided to illustrate the effectiveness of the proposed algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
快速多通道频谱扫描与多个同时观察
本文研究了认知无线网络中如何快速准确地扫描多信道频谱以确定每个信道对辅助用户的可用性的问题。辅助用户能够同时观察多个信道。我们考虑一个顺序决策设置。每次取样后,二次用户应决定是停止还是继续扫描。如果辅助用户决定停止扫描,那么它需要决定每个通道的忙/空闲状态。如果辅助用户决定继续扫描,那么它需要选择要感测的信道子集。研究了两种情况。在第一种场景中,扫描过程有严格的延迟约束。即需要在一定的时间内完成频谱扫描。在第二个场景中,没有严格的延迟约束。也就是说,频谱扫描一直持续到检测过程完成。在这两种情况下,开发了具有多个同时观测的多通道扫描的最佳算法,以最小化在检测错误概率和检测延迟之间取得平衡的代价函数。为了降低最优方案的复杂性,还开发了低复杂度近似方案。仿真实例验证了所提算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A novel MEO constellation for global communication without inter-satellite links Performance analysis of a selection cooperation scheme in multi-source multi-relay networks Efficient energy detector for spectrum sensing in complex Gaussian noise Compression of CQI feedback with compressive sensing in adaptive OFDM systems A BICM-MD-ID scheme in FFH system for combatting partial-band interference
×
引用
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