Joint Distributed Sensing and Channel Access in Cognitive Radio Networks

M. Santhoshkumar, Dony J. Muttath, K. Premkumar
{"title":"Joint Distributed Sensing and Channel Access in Cognitive Radio Networks","authors":"M. Santhoshkumar, Dony J. Muttath, K. Premkumar","doi":"10.1109/ANTS.2018.8710134","DOIUrl":null,"url":null,"abstract":"We consider a Cognitive Radio Network having one Primary User (PU) and N Secondary Users (SUs). In this paper, we study the problem of joint channel–sensing and channel– access for SUs. When the channel is in use by the PU, the signal that the PU sends and the channel fading gains are unknown to SUs. The channel sensing problem that we consider is detecting whether or not there is an unknown signal (with random fading) in noise. For this channel–sensing problem, we propose a sequential detection procedure based on the energy of samples that each SU observes. As soon as an SU detects the idle/busy state of the channel, it broadcasts it’s local decision to all other SUs. We propose a global decision rule that makes a decision that the channel is idle, only if at least $\\Gamma$ out of N SUs have broadcast idle local decisions; otherwise, the global decision rule makes a decision that the channel is busy. Also, the channel access is provided to the SU that is the first one to broadcast an idle decision. We study the detection and false-alarm performance of our proposed procedure, and compare the performance with that of Sequential Probability Ratio Test (SPRT) based sensing procedure. From the Receiver Operating Characteristic (ROC), and the average sample number (ASN) metrics, we observe that our energy based sequential sensing procedure yields a better probability of detection than the SPRT based procedure for a given probability of false-alarm. Also, as the threshold on the number of idle local decisions $\\Gamma$ increases, probability of detection also increases, but at the cost of detection delay.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2018.8710134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider a Cognitive Radio Network having one Primary User (PU) and N Secondary Users (SUs). In this paper, we study the problem of joint channel–sensing and channel– access for SUs. When the channel is in use by the PU, the signal that the PU sends and the channel fading gains are unknown to SUs. The channel sensing problem that we consider is detecting whether or not there is an unknown signal (with random fading) in noise. For this channel–sensing problem, we propose a sequential detection procedure based on the energy of samples that each SU observes. As soon as an SU detects the idle/busy state of the channel, it broadcasts it’s local decision to all other SUs. We propose a global decision rule that makes a decision that the channel is idle, only if at least $\Gamma$ out of N SUs have broadcast idle local decisions; otherwise, the global decision rule makes a decision that the channel is busy. Also, the channel access is provided to the SU that is the first one to broadcast an idle decision. We study the detection and false-alarm performance of our proposed procedure, and compare the performance with that of Sequential Probability Ratio Test (SPRT) based sensing procedure. From the Receiver Operating Characteristic (ROC), and the average sample number (ASN) metrics, we observe that our energy based sequential sensing procedure yields a better probability of detection than the SPRT based procedure for a given probability of false-alarm. Also, as the threshold on the number of idle local decisions $\Gamma$ increases, probability of detection also increases, but at the cost of detection delay.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
认知无线网络中的联合分布式感知和信道接入
我们考虑一个具有1个主用户(PU)和N个辅助用户(su)的认知无线网络。本文研究了SUs的联合信道感知和信道接入问题。当该信道被PU使用时,PU发送的信号和信道的衰落增益是su不知道的。我们考虑的信道感知问题是检测噪声中是否存在未知信号(随机衰落)。对于这个通道感知问题,我们提出了一个基于每个SU观察到的样本能量的顺序检测过程。一旦某个SU检测到通道的空闲/繁忙状态,它就会向所有其他SU广播它的本地决策。我们提出了一个全局决策规则,只有当N个单元中至少有$\Gamma$广播了空闲的本地决策时,才会做出信道空闲的决策;否则,全局决策规则将做出通道忙的决定。另外,将通道访问提供给第一个广播空闲决策的SU。研究了该方法的检测和虚警性能,并与基于序列概率比测试(SPRT)的感知方法进行了性能比较。从接收者工作特征(ROC)和平均样本数(ASN)度量中,我们观察到,对于给定的假警报概率,我们基于能量的顺序感知过程比基于SPRT的过程产生更好的检测概率。此外,随着空闲本地决策数量的阈值$\Gamma$的增加,检测的概率也会增加,但代价是检测延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cost-Efficient Resource Sharing in Ethernet-based 5G Mobile Fronthaul Networks Investigation of an Enhanced Efficiency Class-E Power Amplifier with Input Wave Shaping Network Edge Assisted DASH Video Caching Mechanism for Multi-access Edge Computing CMNS: An Energy-Efficient Communication Scheme for Wireless Sensor Networks Fast algorithm for Blind Deinterleaving of a Block Interleaver using binary and non-binary Block codes in a telecommunication system
×
引用
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