Cognitive Radio Ad-Hoc Networks: Some New Results on Multi-Channel Hidden Terminal Problem

Recently the Cognitive Radio (CR), in particular the CR Ad-Hoc Network (CRAHN) technology appears as a burgeoning area in wireless communication that enables utilization of limited network resources in more efficient and intelligent way;studies indicate that opportunistic utilization of the available radio frequency spectrum, without interfering the licensed primary user (PU) could be made. This paper presents some simulation based performance of the Multi-Channel Hidden Terminal (MCHT) problem on CRAHNs;new observations on the effect of the number of channels on certain PU-activity metrics, e.g., delay and throughput, are described.

Modified Black Widow Optimization-Based Enhanced Threshold Energy Detection Technique for Spectrum Sensing in Cognitive Radio Networks

This study develops an Enhanced Threshold Based Energy Detection approach(ETBED)for spectrum sensing in a cognitive radio network.The threshold identification method is implemented in the received signal at the secondary user based on the square law.The proposed method is implemented with the signal transmission of multiple outputs-orthogonal frequency division multiplexing.Additionally,the proposed method is considered the dynamic detection threshold adjustments and energy identification spectrum sensing technique in cognitive radio systems.In the dynamic threshold,the signal ratio-based threshold is fixed.The threshold is computed by considering the Modified Black Widow Optimization Algorithm(MBWO).So,the proposed methodology is a combination of dynamic threshold detection and MBWO.The general threshold-based detection technique has different limitations such as the inability optimal signal threshold for determining the presence of the primary user signal.These limitations undermine the sensing accuracy of the energy identification technique.Hence,the ETBED technique is developed to enhance the energy efficiency of cognitive radio networks.The projected approach is executed and analyzed with performance and comparison analysis.The proposed method is contrasted with the conventional techniques of theWhale Optimization Algorithm(WOA)and GreyWolf Optimization(GWO).It indicated superior results,achieving a high average throughput of 2.2 Mbps and an energy efficiency of 3.8,outperforming conventional techniques.

Secure Transmission in Cognitive Radio Networks Using Full-Duplex Technique with Outdated CSI

This paper investigates the effects of the outdated channel state information(CSI)on the secrecy performance of an underlay spectrum sharing cognitive radio networks(CRNs),where the secondary user(SU)source node(Alice)aims to transmit the trusted messages to the full-duplex(FD)aided SU receiver(Bob)with the assistance of cooperative relay(Relay).Considering the impact of feedback delay,outdated CSI will aggravate the system performance.To tackle such challenge,the collaborative zero-forcing beamforming(ZFB)scheme of FD technique is further introduced to implement jamming so as to confuse the eavesdropping and improve the security performance of the system.Under such setup,the exact and asymptotic expressions of the secrecy outage probability(SOP)under the outdated CSI case are derived,respectively.The results reveal that i)the outdated CSI of the SU transmission channel will decrease the diversity gain from min(NANR,NRNB)to NRwith NA,NRand NBbeing the number of antennas of Alice,Relay and Bob,respectively,ii)the introduction of FD technique can improve coding gain and enhance system performance.

Dynamic channel estimation-aware routing protocol in mobile cognitive radio networks for smart IIoT applications

Cognitive Radio Networks(CRNs)have become a successful platform in recent years for a diverse range of future systems,in particularly,industrial internet of things(IIoT)applications.In order to provide an efficient connection among IIoT devices,CRNs enhance spectrum utilization by using licensed spectrum.However,the routing protocol in these networks is considered one of the main problems due to node mobility and time-variant channel selection.Specifically,the channel selection for routing protocol is indispensable in CRNs to provide an adequate adaptation to the Primary User(PU)activity and create a robust routing path.This study aims to construct a robust routing path by minimizing PU interference and routing delay to maximize throughput within the IIoT domain.Thus,a generic routing framework from a cross-layer perspective is investigated that intends to share the information resources by exploiting a recently proposed method,namely,Channel Availability Probability.Moreover,a novel cross-layer-oriented routing protocol is proposed by using a time-variant channel estimation technique.This protocol combines lower layer(Physical layer and Data Link layer)sensing that is derived from the channel estimation model.Also,it periodically updates and stores the routing table for optimal route decision-making.Moreover,in order to achieve higher throughput and lower delay,a new routing metric is presented.To evaluate the performance of the proposed protocol,network simulations have been conducted and also compared to the widely used routing protocols,as a benchmark.The simulation results of different routing scenarios demonstrate that our proposed solution outperforms the existing protocols in terms of the standard network performance metrics involving packet delivery ratio(with an improved margin of around 5–20%approximately)under varying numbers of PUs and cognitive users in Mobile Cognitive Radio Networks(MCRNs).Moreover,the cross-layer routing protocol successfully achieves high routing performance in finding a robust route,selecting the high channel stability,and reducing the probability of PU interference for continued communication.

