Incremental cooperative spectrum sensing algorithm with n-out-of-K fusion rule
The algorithm divided the total relays into two subsections.The front subsection included N number of relays,and the later one included K−N number of relays.Firstly,the front N relays sensed the spectrum.If no more than m<sub>L</sub> number of relays had detected the existing of the prim...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-11-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2012.z2.014/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539843737255936 |
|---|---|
| author | Xiao-ge ZHANG Shi-bing ZHANG Gong-an QIU |
| author_facet | Xiao-ge ZHANG Shi-bing ZHANG Gong-an QIU |
| author_sort | Xiao-ge ZHANG |
| collection | DOAJ |
| description | The algorithm divided the total relays into two subsections.The front subsection included N number of relays,and the later one included K−N number of relays.Firstly,the front N relays sensed the spectrum.If no more than m<sub>L</sub> number of relays had detected the existing of the primary user,the global detection was that the spectrum holes existed.If more than m<sub>H</sub> number of relays had detected the existing of the primary user,the global detection was that no spectrum holes existed.Otherwise,the later K−N number of relays continued to sense the spectrum.The global detection was that the spectrum holes existed only when there were totally over n number of relays having detected the existing of the primary user in the two sensing stages.The object function was built for minimizing the time-slot consumption by adjusting the parameters m<sub>L</sub>,m<sub>H</sub> and N with the limit of detection probability and false probability.Simulation results show that the proposed incremental cooperative spectrum sensing algorithm has much lower time-slot consumption than the traditional one by properly setting the parameters with high sensing performance kept. |
| format | Article |
| id | doaj-art-d92ed2e9cbb64d929fd43f6936e35103 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2012-11-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-d92ed2e9cbb64d929fd43f6936e351032025-01-14T06:34:24ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2012-11-013311111759669784Incremental cooperative spectrum sensing algorithm with n-out-of-K fusion ruleXiao-ge ZHANGShi-bing ZHANGGong-an QIUThe algorithm divided the total relays into two subsections.The front subsection included N number of relays,and the later one included K−N number of relays.Firstly,the front N relays sensed the spectrum.If no more than m<sub>L</sub> number of relays had detected the existing of the primary user,the global detection was that the spectrum holes existed.If more than m<sub>H</sub> number of relays had detected the existing of the primary user,the global detection was that no spectrum holes existed.Otherwise,the later K−N number of relays continued to sense the spectrum.The global detection was that the spectrum holes existed only when there were totally over n number of relays having detected the existing of the primary user in the two sensing stages.The object function was built for minimizing the time-slot consumption by adjusting the parameters m<sub>L</sub>,m<sub>H</sub> and N with the limit of detection probability and false probability.Simulation results show that the proposed incremental cooperative spectrum sensing algorithm has much lower time-slot consumption than the traditional one by properly setting the parameters with high sensing performance kept.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2012.z2.014/cognitive radiospectrum sensingincremental cooperativetime-slot consumption |
| spellingShingle | Xiao-ge ZHANG Shi-bing ZHANG Gong-an QIU Incremental cooperative spectrum sensing algorithm with n-out-of-K fusion rule Tongxin xuebao cognitive radio spectrum sensing incremental cooperative time-slot consumption |
| title | Incremental cooperative spectrum sensing algorithm with n-out-of-K fusion rule |
| title_full | Incremental cooperative spectrum sensing algorithm with n-out-of-K fusion rule |
| title_fullStr | Incremental cooperative spectrum sensing algorithm with n-out-of-K fusion rule |
| title_full_unstemmed | Incremental cooperative spectrum sensing algorithm with n-out-of-K fusion rule |
| title_short | Incremental cooperative spectrum sensing algorithm with n-out-of-K fusion rule |
| title_sort | incremental cooperative spectrum sensing algorithm with n out of k fusion rule |
| topic | cognitive radio spectrum sensing incremental cooperative time-slot consumption |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2012.z2.014/ |
| work_keys_str_mv | AT xiaogezhang incrementalcooperativespectrumsensingalgorithmwithnoutofkfusionrule AT shibingzhang incrementalcooperativespectrumsensingalgorithmwithnoutofkfusionrule AT gonganqiu incrementalcooperativespectrumsensingalgorithmwithnoutofkfusionrule |