Spectrum Sensing and Resource Allocation for Frequency Hopping Based CRN Using Hazelnut Tree Search Algorithm

This paper presents a novel spectrum sensing and resource allocation method for Cognitive Radio Networks (CRNs) using the Hazelnut Tree Search (HTS) algorithm in a frequency-hopping framework. CRNs enable secondary users (SUs) to utilize unused licensed spectrum without causing interference to primary users (PUs). The proposed Spectrum Sensing and Resource Allocation using Hazelnut Tree Search in CRN (SS-RA-HTS-CRN) method detects PU presence, prompting SUs to switch channels to avoid interference, guided by a designated guide node (GN). The HTS algorithm selects optimal sensing nodes and improves spectrum sensing, enhancing resource allocation reliability. Simulations in NS-3.26 show that SS-RA-HTS-CRN achieves delay reductions of 28.93%, 31.9%, and 22.45%, delivery ratio improvements of 28.21%, 17.41%, and 11.565%, and packet drop rate reductions of 35.4%, 44.3%, and 23.12% compared with Energy-Aware Resource Allocation with Backtracking Search Optimization (SS-RA-BSO-CRN), Spectrum Sensing with Hybrid Particle Swarm and Gravitational Search (SS-hybrid PSOGSA-CRN), and Spectrum Sensing using Modified Spider Monkey Optimization (SS-MSMO-CRN). The proposed SS-RA-HTS-CRN method significantly enhances efficiency, reliability, and adaptability in CRNs, making it a promising solution for dynamic spectrum management.

Publication Details

Journal
Figshare
Published
2025-01-01
DOI
https://doi.org/10.6084/m9.figshare.27713020.v2
Primary Topic
Cognitive Radio Networks and Spectrum Sensing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Spectrum Sensing and Resource Allocation for Frequency Hopping Based CRN Using Hazelnut Tree Search Algorithm

Figshare
Cognitive Radio Networks and Spectrum Sensing
article

Spectrum Sensing and Resource Allocation for Frequency Hopping Based CRN Using Hazelnut Tree Search Algorithm

article en

Abstract

This paper presents a novel spectrum sensing and resource allocation method for Cognitive Radio Networks (CRNs) using the Hazelnut Tree Search (HTS) algorithm in a frequency-hopping framework. CRNs enable secondary users (SUs) to utilize unused licensed spectrum without causing interference to primary users (PUs). The proposed Spectrum Sensing and Resource Allocation using Hazelnut Tree Search in CRN (SS-RA-HTS-CRN) method detects PU presence, prompting SUs to switch channels to avoid interference, guided by a designated guide node (GN). The HTS algorithm selects optimal sensing nodes and improves spectrum sensing, enhancing resource allocation reliability. Simulations in NS-3.26 show that SS-RA-HTS-CRN achieves delay reductions of 28.93%, 31.9%, and 22.45%, delivery ratio improvements of 28.21%, 17.41%, and 11.565%, and packet drop rate reductions of 35.4%, 44.3%, and 23.12% compared with Energy-Aware Resource Allocation with Backtracking Search Optimization (SS-RA-BSO-CRN), Spectrum Sensing with Hybrid Particle Swarm and Gravitational Search (SS-hybrid PSOGSA-CRN), and Spectrum Sensing using Modified Spider Monkey Optimization (SS-MSMO-CRN). The proposed SS-RA-HTS-CRN method significantly enhances efficiency, reliability, and adaptability in CRNs, making it a promising solution for dynamic spectrum management.

Figshare
Openalex Percentile: Top 52%
Cognitive Radio Networks and Spectrum Sensing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.