An auction‐based MAC protocol for cognitive radio networks

Cognitive radio and dynamic spectrum sharing systems use innovative spectrum management techniques that allow different systems to share the same frequency band to utilize the radio spectrum in an efficient way. In this paper, we propose a novel cognitive media access control protocol for cognitive radio networks under the property‐rights model, in which secondary users are divided into several nonoverlapping groups, and each group uses the proposed auction algorithm to bid for required channels from the auctioneer appointed by primary users. Simulations indicate that our proposed media access control protocol can effectively utilize spectrum resources, achieve high system efficiency, and guarantee the fairness of channel allocation among groups. Copyright © 2011 John Wiley & Sons, Ltd.     

Sensing tasks allocation in cellular-based cognitive radio network

In Cognitive Radio (CR) Networks, especially in Cellular-based CR networks, in order to obtain the precise spectrum state which is available in the whole coverage, the spectrum sensing function need to be accomplished by the cooperation of multi-sensing nodes, i.e., cooperative spectrum sensing. This paper mainly focuses on the key question of the cooperative spectrum sensing: How many sensing nodes are required and how to allocate the sensing tasks to these sensing nodes in an effective way? In this paper, we classify the spectrum bands into three categories by a pre-sensing mechanism, in order to firstly exclude unavailable channels and select candidate channels for fine sensing in the next stage. Then the required number of sensing node for each candidate channel is determined by the proposed scheme. Through the scheme proposed in this paper, the sensing tasks allocation in cellular-based CR network can be accomplished in a high effective way and the sensing overhead could keep a low level.     

Cognitive radio network with coordinated multipoint joint transmission

Cognitive radio (CR) is considered to be a promising technology for future wireless networks to make opportunistic utilization of the unused or underused licensed spectrum. Meanwhile, coordinated multipoint joint transmission (CoMP JT) is another promising technique to improve the performance of cellular networks. In this paper, we propose a CR system with CoMP JT technique. We develop an analytical model of the received signal‐to‐noise ratio at a CR to determine the energy detection threshold and the minimum number of required samples for energy detection–based spectrum sensing in a CR network (CRN) with CoMP JT technique. The performance of energy detection–based spectrum sensing under the developed analytical model is evaluated by simulation and found to be reliable. We formulate an optimization problem for a CRN with CoMP JT technique to configure the channel allocation and user scheduling for maximizing the minimum throughput of the users. The problem is found to be a complex mixed integer linear programming. We solve the problem using an optimization tool for several CRN instances by limiting the number of slots in frames. Further, we propose a heuristic‐based simple channel allocation and user scheduling algorithm to maximize the minimum throughput of the users in CRNs with CoMP JT technique. The proposed algorithm is evaluated via simulation and found to be very efficient.     

Optimization algorithm of periodical cooperative spectrum sensing in cognitive radio

To decrease the interference to the primary user (PU) and improve the detected performance of cognitive radio (CR), a single‐band sensing scheme wherein the CR periodically senses the PU by cooperative spectrum sensing is proposed in this paper. In this scheme, CR first senses and then transmits during each period, and after the presence of the PU is detected, CR has to vacate to search another idle channel. The joint optimization algorithm based on the double optimization is proposed to optimize the periodical cooperative spectrum sensing scheme. The maximal throughput and minimal search time can be respectively obtained through the joint optimization of the local sensing time and the number of the cooperative CRs. We also extend this scheme to the periodical wideband cooperative spectrum sensing, and the joint optimization algorithm of the numbers of the sensing time slots and cooperative CRs is also proposed to obtain the maximal throughput of CR. The simulation shows that the proposed algorithm has lower computational quantity, and compared with the previous algorithms, when SNR = 5 dB, the throughput and search time of the proposed algorithm can respectively improve 0.3 kB and decrease 0.4 s. The simulation also indicates that the wideband cooperative spectrum sensing can achieve higher throughput than the single‐band cooperative spectrum sensing. Copyright © 2012 John Wiley & Sons, Ltd.     

Optimized channel prediction and auction-based channel allocation for personal cognitive networks

Cognitive networks are stands out as intelligent technology which evolved to enhance spectrum utilization. Secondary users are allowed to utilize the primary user's frequency bands on idling times. Identifying the idle licensed spectrum is achieved through spectrum sensing. The spectrum holes should be explored such that a suitable spectrum can be selected and allocated to the secondary users. Existing spectrum sensing and selection schemes have limitations due to interferences. Thus, an optimization algorithm based on bio-inspired improved weed optimization was presented in this research work for enhanced channel utilization. The optimization model explores the channel characteristics and reduces the primary network interferences through its optimal solution. Further, Markov greedy-based auction scheme was presented for channel allocation. Considering the channel capacity, delay, and switching rates the allocation is performed to enhance the overall system performance. Simulation analysis demonstrates the superior performance of the proposed model over existing techniques like particle swarm optimization and genetic algorithm.     

