IID和非相同信道认知无线电的最优顺序信道感知

A. Patel
{"title":"IID和非相同信道认知无线电的最优顺序信道感知","authors":"A. Patel","doi":"10.1109/NCC.2018.8600229","DOIUrl":null,"url":null,"abstract":"In this paper, we consider an unlicensed or Secondary User (SU) that performs sequential spectrum sensing of channels in the band of the licensed or the Primary user (PU). The sensing not only decides the availability of the channel but also measures its strength. Using these two attributes for a channel (as state) the SU decides either to stop sensing, use a channel and obtain a reward or to continue sensing at a cost in the hope of achieving a channel with better attributes. We aim to find a stopping rule such that an expected reward over a finite duration of time for the SU is maximized. We model our problem in the elegant framework of an optimal stopping problem (OSP). We consider two scenarios, (i) where the channel states are independent and identically distributed (iid) over the channels and (ii) where channel states are independent but not identically distributed over the channels. It is shown that the optimal solution for the first scenario is a simple threshold based policy. Moreover, for the second scenario we extend the results of the first scenario and propose an optimal sensing order and sensing rule based on multiple thresholds, which is also easy to implement.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Sequential Channel Sensing for Cognitive Radios for IID and Non-Identical Channels\",\"authors\":\"A. Patel\",\"doi\":\"10.1109/NCC.2018.8600229\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider an unlicensed or Secondary User (SU) that performs sequential spectrum sensing of channels in the band of the licensed or the Primary user (PU). The sensing not only decides the availability of the channel but also measures its strength. Using these two attributes for a channel (as state) the SU decides either to stop sensing, use a channel and obtain a reward or to continue sensing at a cost in the hope of achieving a channel with better attributes. We aim to find a stopping rule such that an expected reward over a finite duration of time for the SU is maximized. We model our problem in the elegant framework of an optimal stopping problem (OSP). We consider two scenarios, (i) where the channel states are independent and identically distributed (iid) over the channels and (ii) where channel states are independent but not identically distributed over the channels. It is shown that the optimal solution for the first scenario is a simple threshold based policy. Moreover, for the second scenario we extend the results of the first scenario and propose an optimal sensing order and sensing rule based on multiple thresholds, which is also easy to implement.\",\"PeriodicalId\":121544,\"journal\":{\"name\":\"2018 Twenty Fourth National Conference on Communications (NCC)\",\"volume\":\"82 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Twenty Fourth National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2018.8600229\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Twenty Fourth National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2018.8600229","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们考虑一个未授权或辅助用户(SU),它在授权或主用户(PU)的频带中执行顺序频谱感知信道。感知不仅决定了信道的可用性,而且还测量了信道的强度。使用通道的这两个属性(作为状态),SU决定停止感知,使用通道并获得奖励,或者以代价继续感知,希望获得具有更好属性的通道。我们的目标是找到一个停止规则,使SU在有限时间内的预期奖励最大化。我们在最优停止问题(OSP)的优雅框架中对问题进行建模。我们考虑两种情况,(i)通道状态独立且在通道上相同分布(iid), (ii)通道状态独立但在通道上不相同分布。结果表明,第一个场景的最优解决方案是一个简单的基于阈值的策略。此外,对于第二种场景,我们扩展了第一种场景的结果,并提出了一种基于多阈值的最优感知顺序和感知规则,该规则也易于实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Sequential Channel Sensing for Cognitive Radios for IID and Non-Identical Channels
In this paper, we consider an unlicensed or Secondary User (SU) that performs sequential spectrum sensing of channels in the band of the licensed or the Primary user (PU). The sensing not only decides the availability of the channel but also measures its strength. Using these two attributes for a channel (as state) the SU decides either to stop sensing, use a channel and obtain a reward or to continue sensing at a cost in the hope of achieving a channel with better attributes. We aim to find a stopping rule such that an expected reward over a finite duration of time for the SU is maximized. We model our problem in the elegant framework of an optimal stopping problem (OSP). We consider two scenarios, (i) where the channel states are independent and identically distributed (iid) over the channels and (ii) where channel states are independent but not identically distributed over the channels. It is shown that the optimal solution for the first scenario is a simple threshold based policy. Moreover, for the second scenario we extend the results of the first scenario and propose an optimal sensing order and sensing rule based on multiple thresholds, which is also easy to implement.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信