Sequential cooperative spectrum sensing in cognitive radio networks: Optimal selection of secondary users and their spectral measurements

L. Pillutla, Bhuvan Joshi
{"title":"Sequential cooperative spectrum sensing in cognitive radio networks: Optimal selection of secondary users and their spectral measurements","authors":"L. Pillutla, Bhuvan Joshi","doi":"10.1109/COMSNETS.2017.7945394","DOIUrl":null,"url":null,"abstract":"In this paper we consider the problem of spectrum sensing in cognitive radio networks which involves detection of primary (licensed) users (PUs) by secondary (unlicensed) users (SUs), who are interested in transmitting their data opportunistically. To facilitate accurate detection of PUs by the fusion center (FC) based on the energy measurements received from the chosen set of SUs, we formulate an optimization problem for selection of SUs and the number of samples they need to collect of the underlying spectrum. By assuming that the FC uses a sequential probability ratio test (SPRT) for performing spectrum sensing we formulate the problem of joint optimization over subset of SUs and the number of samples each of the SU in the chosen subset needs to collect, so that a composite cost function is maximized. For the computation of the optimal subset of SUs and the number of samples each SU has to collect we propose an algorithm based on DSO, in which optimization over the subset of SUs and the number of samples is done successively till convergence to the optimal set of values is achieved. Our simulation results demonstrate the efficacy of the proposed optimization approach based on SPRT as against that of a fixed sample size test at the FC. Specifically, the average number of samples required for an SPRT is much lower than that of a fixed sample size test for given values of probability of detection and probability of false alarm. The simulation results also confirm tracking ability of the proposed DSO based algorithms, in response to variations in the corresponding channel gains between the SUs and the FC.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2017.7945394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we consider the problem of spectrum sensing in cognitive radio networks which involves detection of primary (licensed) users (PUs) by secondary (unlicensed) users (SUs), who are interested in transmitting their data opportunistically. To facilitate accurate detection of PUs by the fusion center (FC) based on the energy measurements received from the chosen set of SUs, we formulate an optimization problem for selection of SUs and the number of samples they need to collect of the underlying spectrum. By assuming that the FC uses a sequential probability ratio test (SPRT) for performing spectrum sensing we formulate the problem of joint optimization over subset of SUs and the number of samples each of the SU in the chosen subset needs to collect, so that a composite cost function is maximized. For the computation of the optimal subset of SUs and the number of samples each SU has to collect we propose an algorithm based on DSO, in which optimization over the subset of SUs and the number of samples is done successively till convergence to the optimal set of values is achieved. Our simulation results demonstrate the efficacy of the proposed optimization approach based on SPRT as against that of a fixed sample size test at the FC. Specifically, the average number of samples required for an SPRT is much lower than that of a fixed sample size test for given values of probability of detection and probability of false alarm. The simulation results also confirm tracking ability of the proposed DSO based algorithms, in response to variations in the corresponding channel gains between the SUs and the FC.
认知无线电网络中的顺序协同频谱感知:二次用户的最佳选择及其频谱测量
在本文中,我们考虑了认知无线电网络中的频谱感知问题,该问题涉及到次要(未授权)用户(SUs)对主(许可)用户(pu)的检测,这些用户对机会主义地传输数据感兴趣。为了方便融合中心(FC)根据从所选的su集合接收到的能量测量准确检测pu,我们制定了一个su选择及其需要收集的底层光谱样品数量的优化问题。通过假设FC使用序列概率比测试(SPRT)进行频谱感知,我们制定了SU子集的联合优化问题以及所选子集中的每个SU需要收集的样本数量,从而使复合代价函数最大化。对于SU的最优子集和每个SU需要收集的样本数量的计算,我们提出了一种基于DSO的算法,该算法在SU的子集和样本数量上依次进行优化,直到收敛到最优值集。我们的仿真结果证明了所提出的基于SPRT的优化方法的有效性,而不是在FC进行固定样本量的测试。具体而言,对于给定的检测概率和虚警概率值,SPRT所需的平均样本数量远低于固定样本量的测试。仿真结果还证实了所提出的基于DSO的算法在响应su和FC之间相应信道增益变化时的跟踪能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信