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.

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.

Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm

Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune genetic algo- rithm, the simulated annealing algorithm, the quantum genetic algorithm and the simple genetic algorithm, respectively. The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation, and has quick convergence speed and strong global searching capability, which effectively reduces the system power consumption and bit error rate.

Power Control and Routing Selection for Throughput Maximization in Energy Harvesting Cognitive Radio Networks

This paper investigates the power control and routing problem in the communication process of an energy harvesting(EH)multi-hop cognitive radio network(CRN).The secondary user(SU)nodes(i.e.,source node and relay nodes)harvest energy from the environment and use the energy exclusively for transmitting data.The SU nodes(i.e.,relay nodes)on the path,store and forward the received data to the destination node.We consider a real world scenario where the EH-SU node has only local causal knowledge,i.e.,at any time,each EH-SU node only has knowledge of its own EH process,channel state and currently received data.In order to study the power and routing issues,an optimization problem that maximizes path throughput considering quality of service(QoS)and available energy constraints is proposed.To solve this optimization problem,we propose a hybrid game theory routing and power control algorithm(HGRPC).The EH-SU nodes on the same path cooperate with each other,but EH-SU nodes on the different paths compete with each other.By selecting the best next hop node,we find the best strategy that can maximize throughput.In addition,we have established four steps to achieve routing,i.e.,route discovery,route selection,route reply,and route maintenance.Compared with the direct transmission,HGRPC has advantages in longer distances and higher hop counts.The algorithm generates more energy,reduces energy consumption and increases predictable residual energy.In particular,the time complexity of HGRPC is analyzed and its convergence is proved.In simulation experiments,the performance(i.e.,throughput and bit error rate(BER))of HGRPC is evaluated.Finally,experimental results show that HGRPC has higher throughput,longer network life,less latency,and lower energy consumption.

Optimal spectrum allocation of primary users in light-handed cognitive radio networks

In traditional cognitive radio(CR) network,secondary users(SUs) are always assumed to obey the rule of"introducing no interference to the primary users(PUs) ".However,this assumption may be not realistic as the CR devices becoming more and more intelligent nowadays.In this paper,with the concept of lighthanded CR,which is proposed to deal with the above mentioned problem by enforcing"punishment"to illegal CR transmissions,the action decisions of primary users(PUs) are modeled as a partially observable Markov decision process(POMDP),and the optimal spectrum allocation scheme with the objective of maximizing their reward is proposed,which is defined by the utility function.Furthermore,a reduced scheme with much smaller state space has been proposed in this paper for lower computational complexity.Extensive simulation results show that the proposed schemes improve the reward significantly compared to the existing scheme.

Resource Allocation for Throughput Maximization in Cognitive Radio Network with NOMA

Spectrum resources are the precious and limited natural resources.In order to improve the utilization of spectrum resources and maximize the network throughput,this paper studies the resource allocation of the downlink cognitive radio network with non-orthogonalmultiple access(CRN-NOMA).NOMA,as the key technology of the fifth-generation communication(5G),can effectively increase the capacity of 5G networks.The optimization problem proposed in this paper aims to maximize the number of secondary users(SUs)accessing the system and the total throughput in the CRN-NOMA.Under the constraints of total power,minimum rate,interference and SINR,CRN-NOMA throughput is maximized by allocating optimal transmission power.First,for the situation of multiple sub-users,an adaptive optimization method is proposed to reduce the complexity of the optimization solution.Secondly,for the optimization problem of nonlinear programming,a maximization throughput optimization algorithm based on Chebyshev and convex(MTCC)for CRN-NOMA is proposed,which converts multi-objective optimization problem into single-objective optimization problem to solve.At the same time,the convergence and time complexity of the algorithm are verified.Theoretical analysis and simulation results show that the algorithm can effectively improve the system throughput.In terms of interference and throughput,the performance of the sub-optimal solution is better than that of orthogonal-frequency-division-multiple-access(OFDMA).This paper provides important insights for the research and application of NOMA in future communications.

Delay optimization scheduling algorithm in cognitive radio networks

In cognitive radio networks,delay scheduling optimization has attracted an increasing attention in recent years. Numerous researches have been performed on it with different scenarios. However,these approaches have either high computational complexity or relatively poor performance. Delay scheduling is a constraint optimization problem with non-deterministic polynomial（ NP） hard feathers. In this paper,we proposed an immune algorithm-based suboptimal method to solve the problem. Suitable immune operators have been designed such as encoding,clone,mutation and selection. The simulation results show that the proposed algorithm yields near-optimal performance and operates with much lower computational complexity.

An Effective Secure MAC Protocol for Cognitive Radio Networks