Robust beamforming for IRS-aided SWIPT in cognitive radio networks

Intelligent reflecting surface(IRS)is widely recognized as a promising technique to enhance the system perfor-mance,and thus is a hot research topic in future wireless communications.In this context,this paper proposes a robust BF scheme to improve the spectrum and energy harvesting efficiencies for the IRS-aided simultaneous wireless information and power transfer(SWIPT)in a cognitive radio network(CRN).Here,the base station(BS)utilizes spectrum assigned to the primary users(PUs)to simultaneously serve multiple energy receivers(ERs)and information receivers(IRs)through IRS-aided multicast technology.In particular,by assuming that only the imperfect channel state information(CSI)is available,we first formulate a constrained problem to maximize the minimal achievable rate of IRs,while satisfying the harvesting energy threshold of ERs,the quality-of-service requirement of IRs,the interference threshold of PUs and transmit power budget of BS.To address the non-convex problem,we then adopt triangle inequality to deal with the channel uncertainty,and propose a low-complexity algorithm combining alternating direction method of multipliers(ADMM)with alternating optimi-zation(AO)to jointly optimize the active and passive beamformers for the BS and IRS,respectively.Finally,our simulation results confirm the effectiveness of the proposed BF scheme and also provide useful insights into the importance of introducing IRS into the CRN with SWIPT.

A Double Threshold Energy Detection-Based Neural Network for Cognitive Radio Networks

In cognitive radio networks(CoR),the performance of cooperative spectrum sensing is improved by reducing the overall error rate or maximizing the detection probability.Several optimization methods are usually used to optimize the number of user-chosen for cooperation and the threshold selection.However,these methods do not take into account the effect of sample size and its effect on improving CoR performance.In general,a large sample size results in more reliable detection,but takes longer sensing time and increases complexity.Thus,the locally sensed sample size is an optimization problem.Therefore,optimizing the local sample size for each cognitive user helps to improve CoR performance.In this study,two new methods are proposed to find the optimum sample size to achieve objective-based improved(single/double)threshold energy detection,these methods are the optimum sample size N^(*)and neural networks(NN)optimization.Through the evaluation,it was found that the proposed methods outperform the traditional sample size selection in terms of the total error rate,detection probability,and throughput.

Modified Dwarf Mongoose Optimization Enabled Energy Aware Clustering Scheme for Cognitive Radio Wireless Sensor Networks

Cognitive radio wireless sensor networks(CRWSN)can be defined as a promising technology for developing bandwidth-limited applications.CRWSN is widely utilized by future Internet of Things(IoT)applications.Since a promising technology,Cognitive Radio(CR)can be modelled to alleviate the spectrum scarcity issue.Generally,CRWSN has cognitive radioenabled sensor nodes(SNs),which are energy limited.Hierarchical clusterrelated techniques for overall network management can be suitable for the scalability and stability of the network.This paper focuses on designing the Modified Dwarf Mongoose Optimization Enabled Energy Aware Clustering(MDMO-EAC)Scheme for CRWSN.The MDMO-EAC technique mainly intends to group the nodes into clusters in the CRWSN.Besides,theMDMOEAC algorithm is based on the dwarf mongoose optimization(DMO)algorithm design with oppositional-based learning(OBL)concept for the clustering process,showing the novelty of the work.In addition,the presented MDMO-EAC algorithm computed a multi-objective function for improved network efficiency.The presented model is validated using a comprehensive range of experiments,and the outcomes were scrutinized in varying measures.The comparison study stated the improvements of the MDMO-EAC method over other recent approaches.