A Distance Based Reliable Cooperative Spectrum Sensing Algorithm in Cognitive Radio

Spectrum sensing is the most critical task in cognitive radio (CR) which needs to be performed very precisely in order to efficiently utilize the underutilized spectrum and to provide sufficient protection to the primary users (PUs). To improve the sensing performance under fading, shadowing and hidden terminal problems more than one CR users collaboratively perform the spectrum sensing called as cooperative spectrum sensing (CSS). In conventional CSS the decision of each CR is fused at fusion center with equal weights. But due to variable distance of each CR from the PU all decisions are not equally reliable and therefore should be assigned different weights according to their reliability. In this paper we propose a new weighting scheme for CSS under Rayleigh faded channel. In proposed weighting scheme, based on the distance of each CR from the PU reliability of CR nodes is determined and correspondingly appropriate weights are assigned to different users. The CSS algorithm using new weighting scheme gives better performance than conventional CSS algorithm.     

On co-channel and adjacent channel interference mitigation in cognitive radio networks

Cognitive radio (CR) is an emerging wireless communications paradigm of sharing spectrum among licensed (or, primary) and unlicensed (or, CR) users. In CR networks, interference mitigation is crucial not only for primary user protection, but also for the quality of service of CR user themselves. In this paper, we consider the problem of interference mitigation via channel assignment and power allocation for CR users. A cross-layer optimization framework for minimizing both co-channel and adjacent channel interference is developed; the latter has been shown to have considerable impact in practical systems. Cooperative spectrum sensing, opportunistic spectrum access, channel assignment, and power allocation are considered in the problem formulation. We propose a reformulation–linearization technique (RLT) based centralized algorithm, as well as a distributed greedy algorithm that uses local information for near-optimal solutions. Both algorithms are evaluated with simulations and are shown quite effective for mitigating both types of interference and achieving high CR network capacity.     

Stochastic spectrum handoff protocols for partially observable cognitive radio networks

Recent studies have been conducted to indicate the ineffective usage of licensed bands due to static spectrum allocation. In order to improve spectrum utilization, cognitive radio (CR) is therefore suggested to dynamically exploit the opportunistic primary frequency spectrums. How to provide efficient spectrum handoff has been considered a crucial issue in the CR networks. Existing spectrum handoff algorithms assume that all the channels can be correctly sensed by the CR users in order to perform appropriate spectrum handoff process. However, this assumption is impractical since excessive time will be required for the CR user to sense the entire spectrum space. In this paper, the partially observable Markov decision process (POMDP) is applied to estimate the network information by partially sensing the frequency spectrums. A POMDP-based spectrum handoff (POSH) scheme is proposed to determine the optimal target channel for spectrum handoff according to the partially observable channel state information. Moreover, a POMDP-based multi-user spectrum handoff (M-POSH) protocol is proposed to exploit the POMDP policy into multi-user CR networks by distributing CR users to frequency spectrum bins opportunistically. By adopting the policies resulted from the POSH and M-POSH algorithms for target channel selection, minimal waiting time at each occurrence of spectrum handoff can be achieved which will be feasible for multimedia applications. Numerical results illustrate that the proposed spectrum handoff protocols can effectively minimize the required waiting time for spectrum handoff in the CR networks.     

Power allocation in OFDM cognitive radio relay networks with outdated channel state information

In this paper, we study power allocation in OFDM cognitive radio (CR) relay networks. The objective of power allocation is to maximize the instantaneous capacity of the CR network. It is assumed that the available channel state information between the secondary and primary users is an outdated but correlated version of the actual instantaneous channel state information. Optimal power allocation schemes are developed for both decode‐and‐forward and amplify‐and‐forward relay assisted CR transmission, assuming that the primary users are subject to average interference constraints and the CR transmitters are subject to maximum transmit power constraint. In addition, suboptimal power allocation schemes with reduced complexity are also proposed. Performance of the proposed schemes is compared with uniform power allocation and numerical results confirm that the proposed power allocation schemes achieve significant capacity improvement in comparison to uniform power loading. Furthermore, the proposed suboptimal power allocation schemes can be used as less complex alternatives for optimal power allocation with some capacity degradation. Copyright © 2014 John Wiley & Sons, Ltd.     

