Radio Networks Research Articles

Comprehensive survey on security challenges and solutions in cognitive radio networks

Comprehensive survey on security challenges and solutions in cognitive radio networks

UROLATAM Project: A multidisciplinary comprehensive care project for prostate cancer

Abstract Introduction Prostate Cancer (PCa) represents a health problem in the world and its management is heterogeneous in care, depending on the resources each country has, modifying its effectiveness in prevention, diagnosis, treatment and follow-up. Methods The UROLATAM program was implemented based on the Design Thinking quadruple helix innovation model, consisting of the immersion, design, idea and prototype phases, characterized by being multidisciplinary and comprehensive. Teachers and students from different careers at the Universidad Veracruzana participated. Linkages were made with: Local government, government health institutions, colleges of specialist doctors, private institutions and civil society. This program was broadcast on radio, television and social networks inviting the population to participate in education and prevention activities, in addition to participating in diagnosis, treatment and follow-up actions for men over 40 years of age. The duration of the program was 4 days, including educational sessions for doctors, patients, family members and caregivers, as well as determination of prostate-specific antigen, urological consultation and prostate ultrasound, as well as rehabilitation exercises, diagnostic confirmation and treatment. who needed it. Results During the sessions, 944 patients aged 60.7 (±15.0) years were treated, 443 (47%) had never received a urological consultation, identifying a prevalence of 11.7% of Cap. The human team present with the patient was 25 specialist doctors, 16 medical residents, 38 undergraduate students, 3 rehabilitators and 6 administrative staff. None of the participants received a salary for participating in this project. Conclusions The multidisciplinary UROLATAM linkage project constitutes a useful educational, training and assistance tool for the population, as well as an educational element for the students who are part of the work team. Key messages • The UROLATAM project is replicable in countries that require additional support in the prostate cancer approach. • The structure of the UROLATAM project can be replicated to address other public health problems.

Secrecy performance intelligent prediction for CRNs: An Self-CondenseNet approach

This paper studies the physical layer security (PLS) of cognitive radio networks (CRNs) with Fisher–Snedecor F distribution. To resolve the security issues within CRNs, we derived exact expressions of the security outage probability (SOP) and the probability of strict positive secrecy capacity (SPSC) for the first time, where the SOP and SPSC are uniformly given by Meijer’s G-function. The correctness of the theoretical derivations is proved by Monte Carlo simulations. The results indicate that reducing m and increasing the ratio of (ms,μE) will reduce SOP and increase SPSC. Moreover, we proposed the Self-CondenseNet model to predict the security performance of the system. By comparing with three deep learning algorithms of Transformer, MLP-Mixer and CondenseNet, the results show that the proposed Self-CondenseNet has the best prediction performance. Compared with the CondenseNet, the proposed Self-CondenseNet has a 78.26% higher accuracy and a 12.86% lower time complexity. Compared with the MLP-Mixer, the proposed Self-CondenseNet has a 85.29% higher accuracy. The comparison results show that the proposed algorithm has high prediction accuracy and low time complexity, and can be widely used in complex and changeable scenarios such as 5G, Internet of Vehicles (IoV), and mobile vehicle networking .etc.

Joint passive beamforming and deployment design for active intelligent reflecting surface-assisted energy harvesting-cognitive radio sensor networks.

To prolong the network lifetime of energy harvesting-cognitive radio sensor networks (EH-CRSNs), this paper integrates active intelligent reflecting surface (IRS) to support both downlink EH and uplink data transmissions and formulates a constrained non-convex optimization problem that maximizes the net energy gain. To solve this problem, a joint passive beamforming and IRS deployment mechanism is proposed to determine the optimal deployment location of the active IRS and optimally configure the IRS reflection coefficient matrices. Specifically, the net energy gain maximization problem at a specified location is divided into two sub-problems according to its characteristics: maximizing the cumulative energy harvested by all CRSNs nodes in the downlink and minimizing the energy consumption of cluster heads in uplink data transmissions, with each sub-problem being solved independently. Furthermore, this paper explores how factors such as the number of active reflecting elements and the amplification power budget influence the optimal deployment location of the active IRS. The findings from this investigation can guide the design of active IRS-assisted EH-CRSNs under specified parameters. Simulation results confirm the aforementioned conclusions and highlight the benefits of the proposed joint mechanism in enhancing net energy gain over various benchmark mechanisms.