Resource Allocation for Cognitive Network Slicing in PD-SCMA System Based on Two-Way Deep Reinforcement Learning

In this paper,we propose the Two-way Deep Reinforcement Learning(DRL)-Based resource allocation algorithm,which solves the problem of resource allocation in the cognitive downlink network based on the underlay mode.Secondary users(SUs)in the cognitive network are multiplexed by a new Power Domain Sparse Code Multiple Access(PD-SCMA)scheme,and the physical resources of the cognitive base station are virtualized into two types of slices:enhanced mobile broadband(eMBB)slice and ultrareliable low latency communication(URLLC)slice.We design the Double Deep Q Network(DDQN)network output the optimal codebook assignment scheme and simultaneously use the Deep Deterministic Policy Gradient(DDPG)network output the optimal power allocation scheme.The objective is to jointly optimize the spectral efficiency of the system and the Quality of Service(QoS)of SUs.Simulation results show that the proposed algorithm outperforms the CNDDQN algorithm and modified JEERA algorithm in terms of spectral efficiency and QoS satisfaction.Additionally,compared with the Power Domain Non-orthogonal Multiple Access(PD-NOMA)slices and the Sparse Code Multiple Access(SCMA)slices,the PD-SCMA slices can dramatically enhance spectral efficiency and increase the number of accessible users.

Power Allocation for Cooperative Communications in Non-Orthogonal Cognitive Radio Vehicular Ad-Hoc Networks

To achieve the better system performance for cooperative communication in non-orthogonal cognitive radio vehicular adhoc networks(CR-VANETs),this paper investigates the power allocation considering the interference to the main system in a controllable range.We propose a three-slot one-way vehicle system model where the mobile vehicle nodes complete information interaction with the assistance of other independent nodes by borrowing the unused radio spectrum with the primary networks.The end-to-end SNR relationship in overlay and underlay cognitive communication system mode are analyzed by using two forwarding protocol,namely,decode-and-forward(DF)protocol and amplify-and-forward(AF)protocol,respectively.The system outage probability is derived and the optimal power allocation factor is obtained via seeking the minimum value of the approximation of system outage probability.The analytical results have been confirmed by means of Monte Carlo simulations.Simulation results show that the proposed system performance in terms of outage under the optimal power allocation is superior to that under the average power allocation,and is also better than that under other power allocation systems.

Intelligent Covert Communication Design for Cooperative Cognitive Radio Network

Extensive research attentions have been devoted to studying cooperative cognitive radio networks(CCRNs),where secondary users(SU)providing cooperative transmissions can be permitted by primary users(PU)to use spectrum.In order to maximize SU’s utility,SU may transmit its own information during the period of cooperative transmission,which stimulates the use of covert transmission against PU’s monitoring.For this sake,this article reviews the motivations of studying covert communications in CCRN.In particular,three intelligent covert transmission approaches are developed for maximizing SU’s utility in CCRNs,namely,intelligent parasitic covert transmission(IPCT),intelligent jammer aided covert transmission(IJCT)and intelligent reflecting surface assisted covert transmission(IRSC).Further,some raw performance evaluations are discussed,and a range of potential research directions are also provided.

Throughput scheduling in cognitive radio networks based on immune optimization

To study the throughput scheduling problem under interference temperature in cognitive radio networks, an immune algorithm-based suboptimal method was proposed based on its NP-hard feature. The problem is modeled as a constrained optimization problem to maximize the total throughput of the secondary users（ SUs）. The mapping between the throughput scheduling problems and the immune algorithm is given. Suitable immune operators are designed such as binary antibody encoding, antibody initialization based on pre-knowledge, a proportional clone to its affinity and an adaptive mutation operator associated with the evolutionary generation. The simulation results showthat the proposed algorithm can obtain about 95% of the optimal throughput and operate with much lower liner computational complexity.

Research on Physical Layer Security in Cognitive Wireless Networks with Multiple Eavesdroppers Based on Resource Allocation Algorithm

