access icon free Centralised cooperative spectrum sensing under correlated shadowing

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.

Inspec keywords: Bayes methods; Gaussian processes; signal detection; radio spectrum management

Other keywords: asymptotic error performance; correlated shadowing; Gauss-Gauss hypothesis test; Bhattacharyya bounds; finite area networks; centralised cooperative spectrum sensing; infinite area networks; error performance; linear quadratic rule; optimal detector

Subjects: Other topics in statistics; Signal detection; Radio links and equipment

References

    1. 1)
      • 22. Grenander, U., Szego, G.: ‘Toeplitz forms and their applications’ (Univ. of California Press, Berkeley and Los Angeles, 1958).
    2. 2)
      • 8. Klingenbrunn, T., Mogensen, P.: ‘Modelling cross-correlated shadowing in network simulations’. 50th Vehicular Technology Conf. (VTC‘99), Amsterdam, The Netherlands, September 1999, vol. 3, pp. 14071411.
    3. 3)
    4. 4)
      • 5. Tuan, D., Mark, B.L.: ‘Joint spatial-temporal spectrum sensing for cognitive radio networks’. Proc. Conf. on Information Sciences and Systems (CISS'09), Baltimore, MD, March 2009.
    5. 5)
      • 4. Jun, M., Li, G.Y., Biing, H.J.: ‘Signal processing in cognitive radio’. Proc. of the IEEE, Special Issue on Cognitive Radio – II’, May 2009, vol. 97, no. 5, pp. 805823.
    6. 6)
    7. 7)
      • 21. Olshevsky, V.: ‘Structured matrices in mathematics, computer science, and Engineering: Pt. 1 (Contemporary Mathematics)’. American Mathematical Society, 2001.
    8. 8)
    9. 9)
    10. 10)
      • 1. McHenry, M.A.: ‘NSF Spectrum Occupancy Measurements Project Summary’, Shared Spectrum Company Report, August 2005.
    11. 11)
    12. 12)
      • 17. Barclay, V.: ‘Propagation of radiowaves’ (The Institution of Engineering and Technology, 2002, 2nd edn.).
    13. 13)
    14. 14)
      • 24. Harville, D.A.: ‘Matrix algebra from a statistician's perspective’ (Springer, Berlin, 2008). ISBN 0-387-78356-3.
    15. 15)
    16. 16)
      • 10. Reisi, N., Jamali, V., Ahmadian, M., Salari, S.: ‘Cluster-based cooperative spectrum sensing over correlated log-normal channels with noise uncertainty in cognitive radio networks’, IET Commun., 2011, 6, (16), pp. 161168.
    17. 17)
    18. 18)
      • 25. Kay, S.: ‘Fundamentals of statistical signal processing’ (Printice-Hall, 1998, 1st edn.), vol. II.
    19. 19)
    20. 20)
      • 2. ‘FCC Spectrum Policy Task Force Report’, ET Docket No. 02-135, November 2002.
    21. 21)
      • 11. Visotsky, E., Kuffner, S., Peterson, R.: ‘On collaborative detection of TV transmissions in support of dynamic spectrum sharing’. Proc. IEEE First Symp. on Dynamic Spectrum Access Networks (DySPAN05), 2005.
    22. 22)
    23. 23)
      • 20. Ni, J.J.: ‘On the Chernoff bound for linear-quadratic receivers’, IEEE Wireless Communications and Networking Conf., 2004, vol. 1, pp. 8386.
    24. 24)
    25. 25)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2013.0548
Loading

Related content

content/journals/10.1049/iet-com.2013.0548
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading