{"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.