With the rapid development of the Internet of Things (IoT), non-Orthogonal Multiple Access (NOMA) technology and cognitive wireless network are two promising technologies to improve the spectral efficiency of the system, which have been widely concerned in the field of wireless communication. However, due to the importance of ownership and privacy protection, the IoT system must provide corresponding security mechanisms. From the perspective of improving the transmission security of CR-NOMA system based on cognitive wireless network, and considering the shortcomings of traditional relay cooperative NOMA system, this paper mainly analyzes the eavesdropping channel model of multi-user CR-NOMA system and derives the expressions of system security and rate to improve the security performance of CR-NOMA system. The basic idea of DC planning algorithm and the scheme of sub-carrier power allocation to improve the transmission security of the system were introduced. An algorithm for DC-CR-NOMA was proposed to maximize the SSR of the system and minimize the energy loss. The simulation results show that under the same complexity, the security and speed of the system can be greatly improved compared with the traditional scheme.

Multi-Strategy Dynamic Spectrum Access in Cognitive Radio Networks: Modeling, Analysis and Optimization

Dynamic spectrum access(DSA) based on cognitive radios(CR) technique is an effective approach to address the "spectrum scarcity" issue. However, traditional CR-enabled DSA system employs only single DSA strategy, which might not be suited to the dynamic network environment. In this paper, we propose a multi-strategy DSA(MS-DSA) system, where the primary and the secondary system share spectrum resources with multiple DSA strategies simultaneously. To analyze the performance of the proposed MS-DSA system, we model it as a continuous-time Markov chain(CTMC) and derive the expressions to compute the corresponding performance metrics. Based on this, we define a utility function involving the concerns of effective throughput, interference quantity on primary users, and spectrum leasing cost. Two optimization schemes, named as spectrum allocation and false alarm probability selection, are proposed to maximize the utility function. Finally, numerical simulations are provided to validate our analysis and demonstrate that the performance can be significantly improved caused by virtues of the proposed MS-DSA system.

Optimal Energy-Efficient Transmission for Hybrid Spectrum Sharing in Cooperative Cognitive Radio Networks

In order to improve the energy efficiency(EE)in cognitive radio(CR),this paper investigates the joint design of cooperative spectrum sensing time and the power control optimization problem for the secondary user systems to achieve the maximum energy efficiency in a cognitive network based on hybrid spectrum sharing,meanwhile considering the maximum transmit power,user quality of service(QoS)requirements,interference limitations,and primary user protection.The optimization of energy efficient sensing time and power allocation is formulated as a non-convex optimization problem.The Dinkelbach’s method is adopted to solve this problem and to transform the non-convex optimization problem in fractional form into an equivalent optimization problem in the form of subtraction.Then,an iterative power allocation algorithm is proposed to solve the optimization problem.The simulation results show the effectiveness of the proposed algorithms for energy-efficient resource allocation in the cognitive network.

Analysis of cumulative handoff delay for graded secondary users in cognitive radio networks

According to the fact that the secondary users＇ delay requirements for data transmission are not unitary in cognitive radio networks, the secondary users are divided into two classes, denoted by SU1 and SU2, respectively. It is assumed that SU1 has a higher priority to occupy the primary users＇ unutilized channels than SU2. A preemptive resume priority M/G/1 queuing network is used to model the multiple spectrum handoffs processing. By using a state transition probability matrix and a cost matrix, the average cumulative delays of SU1 and SU2 are calculated, respectively. Numerical results show that the more the primary user＇s traffic load, the more rapidly the SU2＇s cumulative handoff delay grows. Compared with the networks where secondary users are unitary, the lower the SUI＇s arrival rate, the more obviously both SUI＇s and SU2＇s handoff delays decrease. The admission access regions limited by the maximum tolerable delay can also facilitate the design of admission control rules for graded secondary users.

Determination of Threshold for Energy Detection in Cognitive Radio Sensor Networks

The Internet of Things （loT） is called the world＇ s third wave of the information industry. As the core technology of IoT, Cognitive Radio Sensor Networks （CRSN） technology can improve spectrum utilization efficiency and lay a sofid foundation for large-scale application of IoT. Reliable spectrum sensing is a crucial task of the CR. For energy de- tection, threshold will determine the probability of detection （Pd） and the probability of false alarm Pf at the same time. While the threshold increases, Pd and Pf will both decrease. In this paper we focus on the maximum of the difference of Pd and Pf, and try to find out how to determine the threshold with this precondition. Simulation results show that the proposed method can effectively approach the ideal optimal result.