On Radio k – Chromatic Number for Mycielski of Some Graphs

Objectives: In radio networks, the main difficulty is managing the radio spectrum, assigning radio frequencies to transmitters optimally without any interferences. This study aims to find the smallest span of Mycielski of some graphs, the maximum color assigned to any node is called span. Methods : This study focused on the problem of reducing interference by modeling it with a radio k - coloring problem on graphs. Where transmitters are modeled as nodes in a graph, with edges connecting nodes that represent transmitters in close proximity to one another. For a graph , with node set , edge set and an integer , a radio k - coloring of is a function satisfying the condition for any two nodes and , where is the distance between and in . The radio k - coloring of , is the maximum color assigned to any node of and it is denoted by . The radio k -chromatic number of is the minimum value of taken over all radio k - coloring of and it is denoted by . Findings: This study obtained the radio k-chromatic number for Mycielski of some graphs for and 3 Novelty: To solve the channel assignment problem in radio transmitters, the interference graph is developed, and the channel assignment has been converted into a graph coloring. Reducing the interference by a radio k - coloring problem will motivate many researchers to find the radio k - coloring in various graphs. Keywords: Radio k – Coloring, Mycielski graph, Double Star graph, Triple Star graph, Sunlet graph, Helm graph and Closed Helm graph

Joint channel allocation and transmit power control for underlay EH‐CRNs: A clustering‐based multi‐agent DDPG approach

AbstractTo address the concerns of energy supply and spectrum scarcity for wireless devices, energy harvesting cognitive radio networks have been proposed. To improve spectrum utilization, secondary users (SUs) access the licensed spectrum in underlay mode, which may cause severe interference to primary users and SUs. The focus is on the underlay energy harvesting cognitive radio networks with multiple pairs of SUs, and formulate the long‐term secondary throughput maximization problem as a mixed‐integer non‐linear programming problem. As traditional approaches could hardly solve the mixed‐integer non‐linear programming problem well, a centralized deep deterministic policy gradient (C‐DDPG) approach is proposed that achieves satisfactory throughput performance. To reduce the computational complexity of C‐DDPG, we further propose a clustering‐based multi‐agent DDPG (CMA‐DDPG) approach that combines the advantages of the centralized deep reinforcement learning approach and the distributed deep reinforcement learning approach. In the CMA‐DDPG, a novel interference‐based clustering algorithm is proposed, which partitions the SUs that cause severe mutual interference into one cluster, and the sizes of state space and action space are smaller than those in C‐DDPG. Numerical results validate the superiority of the proposed approaches in terms of the throughput and outage probability, and validate the clustering performance of the interference‐based clustering algorithm in terms of the outage probability of the secondary network.

Enhanced Cooperative Compressive Spectrum Sensing in Cognitive Radio Networks

ABSTRACTThe demand for bandwidth in cognitive radio networks (CRNs) is growing as applications become increasingly data intensive. Techniques such as compressed spectrum sensing (CSS) and cooperative spectrum sensing (C‐SS) are employed to address this challenge. C‐SS enhances overall detection accuracy and reliability by enabling multiple nodes to share and combine their local sensing data. Conversely, CSS effectively reduces the required information for spectrum usage decision making, thereby improving bandwidth utilization. Integrating these two methods allows CRNs to utilize the spectrum reliably and efficiently, leading to increased spectral efficiency. To further improve reconstruction performance, we leverage the sparsity concept to transcend hardware constraints and merge restrictions from both real and synthesized channels. This approach involves the virtual synthesis of channels, which linearly enhances the signal‐to‐noise ratio (SNR) within the network's size range. Simulation results demonstrate that our proposed method offers significant advantages over single‐node recovery, as validated by simulations and software defined radio (SDR) Implementation. The integration of spectral estimations from various local CR detectors enhances spatial diversity gain and sensing quality, particularly in fading channels. Compared to traditional approaches, our method achieves superior performance, evidenced by an increase in (from 93.97% to 96.52%) with almost the same .