The vast revolution in networking is increasing rapidly along with tech-nology advancements,which requires more effort from all cyberspace profes-sionals to cope with the challenges that come with advanced technology privileges and services.Hence,Cognitive Radio Network is one of the promising approaches that permit a dynamic type of smart network for improving the utili-zation of idle spectrum portions of wireless communications.However,it is vul-nerable to security threats and attacks and demands security mechanisms to preserve and protect the cognitive radio networks for ensuring a secure commu-nication environment.This paper presents an effective secure MAC protocol for cognitive radio networks,significantly enhancing the security level of the existing DSMCRN and SSMCRN protocols by eliminating the authentication server’s necessity,which can be a single point of failure to compromise the entire network communication.The proposed protocol has proven to be effective and reliable since it does not rely on a centralized entity for providing the required security for a single pair of cognitive users.The protocol also improves the performance in the context of fast switching to data channels leading to higher throughput is achieved compared to the benchmark protocols.

Securing Privacy Using Optimization and Statistical Models in Cognitive Radio Networks

Cognitive Radio Networks(CRN)are the possible and ideal solution for meeting the spectrum needs of next-generation communication systems.CRN is a promising alternative approach that allows spectrum sharing in many applications.The licensed users considered Primary Users(PU)and unlicensed users as Secondary Users(SU).Time and power consumption on security issues are considered degrading factors in performance for improving the Quality of Service(QoS).Irrespective of using different optimization techniques,the same methodology is to be updated for the task.So that,learning and optimization go hand in hand.It ensures the security in CRN,risk factors in spectrum sharing to SU for secure communication.The objective of the proposed work is to preserve the location of the SU from attackers and attain the clustering of SU to utilize the resource.Ant Colony Optimization(ACO)is implemented to increase the overall efficiency and utilization of the CRN.ACO is used to form clusters of SUs in the co-operative spectrum sensing technique.This paper deals with threat detection and classifying threats using parameters such as unlikability,context privacy,anonymity,conditional traceability,and trade-off.In this privacy-preserving model,overall accuracy is 97.4%,and it is 9%higher than the conventional models without Privacy-Preserving Architecture(PPA).

Cognitive Radio Networks Using Intelligent Reflecting Surfaces

In this article,we optimize harvesting and sensing duration for Cognitive Radio Networks(CRN)using Intelligent Reflecting Surfaces(IRS).The secondary source harvests energy using the received signal from node A.Then,it performs spectrum sensing to detect Primary Source PS activity.When PS activity is not detected,The Secondary Source SS transmits data to Secondary Destination SD where all reflected signals on IRS are in phase at SD.We show that IRS offers 14,20,26,32,38,44,50 dB enhancement in throughput using M=8,16,32,64,128,256,512 reflectors with respect to CRN without IRS.We also suggested to add a second IRS between A and SS to increase the harvested energy.The use of 2 IRS with M1=8 reflectors in the first IRS and M2=8 reflectors in the second IRS offers 18 dB gain(respectively 32 dB)gain with respect to a single IRS with M2=8 reflectors(respectively without IRS).The use of 2 IRS with M1=16 reflectors in the first IRS and M2=8 reflectors in the second IRS offers 28 dB gain(respectively 42 dB)gain with respect to a single IRS with M2=8 reflectors(respectively without IRS).Our results are valid for Nakagami channels of fading figure m.We also provide the throughput of IRS with energy harvesting.We have studied packet waiting time and total delay in the presence and absence or IRS.At Signal to Noise Ratio(SNR)per bit equal to 0 dB,packet waiting time is 0.9 ms when there is no IRS and 0.5 ms when there is an IRS with M=8 reflector.At SNR per bit equal to 0 dB,total transmission delay is 54 ms when there is no IRS and 1.5 ms when there is an IRS with M=8 reflectors.We show that the energy efficiency is larger when both harvesting and sensing durations are optimized.The maximum of energy efficiency is 260 Mbit/s/Hz/J when harvesting and sensing durations are optimized while the maximum is 80 Mbit/s/Hz/J when harvesting and sensing durations are not optimized.

Joint Optimization Strategy for Video Transmission over Distributed Cognitive Radio Networks

A novel joint optimization strategy for the secondary user( SU) was proposed to consider the short-term and long-term video transmissions over distributed cognitive radio networks( DCRNs).Since the long-term video transmission consisted of a series of shortterm transmissions, the optimization problem in the video transmission was a composite optimization process. Firstly,considering some factors like primary user's( PU's) collision limitations,non-synchronization between SU and PU,and SU's limited buffer size, the short-term optimization problem was formulated as a mixed integer non-linear program( MINLP) to minimize the block probability of video packets. Secondly,combining the minimum packet block probability obtained in shortterm optimization and SU's constraint on hardware complexity,the partially observable Markov decision process( POMDP) framework was proposed to learn PU's statistic information over DCRNs.Moreover,based on the proposed framework,joint optimization strategy was designed to obtain the minimum packet loss rate in long-term video transmission. Numerical simulation results were provided to demonstrate validity of our strategies.

A novel spectrum prediction scheme based on SVM in cognitive radio networks

