Performance Analysis and Optimization of a Cooperative Transmission Protocol in NOMA-Assisted Cognitive Radio Networks with Discrete Energy Harvesting

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.     

拟态物理学优化的认知无线电网络频谱分配

针对认知无线电网络中基于图着色模型的频谱分配问题,基于其非确定性多项式特性,以最大化网络收益总和为目标,提出了一种基于拟态物理学优化的求解算法. 在拟态物理学优化算法中,将频谱分配问题的解映射为一个具有质量的微粒,通过建立微粒的质量与其适应值之间的关系,并利用万有引力定律定义微粒间的虚拟作用力的大小,使整个群体向更好的方向运动,实现群体寻优. 给出了频谱分配问题的具体求解过程,并根据分配问题的二进制编码特点,改进了微粒的位置更新方程. 仿真实验表明：本文算法能更好地实现网络收益最大化. 关键词： 拟态物理学优化 认知无线电网络 频谱分配 网络收益     

Age of Information Minimization for Radio Frequency Energy-Harvesting Cognitive Radio Networks

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.     

Outlier-aware cooperative spectrum sensing in cognitive radio networks

This paper considers the problem of cooperative spectrum sensing in cognitive radio networks (CRN). Communication in CRNs may be disrupted due to the presence of malicious secondary users (SU) or channel impairments such as shadowing. This paper proposes a spatio-frequency framework that can detect and track malicious users and anomalous measurements in CRNs. The joint problem of spectrum sensing and malicious user identification is posed as an optimization problem that aims to exploit the sparsity inherent to both, spectrum occupancy and malicious user occurrence. Proposed scheme obtains improved performance by utilizing node location information, and can handle missing or inaccurate location information, and noisy SU reports. A distributed block-coordinate descent-based algorithm is proposed that is shown to outperform the state-of-the-art PCA-based approach, and is flexible enough to defeat a variety of attacks encountered in SU networks. An online algorithm, that can handle incorporate multiple SU readings sequentially and adapt to time-varying channels, primary user, and malicious user activity, is also proposed and shown to be consistent. Simulation results demonstrate the efficacy of the proposed algorithms.     

混沌免疫算法求解认知无线电网络资源分配问题

为了优化认知无线电网络中多用户正交频分复用子载波的资源分配, 将其转换为一个约束优化问题, 进而提出了一种基于混沌免疫优化的求解方法.给出了算法的实现过程和关键技术, 设计了适合算法求解的编码、 克隆、 重组、 变异算子.实验结果表明, 在满足认知用户速率、 所需误码率及干扰约束的条件下, 本文所用算法减小了整个系统所需的总发射功率, 同时收敛速度较快, 能够得到较优的子载波分配方案, 进而提高频谱利用效率.     

Multi-channel sensing and resource allocation in energy constrained cognitive radio networks

We consider a cognitive radio network in a multi-channel licensed environment. Secondary user transmits in a channel if the channel is sensed to be vacant. This results in a tradeoff between sensing time and transmission time. When secondary users are energy constrained, energy available for transmission is less if more energy is used in sensing. This gives rise to an energy tradeoff. For multiple primary channels, secondary users must decide appropriate sensing time and transmission power in each channel to maximize average aggregate-bit throughput in each frame duration while ensuring quality-of-service of primary users. Considering time and energy as limited resources, we formulate this problem as a resource allocation problem. Initially a single secondary user scenario is considered and solution is obtained using decomposition and alternating optimization techniques. Later we extend the analysis for the case of multiple secondary users. Simulation results are presented to study effect of channel occupancy, fading and energy availability on performance of proposed method.     

基于贝叶斯网络的认知引擎设计与重配置

以往的通信行为指导系统未来通信, 以满足用户需求并适应环境变化, 是认知无线电系统的核心所在, 为此提出了一种基于贝叶斯网络的认知引擎, 用于解决在复杂多变的电磁环境与用户需求条件下, 认知无线电系统参数自适应调整的问题. 通过对系统过去通信行为样本数据, 进行结构学习和参数学习建立认知引擎, 将系统当前环境状态和用户需求信息经预处理作为推理的证据, 应用引擎决策出系统此时最佳的工作参数, 完成系统参数重构. 本文利用OPNET工具建立一个移动无线网络完成仿真实验, 仿真结果表明该认知引擎能有效地使移动无线网络适应环境变化, 改善端到端通信性能, 进一步验证了建模方法的可行性.     