Arithmetic Optimization Algorithm Quantization Optimized With Energy Detection Using Nonparametric Amplitude

ABSTRACTThe spectrum sensing is a major significant task in cognitive radio networks (CRNs) to avoid the unacceptable interference to primary users (PUs). Here, the threshold value determines the effectiveness of spectrum sensing and regarded as a sensing system. The fixed threshold used by the current energy detection‐based spectrum sensing (SS) techniques does not provide sufficient safety for the main users. The threshold is determined by lowering the complete probability of decision error in addition to these guidelines. Therefore, an energy detection using nonparametric amplitude quantization optimized with arithmetic optimization algorithm for enhanced spectrum sensing in CRNs (ED‐NAQ‐AOA‐SS CRN) is proposed in this paper to acquire the ideal threshold for decreasing the total error probability. The proposed method achieves greater probability of detection of 99.67%, 98.38%, 92.34%, and 97.45%, lower settling time of 98.33%, 89.34%, 83.12%, and 88.96%, and lower error rate of 93.15%, 91.25%, 79.90%, and 92.88% compared with existing techniques, like intelligent spectrum sharing and sensing in CRN with adaptive rider optimization algorithm (AROA), a novel technique for spectrum sensing in CRN utilizing fractional gray wolf optimization with the cuckoo search optimization (GWOCS), and adaptive neuro‐fuzzy inference scheme depending on cooperative spectrum sensing optimization in CRNs (ANFIS).

Three-State Hidden Markov Model for Spectrum Prediction in Cognitive Radio Networks

The exponential growth and proliferation of wireless devices for different wireless applications have led to the emergence of cognitive radio network (CRN) for optimal utilization of scarce spectrum resources. However, these resources have grossly been under-utilized due to the inaccurate spectrum predictions. Existing spectrum occupancy and prediction techniques which rely on 2-state hidden Markov model (HMM) results in false alarm or missed detection caused by noisy or incomplete observable effects. In this paper, a 3-state HMM spectrum occupancy and prediction technique in CRNs is proposed. The transmission, emission and initial state probabilities of the proposed 3-state HMM parameters were derived based on the three canonical problems associated with HMM. The evaluation, decoding and learning problems were solved using Forward algorithm, Viterbi algorithm and the Baum-Welch algorithm, respectively. The performance of the proposed 3-state HMM spectrum prediction technique was evaluated using prediction accuracy, probability of detection and spectrum utilization efficiency. The simulation results obtained revealed that the 3-state HMM outperformed the 2-state HMM spectrum prediction technique by 24.1% in prediction accuracy.

Quantum cryptography in the security of cognitive radio networks

Cognitive radio networks face challenges from malicious users who aim to disrupt decision-making during spectrum sensing and decrease spectrum efficiency. The proposed model seeks to distinguish between the presence and absence of primary user signals using energy detection and also it introduces a quantum-inspired outlier detection mechanism for cognitive radio networks to enhance security and reliability during spectrum sensing by ignoring the identified outliers. It employs BB84 quantum key distribution (QKD) protocol and one time pad for secure transmission of secondary user (SU) local decisions to the fusion center (FC), ensuring data integrity and confidentiality. These decisions are transmitted securely establishing a shared secret key between SU and FC and arrives at a global decision. To make the model more robust, we proposed another novel model with a modified BB84 protocol and compared the results of both the models, offering a robust solution for enhancing the reliability and performance of cognitive radio networks with proven results from simulation.

Analysis of NR and LTE Target Signal Structure Based on Neural Network Approach and Deep Learning Methods

