RESUMEN

A cognitive radio network (CRN) is an intelligent network that can detect unoccupied spectrum space without interfering with the primary user (PU). Spectrum scarcity arises due to the stable channel allocation, which the CRN handles. Spectrum handoff management is a critical problem that must be addressed in the CRN to ensure indefinite connection and profitable use of unallocated spectrum space for secondary users (SUs). Spectrum handoff (SHO) has some disadvantages, i.e., communication delay and power consumption. To overcome these drawbacks, a reduction in handoff should be a priority. This study proposes the use of dynamic spectrum access (DSA) to check for available channels for SU during handoff using a metaheuristic algorithm depending on machine learning. The simulation results show that the proposed "support vector machine-based red deer algorithm" (SVM-RDA) is resilient and has low complexity. The suggested algorithm's experimental setup offers several handoffs, unsuccessful handoffs, handoff delay, throughput, signal-to-noise ratio (SNR), SU bandwidth, and total spectrum bandwidth. This study provides an improved system performance during SHO. The inferred technique anticipates handoff delay and minimizes the handoff numbers. The results show that the recommended method is better at making predictions with fewer handoffs compared to the other three.

RESUMEN

Cognitive radio (CR) has emerged as one of the most investigated techniques in wireless networks. Research is ongoing in terms of this technology and its potential use. This technology relies on making full use of the unused spectrum to solve the problem of the spectrum shortage in wireless networks based on the excessive demand for spectrum use. While the wireless network technology node's range of applications in various sectors may have security drawbacks and issues leading to deteriorating the network, combining it with CR technology might enhance the network performance and improve its security. In order to enhance the performance of the wireless sensor networks (WSNs), a lightweight authentication medium access control (MAC) protocol for CR-WSNs that is highly compatible with current WSNs is proposed. Burrows-Abadi-Needham (BAN) logic is used to prove that the proposed protocol achieves secure and mutual authentication. The automated verification of internet security protocols and applications (AVISPA) simulation is used to simulate the system security of the proposed protocol and to provide formal verification. The result clearly shows that the proposed protocol is SAFE under the on-the-fly model-checker (OFMC) backend, which means the proposed protocol is immune to passive and active attacks such as man-in-the-middle (MITM) attacks and replay attacks. The performance of the proposed protocol is evaluated and compared with related protocols in terms of the computational cost, which is 0.01184 s. The proposed protocol provides higher security, which makes it more suitable for the CR-WSN environment and ensures its resistance against different types of attacks.

RESUMEN

Cognitive radio networks are vulnerable to numerous threats during spectrum sensing. Different approaches can be used to lessen these attacks as the malicious users degrade the performance of the network. The cutting-edge technologies of machine learning and deep learning step into cognitive radio networks (CRN) to detect network problems. Several studies have been conducted utilising various deep learning and machine learning methods. However, only a small number of analyses have used gated recurrent units (GRU), and that too in software defined networks, but these are seldom used in CRN. In this paper, we used GRU in CRN to train and test the dataset of spectrum sensing results. One of the deep learning models with less complexity and more effectiveness for small datasets is GRU, the lightest variant of the LSTM. The support vector machine (SVM) classifier is employed in this study's output layer to distinguish between authorised users and malicious users in cognitive radio network. The novelty of this paper is the application of combined models of GRU and SVM in cognitive radio networks. A high testing accuracy of 82.45%, training accuracy of 80.99% and detection probability of 1 is achieved at 65 epochs in this proposed work.

RESUMEN

The paper studies the secrecy communication threatened by a single eavesdropper in Energy Harvesting (EH)-based cognitive radio networks, where both the Secure User (SU) and the jammer harvest, store, and utilize RF energy from the Primary Transmitter (PT). Our main goal is to optimize the time slots for energy harvesting and wireless communication for both the secure user as well as the jammer to maximize the long-term performance of secrecy communication. A multi-agent Deep Reinforcement Learning (DRL) method is proposed for solving the optimization of resource allocation and performance. Specifically, each sub-channel from the Secure Transmitter (ST) to the Secure Receiver (SR) link, along with the jammer to the eavesdropper link, is regarded as an agent, which is responsible for exploring optimal power allocation strategy while a time allocation network is established to obtain optimal EH time allocation strategy. Every agent dynamically interacts with the wireless communication environment. Simulation results demonstrate that the proposed DRL-based resource allocation method outperforms the existing schemes in terms of secrecy rate, convergence speed, and the average number of transition steps.

