By Topic

Centralised cooperative spectrum sensing under correlated shadowing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nafiseh Janatian ; Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran ; Mahmood Modarres Hashemi ; Sumei Sun ; Yong Liang Guan

The authors consider centralised cooperative spectrum sensing under correlated shadowing in this study. Formulating the spectrum sensing problem as a Gauss-Gauss hypothesis test, they use a linear quadratic rule and show that it is the optimal detector under Bayesian criterion. They derive the upper and lower Bhattacharyya bounds and investigate the error performance of spectrum sensing by studying the behaviour of these upper and lower bounds. They also study the asymptotic error performance in two different scenarios of finite and infinite area networks. They show that by increasing the number of nodes the sensing error probability approaches zero in both cases but with different decay rates. The lower the correlation between nodes or the larger the network area, the faster the decay.

Published in:

IET Communications  (Volume:8 ,  Issue: 11 )