A Mathematical Approach for Hidden Node Problem in Cognitive Radio Networks

Felix Obite, Kamaludin Yusof, Jafri Din

Abstract


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.


Keywords


Mathematical Approach, Cognitive Radio, Hidden Node Problem, Nakagami-m Fading, Neyman-Pearson Criterion.



DOI: http://dx.doi.org/10.12928/telkomnika.v15i3.6897

Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 Universitas Ahmad Dahlan

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.


TELKOMNIKA Telecommunication, Computing, Electronics and Control
website: http://telkomnika.ee.uad.ac.id
online system: http://journal.uad.ac.id/index.php/TELKOMNIKA
Phone: +62 (274) 563515, 511830, 379418, 371120 ext: 3208
Fax    : +62 (274) 564604

View TELKOMNIKA Stats