TELKOMNIKA (Telecommunication Computing Electronics and Control)
Vol 15, No 3: September 2017

A Mathematical Approach for Hidden Node Problem in Cognitive Radio Networks

Felix Obite (Universiti Teknologi Malaysia Ahmadu Bello University, Zaria, Nigeria)
Kamaludin Mohammad Yusof (Universiti Teknologi Malaysia)
Jafri Din (Universiti Teknologi Malaysia)



Article Info

Publish Date
01 Sep 2017

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.

Copyrights © 2017






Journal Info

Abbrev

TELKOMNIKA

Publisher

Subject

Computer Science & IT

Description

Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of ...