Throughput analysis in censoring-based cooperative cognitive radio network with energy harvesting

An energy harvesting (EH) and cooperative cognitive radio (CR) network (CRN) is studied in this paper where CR users transmit data through a primary user (PU) channel if the channel remains idle, else an optimal number CRs helps in transmission of PU. To achieve the optimum number of CRs (ONCR) involved in cooperation, a novel scheme based on a combination of channel censoring and total error is proposed. The performance of the proposed scheme is investigated under RF harvesting scenario. The EH is dependent on sensing decision and a CR source harvests energy from PU's RF signal. The harvested energy (HE) is split into two parts: One part is used by the CR network (CRN) for its own transmission, and the other part is used for supporting PU. The effect of the energy allocation factor on total throughput is also investigated. New expressions for optimal number of CRs and throughput are developed. The effect of network parameters such as sensing time, censoring threshold, and energy allocation parameter (EAP) on throughput is investigated. Impact of distance between nodes is also studied.     

认知无线电网络中基于协作中继的资源分配算法

在认知无线电网络的协作中继机制下,中继节点利用其和源节点以及目的节点的不同公共信道为二者的通信转发数据,可以有效解决次用户的通信需求和可用带宽之间的矛盾,提高频谱利用率和系统吞吐量。基于协作中继的认知无线电网络中,不同通信链路上可能存在公共可用信道,使信道和中继的分配问题变得复杂。本文研究了公共信道存在的情况下系统的资源分配问题,基于网络最大流理论提出了两种算法:并行算法和贪婪算法,并分析了算法复杂度。仿真结果表明,两种算法都能够更有效地分配资源,提高频谱利用率,改善网络吞吐量。并行算法可以得到最优解,但其复杂度随信道公用程度的上升增长迅速,受节点并行处理能力的限制,只适用于信道公用程度较低的情况。贪婪算法不一定能得到最优解,但其复杂度较低,并且信道公用程度高时接近最优解,因此超出节点的并行处理能力后,可以选择贪婪算法。      

A proposed enhanced scheme for the dynamic frequency hopping performance in the IEEE 802.22 standard

This paper presents an integrated scheme for the dynamic‐frequency‐hopping (DFH) technique provided in literature for the IEEE 802.22 standard supporting wireless regional area networks (WRANs). The performance of DFH is analyzed thoroughly for various channel models and for a multiple‐input multiple‐output systems. The core of this research is based on the coexistence of digital terrestrial TV broadcasting and the WRANs in the TV white space. The proposed technique aims at protecting the incumbent users from interfering with the cognitive broadband access in the TV spectrum. In order to achieve this, spectrum sensing is performed in the intended working channel in DFH while spectrum monitoring with an energy‐ratio (ER) algorithm is applied during the WRAN data transmission in the working channel. Hence, in the DFH‐ER algorithm, the reappearance of a digital terrestrial TV signal in a band occupied by the WRANs would be detected immediately. This will provide interference free performance for the licensed signal as well as reliable data transmission for the unlicensed ones. Both analyses and simulation results of the proposed DFH‐ER technique compared with the conventional DFH scenario exemplify the enhancement of the WRAN data transmission while protecting the digital terrestrial TV users. Copyright © 2016 John Wiley & Sons, Ltd.     

Spatiotemporal Sensing in Cognitive Radio Networks

Cognitive radio networks need to continuously monitor spectrum to detect the presence of the licensed users. In this paper, we have exploited spatial diversity in multiuser networks to improve the spectrum sensing capabilities of centralized cognitive radio (CR) networks. We develop a fixed and a variable relay sensing scheme. The fixed relay scheme employs a relay that has a fixed location to help the cognitive network base station detect the presence of the primary user. The variable relay sensing scheme employs cognitive users distributed at various locations as relays to sense data and to improve the detection capabilities. This effectively reduces the average detection time by exploiting spatial diversity inherent in multiuser networks. Finally, we study the network outage probabilities to compare the performances of the fixed and variable relay schemes.     

一种面向CR-NOMA系统的动态功率分配算法

在密集小区的认知无线电非正交多址（cognitive radio non-orthogonal multiple access, CRNOMA）网络场景下,针对用户采取Underlay方式复用时信道频带利用率低的问题,提出了一种基于能效的组合用户动态功率分配算法.该算法在保证主用户服务质量前提下,基于用户之间的干扰和信干噪比,优化了组合多用户的接入方案,使信道接入用户数量最大且提高了频带利用率.同时,根据增益排序下的功率差额配比改进了剩余功率再分配方案,使空闲功率重新利用更加合理和有效.仿真结果表明,本文算法可以有效实现接入用户数量最大化的同时提高了频谱利用率.     

