z-logo
open-access-imgOpen Access
Cluster‐based distributed cooperative spectrum sensing over Nakagami fading using diversity reception
Author(s) -
Sharma Girraj,
Sharma Ritu
Publication year - 2019
Publication title -
iet networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.466
H-Index - 21
eISSN - 2047-4962
pISSN - 2047-4954
DOI - 10.1049/iet-net.2018.5002
Subject(s) - nakagami distribution , fading , cognitive radio , computer science , false alarm , maximal ratio combining , cluster analysis , fusion center , fusion rules , channel (broadcasting) , wireless , algorithm , electronic engineering , computer network , telecommunications , engineering , artificial intelligence , image (mathematics) , image fusion
Cooperative spectrum sensing (CSS) can solve the problem of hidden terminal in cognitive radio (CR). CSS can be employed in two ways distributed and centralised. In wireless networking, clustering can provide network scalability, better resource allocation, and energy efficiency. Here, cluster‐based distributed CSS is investigated over Nakagami channel. In the proposed scheme, four fusion policies OR–OR, OR–AND, AND–OR, and AND–AND are investigated. An analytical framework has been presented to evaluate different parameters related to spectrum sensing, i.e. detection probability, false alarm probability, and missed detection probability for Nakagami fading channel. On the basis of the developed framework, the performance of cluster‐based distributed CSS has been compared with the centralised CSS. Results show that OR–OR fusion rule of the cluster‐based distributed CSS outperforms other fusion rules and centralised CSS. To achieve 80% probability of detection, SNR required is <10 dB in OR–OR fusion, whereas it is >10 dB for other fusion schemes. Further performance improvement is achieved by using square law selection and maximum ratio combining diversity schemes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here