Asunto(s)

RESUMEN

Energy harvesting (EH) and cooperative communication techniques have been widely used in cognitive radio networks. However, most studies on throughput in energy-harvesting cooperative cognitive radio networks (EH-CCRNs) are end-to-end, which ignores the overall working state of the network. For the above problems, under the premise of prioritizing the communication quality of short-range users, this paper focuses on the optimization of the EH-CCRN average throughput, with energy and transmission power as constraints. The formulated problem was an unsolved non-deterministic polynomial-time hardness (NP-hard) problem. To make it tractable to solve, a multi-user time-power resource allocation algorithm (M-TPRA) is proposed, which is based on sub-gradient descent and unary linear optimization methods. Simulation results show that the M-TPRA algorithm can improve the average throughput of the network. In addition, the energy consumed by executing the M-TPRA algorithm is analyzed.

RESUMEN

Cooperative network is a promising concept for achieving a high-accuracy decision of spectrum sensing in cognitive radio networks. It enables a collaborative exchange of the sensing measurements among the network users to monitor the primary spectrum occupancy. However, the presence of malicious users leads to harmful interferences in the system by transmitting incorrect local sensing observations.To overcome this security related problem and to improve the accuracy decision of spectrum sensing in cooperative cognitive radio networks, we proposed a new approach based on two machine learning solutions. For the first solution, a new stacking model-based malicious users detection is proposed, using two innovative techniques, including chaotic compressive sensing technique-based authentication for feature extraction with a minimum of measurements and an ensemble machine learning technique for users classification. For the second solution, a novel deep learning technique is proposed, using scalogram images as inputs for the primary user spectrum's classification. The simulation results show the high efficiency of both proposed solutions, where the accuracy of the new stacking model reaches 97% in the presence of 50% of malicious users, while the new scalogram technique-based spectrum sensing is fast and achieves a high probability of detection with a lower number of epochs and a low probability of false alarm.

Asunto(s)

RESUMEN

Cognitive radio (CR), which is a common form of wireless communication, consists of a transceiver that is intelligently capable of detecting which communication channels are available to use and which are not. After this detection process, the transceiver avoids the occupied channels while simultaneously moving into the empty ones. Hence, spectrum shortage and underutilization are key problems that the CR can be proposed to address. In order to obtain a good idea of the spectrum usage in the area where the CRs are located, cooperative spectrum sensing (CSS) can be used. Hence, the primary objective of this research work is to increase the realizable throughput via the cluster-based cooperative spectrum sensing (CBCSS) algorithm. The proposed scheme is anticipated to acquire advanced achievable throughput for 5G and beyond-5G Internet of Things (IoT) applications. Performance parameters, such as achievable throughput, the average number of clusters and energy, have been analyzed for the proposed CBCSS and compared with optimal algorithms.

RESUMEN

A cognitive radio network (CRN) is integrated with the Internet of Connected Vehicles (IoCV) in order to address spectrum scarcity and communication reliability issues. However, it is limited, possessing less throughput, a low packet delivery ratio, high latency, and high mobility in the spectrum. In this research study, the existing issues are addressed by proposing a 6G cognitive radio network-Internet of connected vehicles (6GCRN-IoCV) approach. Initially, all the entities such as secondary users (SUs), primary users (PUs), and pedestrians are authenticated in blockchain to ensure security. The edge-assisted roadside units (ERSU) initiate clustering only for authenticated SUs using the improved DBSCAN algorithm in consideration of several metrics. The ERSU then generates an intersection-aware map using the spatial and temporal-based logistic regression algorithm (STLR) to reduce collisions in the intersection. The spectrum utilization is improved by performing spectrum sensing in which all the SUs involved in spectrum sensing use lightweight convolutional neural networks (Lite-CNN) in consideration of several metrics and provide the sensing report to the fusion center (FC) in an encrypted manner to reduce the spectrum scarcity and security issues. The communications between the SUs are necessary to avoid risks in the IoCV environment. Hence, optimal routing is performed using the Dingo Optimization Algorithm (DOA), which increases throughput and packet delivery ratio. Finally, communication reliability is enhanced by performing hybrid beamforming, and this exploits the multi-agent-based categorical Deep-Q Network (categorical DQN), which increases spectral efficiency based on its adaptive intelligent behavior. The proposed study is simulated using the SUMO and OMNeT++ simulation tools and the performances are validated with existing works using several performance metrics. The result of the simulation shows that the proposed work performs better than the existing approaches.

