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.

Calculating real-time surface deformation for large active surface radio antennas using a graph neural network

This paper presents an innovative surrogate modeling method using a graph neural network to compensate for gravitational and thermal deformation in large radio telescopes.Traditionally,rapid compensation is feasible for gravitational deformation but not for temperature-induced deformation.The introduction of this method facilitates real-time calculation of deformation caused both by gravity and temperature.Constructing the surrogate model involves two key steps.First,the gravitational and thermal loads are encoded,which facilitates more efficient learning for the neural network.This is followed by employing a graph neural network as an end-to-end model.This model effectively maps external loads to deformation while preserving the spatial correlations between nodes.Simulation results affirm that the proposed method can successfully estimate the surface deformation of the main reflector in real-time and can deliver results that are practically indistinguishable from those obtained using finite element analysis.We also compare the proposed surrogate model method with the out-of-focus holography method and yield similar results.

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.

A novel fractional uplink power control framework for self-organizing networks

Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interference,Fractional Uplink Power Control(FUPC)should be optimized from network-wide perspective,which has to find a better traffic distribution model.Conventionally,traffic distribution is geographic-based,and ineffective due to tricky locating efforts.This paper proposes a novel uplink power management framework for Self-Organizing Networks(SON),which firstly builds up pathloss-based traffic distribution model and then makes the decision of FUPC based on the model.PathLoss-based Traffic Distribution(PLTD)aggregates traffic based on the propagation condition of traffic that is defined as the pathloss between the position generating the traffic and surrounding cells.Simulations show that the improvement in optimization efficiency of FUPC with PLTD can be up to 40%compared to conventional GeoGraphic-based Traffic Distribution(GGTD).

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.

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.

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.

Self-Organized Public-Key Management for Mobile Ad Hoc Networks Based on a Bidirectional Trust Model

In traditional networks , the authentication is performed by certificate authoritys（CA）,which can＇t be built in distributed mobile Ad Hoc Networks however. In this pa per, we propose a fully self-organized public key management based on bidirectional trust model without any centralized authority that allows users to generate their public-private key pairs, to issue certificates, and the trust relation spreads rationally according to the truly human relations. In contrast with the traditional self-organized public-key management, the average certificates paths get more short, the authentication passing rate gets more high and the most important is that the bidirectional trust based model satisfys the trust re quirement of hosts better.

Self-Organized Optimization of Transport on Complex Networks

We propose a self-organized optimization mechanism to improve the transport capacity of complex gradient networks. We find that, regardless of network topology, the congestion pressure can be strongly reduced by the self-organized optimization mechanism. Furthermore, the random scale-free topology is more efficient to reduce congestion compared with the random Poisson topology under the optimization mechanism. The reason is that the optimization mechanism introduces the correlations between the gradient field and the local topology of the substrate network. Due to the correlations, the cutoff degree of the gradient network is strongly reduced and the number of the nodes exerting their maximal transport capacity consumedly increases. Our work presents evidence supporting the idea that scale-free networks can efficiently improve their transport capacity by self- organized mechanism under gradient-driven transport mode.

Self-Organization Approaches for Optimization in Cognitive Radio Networks

Cognitive radio(CR) is regarded as a promising technology for providing a high spectral efficiency to mobile users by using heterogeneous wireless network architectures and dynamic spectrum access techniques.However,cognitive radio networks(CRNs)may also impose some challenges due to the ever increasing complexity of network architecture,the increasing complexity with configuration and management of large-scale networks,fluctuating nature of the available spectrum,diverse Quality-of-Service(QoS)requirements of various applications,and the intensifying difficulties of centralized control,etc.Spectrum management functions with self-organization features can be used to address these challenges and realize this new network paradigm.In this paper,fundamentals of CR,including spectrum sensing,spectrum management,spectrum mobility and spectrum sharing,have been surveyed,with their paradigms of self-organization being emphasized.Variant aspects of selforganization paradigms in CRNs,including critical functionalities of Media Access Control(MAC)- and network-layer operations,are surveyed and compared.Furthermore,new directions and open problems in CRNs are also identified in this survey.