Optimal sensing energy and transmission interval in hybrid overlay–underlay cognitive radio networks with energy harvesting

In this work, we present a new concept called “transmission interval” in a hybrid overlay/underlay cognitive radio network. A transmission interval consists of a sequence of time slots during which the secondary user (SU) transmits its data using the optimal mode based on its current state. After the transmission interval ends, the SU has to choose between staying idle for a single time slot to save energy for future possible transmission, transmitting using the underlay mode without sensing to optimize the usage of the limited amount of available energy, or sensing the channel and transmitting using either overlay or underlay mode depending on the primary user (PU) state. The energy harvesting technology is also considered in the presence of multiple PUs and multiple SUs. For the SU network, a sequential decision problem is formulated using the mixed observable Markov decision process to determine the optimal sensing energy and the optimal transmission interval length that maximize the SU network throughput and minimize both the consumed energy and the interference to the PUs. Numerical results show that applying the transmission interval concept increases the SU network throughput and decreases the interference to the PUs compared to conventional models. Moreover, adding the action of underlay transmission without sensing increases the SU network throughput.     

Wireless Network Optimization for Federated Learning with Model Compression in Hybrid VLC/RF Systems

In this paper, the optimization of network performance to support the deployment of federated learning (FL) is investigated. In particular, in the considered model, each user owns a machine learning (ML) model by training through its own dataset, and then transmits its ML parameters to a base station (BS) which aggregates the ML parameters to obtain a global ML model and transmits it to each user. Due to limited radio frequency (RF) resources, the number of users that participate in FL is restricted. Meanwhile, each user uploading and downloading the FL parameters may increase communication costs thus reducing the number of participating users. To this end, we propose to introduce visible light communication (VLC) as a supplement to RF and use compression methods to reduce the resources needed to transmit FL parameters over wireless links so as to further improve the communication efficiency and simultaneously optimize wireless network through user selection and resource allocation. This user selection and bandwidth allocation problem is formulated as an optimization problem whose goal is to minimize the training loss of FL. We first use a model compression method to reduce the size of FL model parameters that are transmitted over wireless links. Then, the optimization problem is separated into two subproblems. The first subproblem is a user selection problem with a given bandwidth allocation, which is solved by a traversal algorithm. The second subproblem is a bandwidth allocation problem with a given user selection, which is solved by a numerical method. The ultimate user selection and bandwidth allocation are obtained by iteratively compressing the model and solving these two subproblems. Simulation results show that the proposed FL algorithm can improve the accuracy of object recognition by up to 16.7% and improve the number of selected users by up to 68.7%, compared to a conventional FL algorithm using only RF.     

Network capacity of cognitive radio relay network

After successful dynamic spectrum access, cognitive radio (CR) must be able to relay the message/packets to the destination node by utilizing existing primary system(s) (PS) and/or cooperative/cognitive radio nodes in the cognitive radio network. In this paper, we pioneer the exploration of the fundamental behaviors of interference between CRs and PS in such a relay network via network coding. Interference on PS’s network capacity is shown to be unavoidable and unbounded in the one-hop relay network. Extending to the tandem structure, interference is unbounded but avoidable by appropriate constraints. In cooperative relay network, interference is bounded and avoidable. Moreover, parallel cooperative relay network can accommodate more CR transmission pairs. Such an analysis can be generalized to arbitrary networks. We derive that interference is avoidable when at least one route from CR’s source to the sink bypasses the bottlenecks of PS. Then under the constraint of no interference to PS, we derive CR’s maximum network capacity in such a network. Link allocation to achieve the maximum network capacity can be formulated and solved as a linear programming problem. Consequently, given any network topology, we can determine whether CR’s interference is avoidable, and maximize CR’s network capacity without interfering PS’s network capacity. Simulation results on randomly generated network topologies show that CR’s network capacity achieves on average 1.3 times of PS’s network capacity with interference avoidance constraint, and demonstrates spectrum efficiency at networking throughput and high availability.     

混沌免疫多目标算法求解认知引擎参数优化问题