Adaptive Spectr um Decision Method for Heterogeneous Cognitive Radio Networks

To improve spectrum utilization and minimize interference to Primary User (PU), an adaptive spectrum decision method is proposed for Secondary User (SU), while taking traffic load balancing and spectrum heterogeneity into consideration. Long-term statistics and current sensing results are integrated into the proposed decision method of spectrum access. Two decision methods, namely probability based and sensing based, are presented, compared and followed by performance analysis in terms of delay. For probability based spectrum decision, Short-Time-Job-First (STJF) priority queuing discipline is employed to minimize average residual time and theoretical conclusion is derived in a novel way. For sensing based decision we treat the interrupted service of SU as newly incoming and re-decision process is initialized to find available spectrum in a First-Available-First-Access (FAFA) fashion. Effect of sensing error in PHY layer is also analyzed in terms of extended average residual time. Simulation results show that, for relatively low arriving rate of SU traffic, the proposed spectrum decision method yields at least a delay reduction of 39.5% compared with non-adaptive method. The proposed spectrum decision can significantly improve delay performance even facing sensing errors, which cause performance degeneration to both PU and SU.

Reputation-Based Hierarchically Cooperative Spectrum Sensing Scheme in Cognitive Radio Networks

Cooperative spectrum sensing in cog- nitive radio is investigated to improve the det- ection performance of Primary User （PU）. Meanwhile, cluster-based hierarchical coop- eration is introduced for reducing the overhead as well as maintaining a certain level of sens- ing performance. However, in existing hierar- chically cooperative spectrum sensing algo- rithms, the robustness problem of the system is seldom considered. In this paper, we pro- pose a reputation-based hierarchically coop- erative spectrum sensing scheme in Cognitive Radio Networks （CRNs）. Before spectrum sensing, clusters are grouped based on the location correlation coefficients of Secondary Users （SUs）. In the proposed scheme, there are two levels of cooperation, the first one is performed within a cluster and the second one is carried out among clusters. With the reputa- tion mechanism and modified MAJORITY rule in the second level cooperation, the pro- posed scheme can not only relieve the influ- ence of the shadowing, but also eliminate the impact of the PU emulation attack on a rela- tively large scale. Simulation results show that, in the scenarios with deep-shadowing or mul- tiple attacked SUs, our proposed scheme ach- ieves a better tradeoff between the system robustness and the energy saving compared with those conventionally cooperative sensing schemes.

Cooperative Jamming for Enhancing Security of Cognitive Radio Networks with Multiple Primary Users

In cognitive radio networks(CRNs), through recruiting secondary user(SU) as friendly jammer, the secrecy rate obtained by primary user(PU) can be improved. Previous work only considered a simple scenario with a single PU in their frameworks. In this paper, we will consider a more complicated scenario with multiple PUs and try to investigate the cooperative jamming between multiple PUs and a single SU. When there are multiple PUs in CRN, in order to obtain more spectrum for data transmission, SU will cooperate with multiple PUs at the same time. Considering that both PU and SU are rational and selfish individuals, the interaction between PUs and SU is formulated as a multi-leaders and single-follower Stackelberg game, wherein PU is the leader and SU is the follower. And the Stackelberg Equilibrium(SE) is considered as the final decisions accepted by all PUs and SU. Furthermore, we also prove that when a specific condition is satisfied, the existence of SE can be guaranteed. And a Gauss-Jacobi iterative algorithm is proposed to compute a SE. Finally, simulation results are given to verify the performance and demonstrate that both of the PUs' secrecy rate and the SU's transmission rate can be improved through cooperation.

A Jury-Based Trust Management Mechanism in Distributed Cognitive Radio Networks

In the trust management scheme of the distributed cognitive radio networks, the absence of the central control devices cause many problems such as a lack of standardized control for trust computation, and the absence of the decision makers in trust evaluation and collaborative decision making. A trust management mechanism based on the jury system for distributed cognitive radio networks is proposed in this paper. The "jury user" is designed to collaboratively examine the reputation of the cognitive user in the networks and to perform data fusion and spectrum allocation for distributed cognitive radio networks. Simulation analysis results show that the proposed scheme can ensure accuracy and fairness in trust evaluation and improve effectiveness and flexibility of spectrum allocation.