RESUMEN

To efficiently utilize nonexclusive underwater acoustic frequencies, we propose an Underwater Cooperative Spectrum Sharing (UCSS) protocol for a centralized underwater cognitive acoustic network that mainly consists of two parts. In the first part, to check the random occurrence of interferers periodically, the time domain is divided into frames that consist of a sensing and a non-sensing sub-frame. Then, we set the ratio of the two sub-frames to enhance the sensing rate via simulations. As a result, there exists the upper limit of the ratio, which can be used for determining the proportion of the sensing time within a frame. The second part is to design two heuristic resource allocation (RA) algorithms. One is a multiround RA (MRRA), where a central entity allocates a data channel (i.e., resource) to a CU each round so that multiple rounds are executed until no CUs need to be allocated or there is a lack of data channels. The other is a single-round RA (SRRA), where a CU is allocated to as many data channels as its QoS within a round. We also specify four rules to determine the allocation order of the CUs: random, fixed, high-QoS-based, and low-channel allocation-rate-based. In this study, we investigate the best RA allocation order pair supporting the highest channel allocation rate and fairness index via extensive simulations. It is shown that the MRRA outperformed the SRRA, regardless of allocation orders at any conditions, and the random and low-channel allocation-rate-based allocation orders with MRRA supported the best performance. In particular, even without the optimization process, the MRRA guarantees more than 95% fairness.

RESUMEN

Mobile cognitive radio networks (MCRNs) have arisen as an alternative mobile communication because of the spectrum scarcity in actual mobile technologies such as 4G and 5G networks. MCRN uses the spectral holes of a primary user (PU) to transmit its signals. It is essential to detect the use of a radio spectrum frequency, which is where the spectrum sensing is used to detect the PU presence and avoid interferences. In this part of cognitive radio, a third user can affect the network by making an attack called primary user emulation (PUE), which can mimic the PU signal and obtain access to the frequency. In this paper, we applied machine learning techniques to the classification process. A support vector machine (SVM), random forest, and K-nearest neighbors (KNN) were used to detect the PUE in simulation and emulation experiments implemented on a software-defined radio (SDR) testbed, showing that the SVM technique detected the PUE and increased the probability of detection by 8% above the energy detector in low values of signal-to-noise ratio (SNR), being 5% above the KNN and random forest techniques in the experiments.

Asunto(s)

RESUMEN

Multicasting is a basic networking primitive used in a wide variety of applications that is also true for cognitive radio-based networks. Although cognitive radio technology is considered to be the most promising technology to deal with spectrum scarcity, it relates to completely different aspects of networking and presents new challenges. For cognitive radio-based multicast sessions, it is important to use the spectrum efficiently by reducing the number of channels used as well as engaging fewer nodes in data relaying. This will benefit the network in three ways. First, it will decrease the number of transmissions. Second, it will help to reduce energy usage. Third, it will spare more channels and relay nodes for simultaneous multicast sessions. To achieve these advantages, efficient channel selection and relay nodes are required based on hop-to-hop communication. In this paper an algorithm has been developed that attempts to minimize energy consumption by selecting the minimum possible number of relay nodes and channels for a multicast session, taking into account the sporadic availability of the spectrum. The proposed method performs effectively compared to the flooding method in terms of energy consumption for the provided examples in multicasting.

Asunto(s)

RESUMEN

The Age of Information (AoI) measures the freshness of information and is a critic performance metric for time-sensitive applications. In this paper, we consider a radio frequency energy-harvesting cognitive radio network, where the secondary user harvests energy from the primary users' transmissions and opportunistically accesses the primary users' licensed spectrum to deliver the status-update data pack. We aim to minimize the AoI subject to the energy causality and spectrum constraints by optimizing the sensing and update decisions. We formulate the AoI minimization problem as a partially observable Markov decision process and solve it via dynamic programming. Simulation results verify that our proposed policy is significantly superior to the myopic policy under different parameter settings.

RESUMEN

