{"title":"认知无线网络中的主要用户检测采用最快的检测方法","authors":"Muhammad Sajjad Khan, Insoo Koo","doi":"10.1109/C-CODE.2017.7918891","DOIUrl":null,"url":null,"abstract":"Spectrum sensing is one of the key functionalities in cognitive radio (CR) which enables opportunistic spectrum access. How to promptly sense the presence of the primary user (PU) is a key issue to CR network. The quick detection of the PU is critical such that violation of the detection on time will cause an interference to the PU. Particularly the spectrum sensing can be evaluated by how quickly it detect the changes. This involves detecting reliably and quickly possibly weak primary user signal. In this work, we propose a cluster based quickest change detection algorithm for the spectrum sensing. The Proposed scheme utilizes one-sided CUSUM (cumulative sum) algorithm at the user level, and proposed an algorithm at the cluster level which maintain 1-slot history of the user at the cluster head (CH), which also helps in detecting the change at the cluster level. CH only collect data from the users which observe change in their slot. By exploiting the advantage of one-sided CUSUM algorithm with cluster-based approach, the proposed scheme achieve the minimum detection delay subject to false alarm constraint. With simulation results, we demonstrate that the proposed scheme has faster detection as compare to conventional detection scheme.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Primary user detection in cognitive radio networks through quickest detection\",\"authors\":\"Muhammad Sajjad Khan, Insoo Koo\",\"doi\":\"10.1109/C-CODE.2017.7918891\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Spectrum sensing is one of the key functionalities in cognitive radio (CR) which enables opportunistic spectrum access. How to promptly sense the presence of the primary user (PU) is a key issue to CR network. The quick detection of the PU is critical such that violation of the detection on time will cause an interference to the PU. Particularly the spectrum sensing can be evaluated by how quickly it detect the changes. This involves detecting reliably and quickly possibly weak primary user signal. In this work, we propose a cluster based quickest change detection algorithm for the spectrum sensing. The Proposed scheme utilizes one-sided CUSUM (cumulative sum) algorithm at the user level, and proposed an algorithm at the cluster level which maintain 1-slot history of the user at the cluster head (CH), which also helps in detecting the change at the cluster level. CH only collect data from the users which observe change in their slot. By exploiting the advantage of one-sided CUSUM algorithm with cluster-based approach, the proposed scheme achieve the minimum detection delay subject to false alarm constraint. With simulation results, we demonstrate that the proposed scheme has faster detection as compare to conventional detection scheme.\",\"PeriodicalId\":344222,\"journal\":{\"name\":\"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/C-CODE.2017.7918891\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/C-CODE.2017.7918891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Primary user detection in cognitive radio networks through quickest detection
Spectrum sensing is one of the key functionalities in cognitive radio (CR) which enables opportunistic spectrum access. How to promptly sense the presence of the primary user (PU) is a key issue to CR network. The quick detection of the PU is critical such that violation of the detection on time will cause an interference to the PU. Particularly the spectrum sensing can be evaluated by how quickly it detect the changes. This involves detecting reliably and quickly possibly weak primary user signal. In this work, we propose a cluster based quickest change detection algorithm for the spectrum sensing. The Proposed scheme utilizes one-sided CUSUM (cumulative sum) algorithm at the user level, and proposed an algorithm at the cluster level which maintain 1-slot history of the user at the cluster head (CH), which also helps in detecting the change at the cluster level. CH only collect data from the users which observe change in their slot. By exploiting the advantage of one-sided CUSUM algorithm with cluster-based approach, the proposed scheme achieve the minimum detection delay subject to false alarm constraint. With simulation results, we demonstrate that the proposed scheme has faster detection as compare to conventional detection scheme.