基于分层和模拟退火算法的动态信道分配方案

This paper proposes a dynamic channel allocation scheme based on cognitive radio （CR）. Firstly, the channel probing based on MMSE criterion is implemented, with which the probability distribution of channels in use by the primary user is given. Next, take the distances between the CR users and the primary user as basis to stratify the CR users, among the layers; the simulated annealing （SA） algorithm is used to implement the channel assigmnent. This algorithm differs from the well-known 0-1 matrix based allocation scheme, and keeps a good tradeoff between complexity, capacity as well as the fairness problems. The simulation results show that this algorithm can improve the allocation efficiency effectively.     

A unified spectrum sensing and throughput analysis model in cognitive radio networks

Cognitive radio (CR) is a newly developed technology for increasing spectral efficiency in wireless communication systems. In the CR networks, there exist two traditional spectrum‐sharing technologies called spectrum overlay and spectrum underlay. A new hybrid overlay/underlay paradigm has also been discussed in the literature. In this work, we create a unified spectrum sensing and throughput analysis model, which is suitable for overlay, underlay, and hybrid overlay/underlay paradigms in the CR networks. In the proposed model, the energy detection scheme is employed for the spectrum sensing in the network in which the co‐channel interference is present among primary users and secondary users (SUs). The SUs' throughput in the proposed CR system model is then analyzed. The simulations are also carried out for demonstrating the performance of overlay, underlay, and hybrid overlay/underlay paradigms. Copyright © 2013 John Wiley & Sons, Ltd.     

协作频谱感知在认知网络中的应用

认知无线电能够灵敏感知周围环境的变化,通过频谱感知功能发现频谱空洞,使得认知无线电能够与周围通信环境相适应。在认知无线电网络中,认知用户（次用户）必须连续地监控频谱,检测主用户是否存在。如果主用户存在,次用户必须尽快地退出该频段,从而不影响主用户。在文中采用一种协作机制,即两用户进行协作频谱感知,从而提高主用户的检测率,减少了检测时间,并且得到捷变增益。我们用Matlab给出仿真结果。     

利用分组过滤加强SSDF攻击防御的方案设计

在协作频谱感知网络中,设备故障、信道阴影衰落和噪声等会导致频谱感知器(如手机、平板等)发送的信息不可靠,而恶意用户在协作频谱感知网络中,也会发送错误的感知信息以混淆视听,干扰诚实用户的判决结果。不可靠消息在邻居用户间的传递必将导致感知结果产生偏差和错误,大大降低了协作频谱感知的效率。为解决上述问题,本文将置信传播算法和信誉模型相结合,提出一种基于次用户分组的频谱感知数据伪造(SSDF,Spectrum Sensing Data Falsification)攻击防御方案。该方案分两个阶段对不可靠信息进行过滤:首先,在频谱感知阶段,通过置信传播算法对次用户进行分组,过滤掉因设备故障等因素产生的不可靠用户,剩余用户则视为正常工作用户进行数据融合。然后,在数据融合阶段,根据以信誉值作为权重因子的置信传播算法来计算最终的判决值。本文所提方案分别在感知阶段和融合阶段采取了防御措施,可有效地过滤网络中的不可靠信息,减小恶劣的频谱环境对次用户感知结果的影响。仿真结果表明,本文所提方案迭代次数少、收敛快,有效地减弱了SSDF攻击带来的损害,提高了感知结果的准确性、增强了认知无线网络的安全性。      

Access Control Engine with Dynamic Priority Resource Allocation for Cognitive Radio Networks

An access control engine with dynamic priority resource allocation (ACE-DPRA) is proposed for unlicensed users to utilize free spectrum of wireless communication systems. A cognitive radio (CR) network with sensing and learning abilities is essential for unlicensed users to achieve ACE-DPRA. Three algorithms are included in ACE-DPRA to improve the spectral efficiency. While requesting to set up connection, unlicensed CR users generate excessive interferences to licensed users. The proposed ACE-DPRA with an admission control scheme allows the connection of unlicensed CR users without degrading the communication quality of licensed users. The priority algorithm for utilizing the unused spectrum is designed according to the location information of unlicensed users. A transmitted power control method is achieved by a fuzzy-learning mechanism. The spectral efficiency of wireless communication systems can be increased after adopting the proposed ACE-DPRA algorithm. Simulation results show that licensed users keep the advantages of high transmission data rate, low interference power, and low average outage probability after the connection of unlicensed CR users.