合理的认知引擎参数设置可以提高频谱的使用性能. 通过分析认知无线网络中的认知引擎参数配置, 给出了其数学模型, 并将其转化为一个多目标优化问题, 进而提出一种基于混沌免疫多目标优化的求解方法. 算法使用Logistic混沌映射初始化种群, 并在每一代将混沌特性用于最优解集的搜索; 设计了适合此问题的免疫克隆算子和抗体群更新算子, 保证了Pateto最优解集分布的多样性和均匀性. 最后, 在多载波环境下对算法进行了仿真实验. 结果表明, 算法可以根据信道条件和用户服务的动态变化, 自适应调整各个子载波的发射功率和调制方式, 可以求出更多满足偏好需求的解, 满足认知引擎参数优化要求.     

认知无线网络中基于Sigmoid函数的功率控制算法研究

为了实现认知无线网络中频谱分配公平性以及契合现代化绿色通信的需求,根据非合作博弈论和干扰温度,引入信道状态概念,设计出一种新型功率控制算法,分析了该算法的收敛性、纳什均衡解的存在性和唯一性。该算法不仅可以快速收敛,符合实时通信,而且分布式实施,简单实用。仿真结果表明,相比其他算法,该算法系统干扰小,能源消耗低,具有抗干扰性能,而且在日益多用户网络的情况下,具有低功率、低干扰,提高网络的整体效益,更加符合现代化的绿色通信的需求。     

Cooperative Spectrum Sensing Based on Multi-Features Combination Network in Cognitive Radio Network

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.     

On spectrum sensing in cognitive radio CDMA networks with beamforming

In this paper, the performance of cognitive radio (CR) code division multiple access (CDMA) networks is analyzed in the presence of receive beamforming at the base stations (BSs). More precisely, we analyze, through simulations, the performance achievable by a CR user, with and without spectrum sensing, in a three-cell scenario. Uplink communications are considered. Three different schemes for spectrum sensing with beamforming are presented, together with a scheme without spectrum sensing. CR users belong to a cognitive radio network (CRN) which is coexisting with a primary radio network (PRN). Both the CRN and the PRN are CDMA based. The CRN is assumed to utilize beamforming for its CR users. Soft hand-off (HO) and power control are considered in both the CRN and the PRN. The impact of beamforming on the system performance is analyzed, considering various metrics. In particular, we evaluate the performance of the proposed systems in terms of outage probability, blocking probability, and average data rate of CR users. The results obtained clearly indicate that significant performance improvements can be obtained by CR users with the help of beamforming. The impact of several system parameters on the performance of the three considered spectrum sensing schemes with beamforming is analyzed. Our results, in terms of probability of outage, show that the relative improvement brought by the use of beamforming is higher in the absence of spectrum sensing (reduction of 80%) than in the presence of spectrum sensing (reduction of 42%).     

Cognitive radio adaptation for power consumption minimization using biogeography-based optimization

Adaptation is one of the key capabilities of cognitive radio, which focuses on how to adjust the radio parameters to optimize the system performance based on the knowledge of the radio environment and its capability and characteristics.In this paper, we consider the cognitive radio adaptation problem for power consumption minimization. The problem is formulated as a constrained power consumption minimization problem, and the biogeography-based optimization(BBO) is introduced to solve this optimization problem. A novel habitat suitability index(HSI) evaluation mechanism is proposed,in which both the power consumption minimization objective and the quality of services(Qo S) constraints are taken into account. The results show that under different Qo S requirement settings corresponding to different types of services, the algorithm can minimize power consumption while still maintaining the Qo S requirements. Comparison with particle swarm optimization(PSO) and cat swarm optimization(CSO) reveals that BBO works better, especially at the early stage of the search, which means that the BBO is a better choice for real-time applications.     

Joint optimal fair cooperative spectrum sensing and transmission in cognitive radio

Since the sensing power consumption of cooperative spectrum sensing (CSS) will decrease the throughput of secondary users (SU) in cognitive radio (CR), a joint optimal model of fair CSS and transmission is proposed in this paper, which can compensate the sensing overhead of cooperative SUs. The model uses the periodic listen-before-transmission method, where each SU is assigned a portion of channel bandwidth, when the primary user (PU) is estimated to be free by the coordinator. Then, a joint optimization problem of local sensing time, number of cooperative SUs, transmission bandwidth and power is formulated, which can compensate the sensing overhead of cooperative SUs appropriately through choosing suitable compensating parameter. The proposed optimization problem can be solved by the Polyblock algorithm. Simulation results show that compared with the traditional model, the total system throughput of the fairness cooperation model decreases slightly, but the total throughput of the cooperative SUs improves obviously.     

3D beamforming in Intelligent Reflecting Surface (IRS)-assisted multi-user cognitive radio networks