Purpose: the rapid development and consolidation of broadband wireless access networks of the fourth 4G LTE and fifth 5G NR generations determine the need to find ways to reuse frequencies. A well-known solution to this problem is the concept of cognitive radio. The use of artificial intelligence in radio networks in general and the use of a neural network approach with deep learning for recognizing signals of LTE and NR standards in particular have serious potential for the practical implementation of frequency resource reuse according to the concept of cognitive development. The aim of the work: is to analyze models, methods and algorithms that allow recognizing signals of the NR and LTE standards based on recording samples of radio signals obtained using pre-recorded NR and LTE signals in MatLab software. In this paper, the procedures for scanning and recognizing sections of the spectrum are considered. The operations of training a semantic segmentation network for the identification of these signals in a broadband spectrogram and the use of a trained network for subsequent spectrum sensing and recognition of signals of the NR and LTE standards are investigated. Methods: the method used to test the concept of cognitive radio is spectrum sensing, which results in information about the occupancy of frequency bands in a given location by primary users, and the identification of spectrum sections available for use by secondary users without interfering with the work of primary users in real time. The novelty of the work is the use of a neural network approach in the analysis of the target NR and LTE signal. Results: the model, trained on the basis of a neural network approach and deep learning methods, is able to distinguish between signals of the NR and LTE standards. Theoretical / Practical relevance: the software implementation of spectral sensing is implemented using an extension package in the MatLab environment and allows for experimental testing of a cognitive radio receiver when performing procedures for analyzing the structure of the target signal of the NR and LTE standards based on a neural network approach and deep learning methods.

Cross-attention mechanism-based spectrum sensing in generalized Gaussian noise

Spectrum sensing (SS) technology is essential for cognitive radio (CR) networks to effectively identify and utilize idle spectrum resources. Due to the influence of noise characteristics in the channel, providing accurate sensing results is challenging. In order to improve the performance of SS under non-Gaussian noise and overcome the limitations of existing methods that are mostly based on a single feature, we propose a novel time-frequency cross fusion network (TFCFN). Specifically, we utilize gated recurrent units (GRU) to capture long-term dependencies in the time domain on the original signals, meanwhile, we perform a fast Fourier transform (FFT) on the original signals to obtain the frequency domain information, and subsequently use convolutional neural networks (CNN) to extract the local spatial features in the frequency domain. Ultimately, these time-domain and frequency-domain features are dynamically fused through a cross-attention mechanism to construct more comprehensive and robust features for signal classification. We use generalized Gaussian distribution (GGD) as the noise model and reconstruct the RadioML2016.10a dataset to explore the performance under various noise conditions. The experimental results show that compared with the baseline methods, TFCFN exhibits better detection ability and maintains lower complexity in both Gaussian and non-Gaussian noise environments. Notably, when the shape parameter of GGD is set to 0.5 and the signal-to-noise ratio (SNR) of the received signal is -16dB, it can maintain the probability of false alarm (Pf\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$P_f$$\\end{document}) of 10% while still ensuring the probability of detection (Pd\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$P_d$$\\end{document}) of over 90%.

EVALUATING THE CHARACTERISTICS OF THE VTSM SPECTRUM SENSING METHOD IN COGNITIVE RADIO NETWORKS

The article investigates the complexities associated with spectrum analysis in cognitive radio networks (CRNs). It begins by acknowledging the evolving challenges of spectrum sensing due to the dynamic nature of wireless environments and the increasing demand for efficient spectrum utilization. The study thoroughly examines various traditional spectrum sensing methods, including Energy Detector Based Sensing, Waveform-Based Sensing, Cyclostationarity-Based Sensing, and Matched Filtering. The focus of the research is on the Variable Time Segment Monitoring (VTSM) method, a novel approach that optimizes spectrum sensing by dynamically adjusting the time segments used for analyzing spectral characteristics. The paper highlights the VTSM method's ability to enhance detection accuracy and reduce false alarms by adapting to different signal environments, making it particularly suited for complex and dynamic CRN scenarios. Furthermore, the article compares VTSM with traditional methods across key performance metrics such as detection accuracy, false alarm rate, latency, and computational complexity. The analysis reveals that while traditional methods have their strengths, VTSM offers a balanced approach, combining flexibility, accuracy, and moderate computational demands, thereby providing a versatile solution for modern spectrum sensing challenges. The findings contribute to the broader understanding and advancement of cognitive radio technologies, supporting the development of more robust and efficient spectrum sensing solutions, which are crucial for optimizing network performance and ensuring reliable communication in increasingly congested and complex wireless environments. The article concludes by emphasizing the importance of selecting the appropriate spectrum sensing method based on the specific requirements of the CRN application, considering factors such as accuracy, computational resources, and environmental dynamics. The findings contribute to the broader understanding and advancement of cognitive radio technologies, supporting the development of more robust and efficient spectrum sensing solutions.

