A Mathematical Approach for Hidden Node Problem in Cognitive Radio Networks
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 nodeproblem, 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). Theperformance of the proposed method has been evaluated both by
numerical analysis and simulations. Theeffect 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, CR, Hidden Node Problem, Nakagami-m Fading, Neyman-Pearson Criterion
Author: Felix Obite
Journal Code: jptkomputergg170042