In cognitive radio networks, Secondary Users (SUs) have opportunities to access the spectrum channel when primary user would not use it, which will enhance the resource utilization. In order to avoid interference to primary users, it is very important and essential for SUs to sense the idle spectrum channels, but also it is very hard to detect all the channels in a short time due to the hardware restriction. This paper proposes a novel spectrum prediction scheme based on Support Vector Machines (SVM), to save the time and energy consumed by spectrum sensing via predicting the channels' state before detecting. Besides, spectrum utilization is further improved by using the cooperative mechanism, in which SUs could share spectrum channels' history state information and prediction results with neighbor nodes. The simulation results show that the algorithm has high prediction accuracy under the condition of small training sample case, and can obviously reduce the detecting energy, which also leads to the improvement of spectrum utilization.

Key MAC Layer Technologies of Cognitive Radio Network

As a smart spectrum sharing technology, Cognitive Radio (CR) is becoming a hot topic in the field of wireless telecommunications. Besides providing traditional services, the cognitive radio network Media Access Control (MAC) layer is required to perform an entirely new set of functions for effective reusing spectrum opportunity, without causing any harmful interference to incumbents. Spectrum sensing management selects and optimizes sensing strategies and parameters by the selection of sensing mode, sensing period, sensing time, sensing channel, and sensing quiet period. Access control avoids collision with primary users mainly by cooperation access and transparent access. Dynamic spectrum allocation optimizes the allocation of uncertain spectrum for binary interference model and accumulative interference model. Security mechanism adds authentication and encryption mechanisms to MAC frame to defense MAC layer security attacks. Cross-layer design combines MAC layer information with physical layer or higher layers information, such as network layer, transmission layer, to achieve global optimization.

Linear MMSE Channel Estimation for Underlay Cognitive Radio Networks

Channel estimation techniques applied to cognitive radio networks (CRN) are analyzed for simultaneously primary and secondary channel estimations operating in underlay cognitive radio networks (uCRN). A complete base-band transmission including pilot sequence transmission, channel matrix estimation and optimal precoder matrix generation based on imperfect channel estimation are described. Also, the effect of imperfect channel estimation has been studied to provide means of developing techniques to overcome problems while enhancing the MIMO communication performance.

Efficient Selfish Attack Detection in Cognitive Radio Network

The main intention of developing cognitive radio technology is to solve the spectrum deficiency problem by allocating the spectrum dynamically to the unlicensed clients. An important aim of any wireless network is to secure communication. It is to help the unlicensed clients to utilize the maximum available licensed bandwidth, and the cognitive network is designed for opportunistic communication technology. Selfish attacks cause serious security problem because they significantly deteriorate the performance of a cognitive network. In this paper, the selfish attacks have been identified using cooperative neighboring cognitive radio ad hoc network (COOPON). A novel technique has been proposed as ICOOPON (improvised COOPON), which shows improved performance in selfish attack detection as compared to existing technique. A comparative study has been presented to find the efficiency of proposed technique. The parameters used are throughput, packet delivery ratio and end to end delay.

Multi-criteria user selection scheme for learning-based multiuser MIMO cognitive radio networks

For multiuser multiple-input-multiple-output （MIMO） cognitive radio （CR） networks a four-stage transmiision structure is proposed. In learning stage, the learning-based algorithm with low overhead and high flexibility is exploited to estimate the channel state information （ CSI ） between primary （PR） terminals and CR terminals. By using channel training in the second stage of CR frame, the channels between CR terminals can be achieved. In the third stage, a multi-criteria user selection scheme is proposed to choose the best user set for service. In data transmission stage, the total capacity maximization problem is solved with the interference constraint of PR terminals. Finally, simulation results show that the multi-criteria user selection scheme, which has the ability of changing the weights of criterions, is more flexible than the other three traditional schemes and achieves a tradeoff between user fairness and system performance.

NULL-SPACE PROJECTION AND WATERFILLING RESOURCE ALLOCATION IN MULTI-ANTENNA COGNITIVE RADIO NETWORKS

Cognitive Radio(CR) is a promising technique for the next generation mobile communi-cation system for its capability to solve the conflicts between the scarcity and underutilization of spectrum.In this paper,aiming at maximizing the system capacity of a multi-antenna CR system on the premise that avoid interference to the primary system in the same band simultaneously,a resource allocation method which is able to avoid interference between PRimary(PR) and CR users by pro-jecting the transmit signals of CR users on the null space of the PR users' channels is proposed.CR users with better channel condition are selected,and the interference from CR system to PR users can be removed completely by projecting the transmit signals of CR system on the null-space of PR users' channels.Parallel sub-channels are constructed for CR users through Singular Value Decomposition(SVD).At last,waterfilling is also adopted to increase the CR users' capacity.Simulation result demonstrates that compared with existing methods,our method can improve the achievable sum rate of CR users as well as reduce the outage probability of PR users.