A Modified Active Ensemble Neural Network Using Primary User Emulation Attack in Cognitive Radio Network

A Modified Active Ensemble Neural Network Using Primary User Emulation Attack in Cognitive Radio Network

Dynamic Resource Allocation and Offloading Optimization for Network Slicing in B5G Multi-tier Multi-tenant Systems

For differentiating and customizing different types of flows guaranteeing individual 5QI QoS requirements, 5G and Beyond 5G (B5G) first specify several key technologies, e.g., 1) virtualizing radio resources, network functions and network servers, 2) network slicing, 3) Service Function Chaining (SFC) and flow steering, etc. Furthermore, for reducing E2E delay and path/link traffic congestion for diverse flowing while accessing cloud computing, Multi-access Edge Computing (MEC) is specified in 5G/B5G ETSI. Although several extensively related studies discussed network slicing, SFC and MEC, they seldom consider both resource allocation and traffic offloading in a tenant efficiently, simultaneously. Thus, for efficiently addressing above critical issues, three motivations are proposed, including 1) to dynamically allocate resource for B5G with multi-tier multi-tenant networking, 2) to propose adaptively vertical and horizontal offloading to the computing node for diverse types of flows, and 3) to minimize the blocking rate while guaranteeing the delay constraint. Two novel efficient algorithms are proposed: Fast Latency Decrease Resource Allocation (FLDRA) and Minimum Cost Resource Allocation (MCRA). These two proposed algorithms achieve dynamic E2E resource allocation and optimal vertical and horizontal offloading to the computing node while guaranteeing the E2E latency and 5QI QoS requirements for different types of flows. Numerical results demonstrate that FLDRA minimizes resource allocation while MCRA balances the loading of resource availability. The proposed algorithms of FLDRA and MCRA significantly outperform the compared approaches in blocking rates. Moreover, the proposed MCRA algorithm yields the highest resource utilization, the least network delay, etc.

Optimization of IoT perceived content caching in F-RANs: Minimum retrieval delay and resource extension with performance sensitivity

In the Internet of Things (IoT) perceived applications of monitoring the states of the environment, a feasible technology is to use fog radio access networks (F-RANs) to alleviate the problems of long response time and cloud server bottlenecks in cloud computing. In response to the above problems, this work investigates the problem of minimizing the retrieval delay of IoT contents in F-RANs under the constraints of system resources. The problem is formulated as an integer linear programming (ILP) model. Then, a polynomial-time method with linear programming (LP) relaxation and rounding is proposed to approximate the optimal solution of the problem. Through proof, the method can obtain a feasible solution with a bounded approximation ratio in polynomial time. The conducted simulations validate that the obtained feasible solution is very close to the optimal one. On the other hand, when the system resources are not enough to meet the continuous growth of content retrieval and need to be expanded, this work further establishes an association relation between cached contents and system resources. Based on the above relation, the second method of expanding system resources with performance sensitivity is proposed to provide the service provider with an effective and economical expansion of system resources. It utilizes a predefined system parameter in balancing the trade-off between the approximation ratio to the optimal solution of the problem and the extended system resources. The solution obtained by the second method is also proved to have a bounded approximation ratio.

Covert Communication in Cognitive Radio Networks With Poisson Distributed Jammers

Covert Communication in Cognitive Radio Networks With Poisson Distributed Jammers

RIS-Assisted Hybrid Symbiotic Radio Network: From Practical End-to-End Model to Multi-Objective Optimization

RIS-Assisted Hybrid Symbiotic Radio Network: From Practical End-to-End Model to Multi-Objective Optimization

Joint Optimization for Over-the-Air Computation in AF Relay-Assisted Cognitive Radio Networks

Joint Optimization for Over-the-Air Computation in AF Relay-Assisted Cognitive Radio Networks

Graph Learning-Based Cooperative Spectrum Sensing With Corrupted RSSs in Spectrum-Heterogeneous Cognitive Radio Networks

Graph Learning-Based Cooperative Spectrum Sensing With Corrupted RSSs in Spectrum-Heterogeneous Cognitive Radio Networks