This paper presents a solution for building awareness of the electromagnetic situation in cognitive mobile ad hoc networks (MANET) using the cooperative spectrum sensing method. Signal detection is performed using energy detectors with noise level estimation. Based on the evidence theory, the fusion center decides on the particular channel occupancy, which can process incomplete and unambiguous input data. Next, a reinforced machine learning algorithm estimates the usefulness of particular channels for the MANET transmission and creates backup channels list that could be used in case of interferences. Initial simulations were performed using the MATLAB environment, and next an OMNET-based MAENA high fidelity simulator was used. Performed simulations showed a significant increase in sensing efficiency compared to sensing performed using simple data fusion rules.

Asunto(s)

RESUMEN

Cognitive radio, as a key technology to improve the utilization of radio spectrum, acquired much attention. Moreover, spectrum sensing has an irreplaceable position in the field of cognitive radio and was widely studied. The convolutional neural networks (CNNs) and the gate recurrent unit (GRU) are complementary in their modelling capabilities. In this paper, we introduce a CNN-GRU network to obtain the local information for single-node spectrum sensing, in which CNN is used to extract spatial feature and GRU is used to extract the temporal feature. Then, the combination network receives the features extracted by the CNN-GRU network to achieve multifeatures combination and obtains the final cooperation result. The cooperative spectrum sensing scheme based on Multifeatures Combination Network enhances the sensing reliability by fusing the local information from different sensing nodes. To accommodate the detection of multiple types of signals, we generated 8 kinds of modulation types to train the model. Theoretical analysis and simulation results show that the cooperative spectrum sensing algorithm proposed in this paper improved detection performance with no prior knowledge about the information of primary user or channel state. Our proposed method achieved competitive performance under the condition of large dynamic signal-to-noise ratio.

RESUMEN

In this study, wireless-powered cognitive radio networks (WPCRNs) are considered, in which N sets of transmitters, receivers and energy-harvesting (EH) nodes in secondary networks share the same spectrum with primary users (PUs) and none of the EH nodes is allowed to decode information but can harvest energy from the signals. Given that the EH nodes are untrusted nodes from the point of view of information transfer, the eavesdropping of secret information can occur if they decide to eavesdrop on information instead of harvesting energy from the signals transmitted by secondary users (SUs). For secure communications in WPCRNs, we aim to find the optimal transmit powers of SUs that maximize the average secrecy rate of SUs while maintaining the interference to PUs below an allowable level, while guaranteeing the minimum EH requirement for each EH node. First, we derive an analytical expression for the transmit power via dual decomposition and propose a suboptimal transmit power control algorithm, which is implemented in an iterative manner with low complexity. The simulation results confirm that the proposed scheme outperforms the conventional distributed schemes by more than 10% in terms of the average secrecy rate and outage probability and can also considerably reduce the computation time compared with the optimal scheme.

RESUMEN

Improving spectral efficiency under a certain energy limitation is an important design metric for future wireless communications as a response to the growing transmission demand of wireless devices. In order to improve spectral efficiency for communication systems without increasing energy consumption, this paper considers a non-orthogonal multiple access (NOMA)-based cognitive radio network, with the assistance of a wireless-powered relay station (RS), and then analyzes the system outage performance under amplified-and-forward (AF) and decoded-and-forward (DF) cooperative transmission modes. Specifically, the base station (BS) has the opportunity to cooperate by transmitting information through the RS, depending on whether the RS can harvest sufficient RF energy for cooperative transmission. That is to say, when the energy stored by the RS is sufficient for cooperative transmission, the RS will assist the BS to forward information; otherwise, the BS will send information through direct links, while the RS converts the radio frequency (RF) signals sent by the BS into energy for future transmission. Moreover, the transmission power required by the RS for cooperative transmission is usually relatively large, while the amount of harvested energy by the RS in a transmission slot is usually low, so it takes several consecutive time slots to accumulate enough transmission energy. To this end, we utilize a discrete-time Markov chain to describe the processes of charging and discharging of the RS. Subsequently, we derive the closed-form outage probabilities of both the primary and secondary systems for the considered system in AF and DF modes through mathematical analysis, and verify the accuracy of the analyses through Monte Carlo simulation. The simulation results show that the two proposed cooperative transmission schemes with AF and DF relaying techniques outperform both direct transmission and other similar schemes in both the primary and secondary system, while the DF scheme can provide better performance than the AF scheme within the range of setting values.

RESUMEN