In this paper, we consider a multi-user cognitive radio network (CRN) equipped with an intelligent reflecting surface (IRS). We examine the network performance by evaluating the fairness of the secondary system, which is satisfying the minimum required signal to interference and noise ratio (SINR) for each secondary user (SU). The minimum SINR of the SUs is maximized by joint optimization of the beamforming vector and three-dimensional beamforming (3DBF) angles at the secondary base station (SBS) and also the phase shifts of the IRS elements. This optimization problem is highly non-convex. To solve this problem, we utilize Dinkelbach’s algorithm along with an alternating optimization (AO) approach to achieve some sub-problems. Accordingly, by further applying a semi-definite relaxation method, we convert these sub-problems to equivalent convex forms and find a solution. Furthermore, analytically we propose an algorithm for optimizing 3DBF angles at the SBS. Through numerical results, the improvement of the sum SINR of the secondary system using the proposed method is illustrated. Moreover, it is shown that as the number of reflecting elements of IRS increases, the sum SINR significantly augments while satisfying fairness. Also, the convergence of the proposed algorithm is verified utilizing numerical results.     

Optimal Channel Selection algorithm for CRahNs

As the data traffic is increasing, the spectrum bands are getting congested. It causes low latency and unreliable communication. Additional spectrum can be utilized to solve this problem but moving towards higher frequency means higher power requirement and increased cost. Cognitive radio network is another solution to this problem. It helps the nodes of a network to use the channels of the nearby bands which are not being used at that time. However, it has several challenges. One of these challenges is the transmission collision with the primary users of the network. Researchers have been working on this problem. However, it is still a major concern for the researchers. This paper proposes an algorithm that selects the optimal cognitive channel for the data transmission by the secondary user in such a way so that the transmission collision with the PU is minimized. After comparison with the existing latest similar protocol, the proposed protocol has shown 5.6% improvement in the throughput, 5.3% improvement in PDR. The delay is decreased by 0.6% and the transmission collision with PUs is reduced by 2.5%.     

Benefits brought by cognitive radio for the next generation cellular networks: A perspective from industry

With the explosion of network traffic in the future IMT-advanced system, the revenue for mobile operators is not increasing anywhere near as fast as the network traffic. This means that operators must innovate, bring costs down, and leverage their networks as much as possible, given already significant investments made. Cognitive radio will solve such economic challenges on deployment and maintenance cost with two aspects. One is related to flexible spectrum usage with the used frequency range, coverage and the backbone network, such as TV white space usage. The other is that cognitive radio improves the next generation cellular network from channel adaptive to be environment aware, as in Self-Optimized Networks (SON). Cognitive radio will make the mobile communication paradigm become more and more personal with higher spectrum utilization efficiency in multiple dimensions than in the past. In this paper, we mainly focus on the benefit brought by cognitive radio for the next generation cellular networks, such as Long Term Evolution advanced or 802.16 m, and how to achieve this on application solutions and techniques. We present our initial results on these key techniques. We expect this paper to ignite the further enhanced topics on cognitive radio in IMT-advanced research and standard activities.     

Route selection for interference minimization to primary users in cognitive radio ad hoc networks: A cross layer approach

An opportunistic routing problem in a cognitive radio ad hoc network is investigated with an aim to minimize the interference to primary users (PUs) and under the constraint of a minimum end-to-end data rate for secondary users (SUs). Both amplify-and-forward (AF) and decode-and-forward (DF) relaying techniques are considered for message forwarding by SU nodes in the network. Unlike popular transmit power control based solutions for interference management in cognitive radio networks, we adopt a cross layer approach. The optimization problem is formulated as a joint power control, channel assignment and route selection problem. Next, closed form expression for transmission power is derived and corresponding channel selection scheme and routing metric are designed based on this solution. The proposed route selection schemes are shown to depend not only on gains of the interference channels between SUs and PUs but also on the values of the spectrum sensing parameters at the SU nodes in the network. Two distributed routing schemes are proposed based on our analysis; (i) optimal_DF and (ii) suboptimal_AF. The routing schemes could be implemented using existing table driven as well as on demand routing protocols. Extensive simulation results are provided to evaluate performance of our proposed schemes in random multihop networks. Results show significant reduction in PUs’ average interference experience and impressive performance as opportunistic routing schemes can be achieved by our schemes compared to traditional shortest path based routing schemes. Performance improvement is also reported over prominent recent schemes.