Self-Organized Criticality Analysis of Earthquake Model Based on Heterogeneous Networks

The original Olami-Feder-Christensen （OFC） model, which displays a robust power-law behavior, is a quasistatic two-dimensional version of the Burridge-Knopoff spring-block model of earthquakes. In this paper, we introduce a modified OFC model based on heterogeneous network, improving the redistribution rule of the original model. It can be seen as a generalization of the originM OFC model We numerically investigate the influence of the parameters θandβ, which respectively control the intensity of the evolutive mechanism of the topological growth and the inner selection dynamics in our networks, and find that there are two distinct phases in the parameter space （θ,β）. Meanwhile, we study the influence of the control parameter a either. Increasing a, the earthquake behavior of the model transfers from local to global.

A Modified Earthquake Model of Self-Organized Criticality on Small World Networks

A modified Olami Feder-Christensen model of self-organized criticality on a square lattice with the properties of small world networks has been studied.We find that our model displays power-law behavior and the exponent τ of the model depends on φ,the density of long-range connections in our network.

Always-optimally-coordinated candidate selection algorithm for peer-to-peer files sharing system in mobile self-organized networks

In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.

Self-organized Critical Model Based on Complex Brain Networks with Hierarchical Organization

The dynamical behavior in the cortical brain network of macaque is studied by modelling each cortical areawith a subnetwork of interacting excitable neurons.We find that the avalanche of our model on different levels exhibitspower-law.Furthermore the power-law exponent of the distribution and the average avalanche size are affected by thetopology of the network.

Self-Organized Algorithm in LTE Networks： A Utility Function Based Optimal Power Control Scheme

In this paper, transmission power control problem for uplink LTE network is investigated and a new autonomic uplink power control scheme was proposed based on utility function, which is a self- organized algorithm. The whole approach is based on the economic concept named utility function. Then a self-organized algorithm is distributed in each mobile users to control the transmission power and to maximize the transmission utility. The proposed scheme is solved through the Lagrange multiplier technique. It is proved that the utility function based algorithm optimal power level can be model. is applicable and the achieved based on our

Self-Organized Criticality in a Simple Neuron Model Based on Scale-Free Networks

A simple model for a set of interacting idealized neurons in scale-free networks is introduced. The basic elements of the model are endowed with the main features of a neuron function. We find that our model displays powerlaw behavior of avalanche sizes and generates long-range temporal correlation. More importantly, we find different dynamical behavior for nodes with different connectivity in the scale-free networks.

Self-organized Criticality and Synchronization in a Pulse-coupled Integrate-and-Fire Neuron Model Based on Small World Networks＊

A lattice model for a set of pulse-coupled integrate-and-fire neurons with small world structure is introduced.We find that our model displays the power-law behavior accompanied with the large-scale synchronized activities among the units. And the different connectivity topologies lead to different behaviors in models of integrate-and-fire neurons.

Effects of Aging and Self-organized Criticality in a Pulse-Coupled Integrate-and-Fire Neuron Model Based on Small World Networks

Effects of aging and self-organized criticality in a pulse-coupled integrate-and-fire neuron model based on small world networks have been studied. We give the degree distribution of aging network, average shortest path length, the diameter of our network, and the clustering coefficient, and find that our neuron model displays the power-law behavior, and with the number of added links increasing, the effects of aging become smaller and smaller. This shows that if the brain works at the self-organized criticality state, it can relieve some effects caused by aging.

Self-organized Criticality in a Modified Evolution Model on Generalized Barabasi-Albert Scale-Free Networks

A modified evolution model of self-organized criticality on generalized Barabasi-Albert （GBA）.scale-free networks is investigated. In our model, we find that spatial and temporal correlations exhibit critical behaviors. More importantly, these critical behaviors change with the parameter b, which weights the distance in comparison with the degree in the GBA network evolution.