In the present paper, we investigate the performance of the simultaneous wireless information and power transfer (SWIPT) based cooperative cognitive radio networks (CCRNs). In particular, the outage probability is derived in the closed-form expressions under the opportunistic partial relay selection. Different from the conventional CRNs in which the transmit power of the secondary transmitters count merely on the aggregate interference measured on the primary networks, the transmit power of the SWIPT-enabled transmitters is also constrained by the harvested energy. As a result, the mathematical framework involves more correlated random variables and, thus, is of higher complexity. Monte Carlo simulations are given to corroborate the accuracy of the mathematical analysis and to shed light on the behavior of the OP with respect to several important parameters, e.g., the transmit power and the number of relays. Our findings illustrate that increasing the transmit power and/or the number of relays is beneficial for the outage probability.

Asunto(s)

RESUMEN

In this paper, we propose a spectrum-sharing protocol for a cooperative cognitive radio network based on non-orthogonal multiple access technology, where the base station (BS) transmits the superimposed signal to the primary user and secondary user with/without the assistance of a relay station (RS) by adopting the decode-and-forward technique. RS performs discrete-time energy harvesting for opportunistically cooperative transmission. If the RS harvests sufficient energy, the system performs cooperative transmission; otherwise, the system performs direct transmission. Moreover, the outage probabilities and outage capacities of both primary and secondary systems are analyzed, and the corresponding closed-form expressions are derived. In addition, one optimization problem is formulated, where our objective is to maximize the energy efficiency of the secondary system while ensuring that of the primary system exceeds or equals a threshold value. A joint optimization algorithm of power allocation at BS and RS is considered to solve the optimization problem and to realize a mutual improvement in the performance of energy efficiency for both the primary and secondary systems. The simulation results demonstrate the validity of the analysis results and prove that the proposed transmission scheme has a higher energy efficiency than the direct transmission scheme and the transmission scheme with simultaneous wireless information and power transfer technology.

RESUMEN

The focus of research efforts in cognitive radio networks (CRNs) has primarily remained confined to maximizing the utilization of the discovered resources. However, it is also important to enhance the user satisfaction in CRNs by finding a suitable match between the secondary users and the idle channels available from the primary network while taking into consideration not only the quality of service (QoS) requirements of the secondary users but the quality of the channels as well. In this work, the Gale Shapley matching theory was applied to find the best match, so that the most suitable channels from the available pool were allocated that satisfy the QoS requirements of the secondary users. Before applying matching theory, two objective functions were defined from the secondary user's perspective as well as from the channel's perspective. The objective function of secondary users is the weighted sum of the data rate of the secondary users and the probability of reappearance of the primary user on the channel. Whereas, the objective function of the channel is the maximum utilization of the channel. The weight factors included in the objective functions allow for diverse service classes of secondary users (SUs) or varying channel quality characteristics. The objective functions were used in developing the preference lists for the secondary users and the idle channels. The preference lists were then used by the Gale Shapely matching algorithm to determine the most suitably matched SU-channel pairs. The performance of the proposed scheme was evaluated using Monte-Carlo simulations. The results show significant improvement in the overall satisfaction of the secondary users with the proposed scheme in comparison to other contemporary techniques. Further, the impact of changing the weight factors in the objective functions on the secondary user's satisfaction and channel utilization was also analyzed.

RESUMEN

For wireless communication networks, cognitive radio (CR) can be used to obtain the available spectrum, and wideband compressed sensing plays a vital role in cognitive radio networks (CRNs). Using compressed sensing (CS), sampling and compression of the spectrum signal can be simultaneously achieved, and the original signal can be accurately recovered from the sampling data under sub-Nyquist rate. Using a set of wideband random filters to measure the channel energy, only the recovery of the channel energy is necessary, rather than that of all the original channel signals. Based on the semi-tensor product, this paper proposes a new model to achieve the energy compression and reconstruction of spectral signals, called semi-tensor product compressed spectrum sensing (STP-CSS), which is a generalization of traditional spectrum sensing. The experimental results show that STP-CSS can flexibly generate a low-dimensional sensing matrix for energy compression and parallel reconstruction of the signal. Compared with the existing methods, STP-CSS is proved to effectively reduce the calculation complexity of sensor nodes. Hence, the proposed model markedly improves the spectrum sensing speed of network nodes and saves storage space and energy consumption.