Path: Top -> Journal -> Telkomnika -> 2017 -> Vol.15, No.3, September

A Mathematical Approach for Hidden Node Problem in Cognitive Radio Networks

Journal from gdlhub / 2017-11-07 10:44:17
Oleh : Felix Obite, Kamaludin Yusof, Jafri Din, Telkomnika
Dibuat : 2017-11-07, dengan 1 file

Keyword : Mathematical Approach, Cognitive Radio, Hidden Node Problem, Nakagami-m Fading, Neyman-Pearson Criterion.
Url : http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/6897
Sumber pengambilan dokumen : WEB



Cognitive radio (CR) technology has emerged as a realistic solution to the spectrum scarcity problem in present day wireless networks. A major challenge in CR radio networks is the hidden node problem, which is the inability of the CR nodes to detect the primary user. This paper proposes energy detector-based distributed sequential cooperative spectrum sensing over Nakagami-m fading, as a tool to solve the hidden node problem. The derivation of energy detection performance over Nakagami-m fading channel is presented. Since the observation represents a random variable, likelihood ratio test (LRT) is known to be optimal in this type of detection problem. The LRT is implemented using the Neyman-Pearson Criterion (maximizing the probability of detection but at a constraint of false alarm probability). The performance of the proposed method has been evaluated both by numerical analysis and simulations. The effect of cooperation among a group of CR nodes and system parameters such as SNR, detection threshold and number of samples per CR nodes is investigated. Results show improved detection performance by implementing the proposed model.

Beri Komentar ?#(0) | Bookmark

PropertiNilai Properti
ID Publishergdlhub
OrganisasiTelkomnika
Nama KontakHerti Yani, S.Kom
AlamatJln. Jenderal Sudirman
KotaJambi
DaerahJambi
NegaraIndonesia
Telepon0741-35095
Fax0741-35093
E-mail Administratorelibrarystikom@gmail.com
E-mail CKOelibrarystikom@gmail.com

Print ...

Kontributor...

  • , Editor: sukadi

Download...