Impact of secondary user mobility on spectrum handoff under generalized residual time distributions in cognitive radio networks

Cognitive Radio is an emerging technology to accommodate the growing demand for wireless technology via dynamic spectrum access to enhance spectrum efficiency. Spectrum handoff is an important component of Cognitive Radio technology for practical implementation of radio frequency access strategy and better utilization of spectrum in both primary and secondary networks. The probability of spectrum handoff and expected number of spectrum handoffs are key parameters in performance analysis and design of the cognitive radio network. This work presents an analytical model to evaluate the impact of secondary users’ mobility on intra-cell spectrum handoff considering primary users’ activity model in a cognitive radio network. A standard form of intra-cell spectrum handoff probability and expected number of intra-cell spectrum handoffs are derived for complete call duration of a non-stationary secondary user. The probability and expected number of intra-cell spectrum handoffs of a post inter-cell handoff call are also derived for generalized residual time distributions of call holding time and spectrum holes. A detailed analysis of these performance measuring metrics is presented under the impact of departure rate and cell crossing rate of secondary users. The accuracy of the derived analytical result is validated by Monte-Carlo simulation of the model.     

分布式认知无线电网络中的主动频谱切换

主要研究分布式认知无线电网络中的频谱切换,并提出一种主动的频谱切换方案。认知用户通过感知结果与历史信息建立授权用户的活动模型,预测频谱的使用情况。在不对授权用户产生干扰的前提下,提前安排频谱切换。同时,采用基于蚁群任务分工算法的频谱选择方法,使得认知用户综合考虑通信参数,实现认知用户的按需切换,保证不间断的传输。仿真表明,提出的方案能够提前执行切换,并在较短的时间内完成业务量的传输,同时具备较高的灵活性,适用于分布式认知无线电网络。     

认知频谱切换延时及用户容量的排队论分析

为了分析认知无线电系统中授权用户享有更高优先级对认知用户频谱切换造成的影响,提出了一种虚拟排队切换模型,对有强制中断率限制系统中的认知频谱切换延时进行了分析;并利用分段近似的方法给出了在切换超时概率较小环境下强制中断率和认知用户容量的解析表达. 仿真与数值计算验证了虚拟排队切换模型的有效性,同时也比较了不同授权用户行为对认知频谱切换延时及用户容量造成的影响。     

Performance evaluation of sequential spectrum handoff in cognitive radio networks: a single‐user case

Powerful spectrum handover schemes enable cognitive radios to exploit transmission opportunities in primary users’ channels appropriately. In this paper, modeling and performance evaluation of sequential spectrum sensing strategy are addressed. To this end, the average number of handovers required for finding a transmission opportunity is evaluated assuming that a prior knowledge of the presence and absence probabilities of the primary users is available. Moreover, the average throughput maximization of a secondary user by optimizing its spectrum sensing time is formulated, and a set of illustrative numerical results is then presented to validate the analytical analysis.Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

Performance analysis of dynamic spectrum handoff scheme with variable bandwidth demand of secondary users for cognitive radio networks

Cognitive radio (CR) has attracted considerable attention as a promising technology for solving the current inefficient use of spectrum. In CR networks, available sub-channels are dynamically assigned to secondary users (SUs). However, when a primary user accesses a primary channel consisting of multiple sub-channels, data transmissions of the SUs already using the sub-channels may be terminated. In this paper, we analyze the performance of dynamic spectrum handoff scheme with channel bonding, in which the number of sub-channels used by an SU are variable. We model the multichannel CR network as a multiserver priority queueing system without waiting facility, deriving the blocking probability, the forced termination probability and the throughput for SUs. In terms of the way of forced termination, we consider two policies; one is that SUs using the largest number of sub-channels are forced to terminate their transmissions, and the other is that SUs using the smallest number of sub-channels are chosen for termination. The analysis is also validated by simulation. Numerical examples show that in both forced-termination policies, the throughput of SUs that are forced to terminate their transmissions degrades as the offered load to the system increases.     

A novel spectrum handoff switching decision scheme for improved performance of secondary users in cognitive radio network

Spectrum handoff (SH) in the cognitive radio network (CRN) is considered as a key challenging area to enhance the performance of secondary users (SUs) in CRN. If the primary user is detected, the SU may pause and stay on the same channel or may perform SH to another idle channel. An accurate and precise handoff decision improves the overall throughput and quality of experience of end-users. In this paper, we introduce a new SH algorithm and continuous short-sensing strategy to improve the overall throughput of SUs. In addition, we have derived the minimum length of the target channel sequence based on network-specific parameters like desired call dropping probability. Further, an optimum channel search time is obtained to minimize the handoff delay. The simulation result shows that the proposed scheme improves the overall throughput of CRN, and the mean opinion score of different video applications increases by 10%, 4.6%, and 1% for rapid motion, gentle walk, and slight motion types of video applications. In the case of VoIP applications, the maximum simultaneous call is improved by 2 times in the case of G.711, 1.72 times in the case of G.729, and 1.66 times in the case of iLBC.     

Efficient secondary access with intelligent spectrum sensing in cognitive radio networks

In cognitive radio networks, cooperative sensing can significantly improve the performance in detection of a primary user via secondary users (SUs) sharing their detection results. However, a large number of cooperative SUs may induce great sensing delay, which degrades the performance of secondary transmissions. In this paper, we jointly consider cooperative sensing and cognitive transmission in cognitive radio networks, aiming to achieve efficient secondary access with low sensing overhead under both the sensing time and reporting power limitations, where primary users are guaranteed to be sufficiently protected. We first propose an adaptive sensing scheme to lower the detection time while not degrading the detection probability. Then, based on the proposed adaptive sensing scheme, an efficient cognitive transmission protocol is well designed, which improves the throughput of secondary transmissions while ensuring the QoS of primary transmissions. We analyze the performance for the proposed secondary access framework in terms of misdetection probability, average detection time and normalized secondary throughput, respectively, and derive their closed‐form expressions over Rayleigh fading channels with considering the reporting errors accordingly. We also study the problems of optimizing the number of cooperative SUs to minimize the misdetection probability and average detection time, and maximize the normalized secondary throughput for proposed framework. Simulation results reveal that the proposed framework outperforms the traditional case significantly. Copyright © 2013 John Wiley & Sons, Ltd.     

认知无线电网络主用户模仿攻击下次用户通信性能分析

随着认知无线电网络（CRN）技术的不断发展,安全问题日益受到重视。模仿主用户（PUE）是一种典型的易于实现且对CRN影响巨大的攻击行为,根据产生的原因、目的和过程的差异,可以分为恶意不端次用户PUE和自私不端次用户PUE 2类攻击。已有文献大多针对前者进行了分析,而对后者分析极少。重点对两者进行了区分,提出了四维连续时间马尔科夫链分析模型,详细地分析了自私不端次用户PUE攻击对正常次用户通信性能的影响,并对比了几类典型的PUE攻击检测技术。通过仿真结果可以看出：PUE攻击检测技术引入自私不端次用户检测机制极为必要,可以有效地改进检测效果。     

Analysis of cognitive radio spectrum access with finite user population

A new loss model for cognitive radio spectrum access with finite user population are presented, and exact solution for the model and its approximation for computation scalability are given. Our model provides the investigation of the delay performance of a cognitive radio system. We study the delay performance of a cognitive radio system under various primary traffic loads and spectrum band allocations.     

Optimization techniques for spectrum handoff in cognitive radio networks using cluster based cooperative spectrum sensing

Wireless Networks - Spectrum handoff has an undesirable effect in utilizing the space for Secondary user (SU) in the spectrum, which causes a handoff delay in cognitive radio network. The SU...     

Optimal cooperative beamforming design in cognitive radio networks with multiple secondary user links

In this paper, a novel beamforming method is proposed for a more realistic cognitive radio system with several secondary transmitters and receivers, a number of relays, and 1 primary transmitter and receiver. When the primary user link is idle, all secondary transmitters access temporal spectrum holes to simultaneously broadcast their information to the relays each associated with an infinite buffer. In the next stage, the relays transmit the information to the secondary receivers using a cooperative beamforming method no matter whether primary user link is silent or not. The proposed method of designing the beamforming vector enables the system to maximize the power received by the secondary users while maintaining the interference plus noise power at the primary user receiver below a predefined threshold. Results of simulations confirm validity of the method and improved performance compared to the zero‐forcing beamforming. The impact of channel quality between nodes on the performance of the system is also investigated.     

A distributed spectrum handoff MSRV protocol for the cognitive radio ad hoc networks

Wireless Networks - Cognitive radio technology provides opportunistic wireless spectrums access for the secondary users (SUs) while primary users (PUs) are dormant. By emergence of a PU in the...     

Artificial bee colony–based spectrum handoff algorithm in wireless cognitive radio networks

In this work, we proposed a new artificial bee colony–based spectrum handoff algorithm for wireless cognitive radio systems. In our wireless cognitive radio system, primary users, secondary users, and related base stations exist in the same communication environment. For our artificial bee colony–based algorithm, secondary users that always struggle to discover an idle channel have a leading role. While honey bees work hard to find the best‐quality nectar source for foraging, secondary users try to find idle channels for making communication. In this way, secondary users are organized for different missions such as sensing and handoff similar to honey bees to minimize spectrum handoff delay by working together. In the spectrum handoff stage, some secondary users must sense the spectrum so that the interrupted secondary user may perform the spectrum handoff process. In our developed spectrum handoff algorithm, the spectrum availability characteristic is observed on the basis of the missions of the bees in the artificial bee colony algorithm with the aim of minimizing the spectrum handoff delay and maximizing probability of finding an idle channel. With the help of the algorithm that is developed using the artificial bee colony, spectrum handoff delay of secondary users is considerably decreased for different number of users without reducing probability of finding an available channel.     

An adaptive handoff strategy for cognitive radio networks

Spectrum handoff plays an important role in spectrum management as it is the process of seamlessly shifting the on-going transmission of a secondary user (SU) to a free channel without degrading the quality of service. In this paper, we develop an adaptive handoff algorithm that allows an SU to detect the arrival of a primary user (via sensing) and adapt to a reactive or a proactive handoff strategy accordingly. The adaptive handoff scheme first allows an SU to decide whether to stay and wait on current channel or to perform handoff. Then, in case of handoff, an SU intelligently shifts between proactive or reactive handoff modes based on primary use (PU) arrival rate. Further, a PU prioritized Markov approach is presented in order to model the interactions between PUs and SUs for smooth channel access. Numerical results show that the proposed handoff scheme minimizes the blocking probability, number of handoffs, handoff delay and data delivery time while maintaining channel utilization and system throughput at maximal level compared to simple reactive and proactive schemes.     

Throughput performance under primary user emulation attack in cognitive radio networks

Spectrum sensing in cognitive radio networks imposes some security threats to the secondary users (SUs) such as primary user emulation attack (PUEA). In the present paper, throughput of an SU is studied for cognitive radio network under PUEA where SU spectrum access is hybrid, ie, either in overlay mode or in underlay mode. A novel analytical expression for throughput of an SU in presence of PUEA is developed. Impact of several parameters such as sensing time, attacker strength, attacker's presence probabilities, maximum allowable SU transmit power, and tolerable interference limit at primary user on the throughput of an SU is investigated. The throughput performance under PUEA and without PUEA is compared.     

Performance analysis of cognitive radio networks with generalized call holding time distribution of secondary user

In cognitive radio networks (CRNs), spectrum handoff probability and expected number of spectrum handoffs are important parameters in the evaluation of network performance and design. This paper presents an analytical model for spectrum handoff probability and spectrum handoff rate for CRNs under general distribution of call holding time of secondary users (SUs). The standardized analytical forms of spectrum handoff probability and handoff rate of secondary network under negotiated scenario are derived for a complete service call duration. The effect of mobility parameters: departure rate of SUs (\(\upmu )\) and departure rate of spectrum holes (\(\uplambda )\) on spectrum handoff are also reported in this paper. Extensive results for all the proposed analytical models are obtained and presented in this paper. Analytical results show that exponential and Erlangian distribution functions are not suitable for call holding time of SU in the analysis of spectrum handoff in CRNs. Moreover, the superiority of lognormal distribution function ascertains its use for call holding time of SU in spectrum handoff estimation for better CRN performances. The Monte-Carlo simulation is also performed for spectrum handoff probability to validate the analytical model.     

Joint spectrum load balancing and handoff management in cognitive radio networks: a non-cooperative game approach

We propose a non-cooperative game theory based algorithm for spectrum management problem in cognitive radio networks taking into account the spectrum handoff effects. The objective is to minimize the spectrum access time of Secondary Users (SUs) which are competing for spectrum opportunities in heterogeneous environment. In this paper, the preemptive resume priority (PRP) M/G/1 queuing model is used to characterize the multiple handoff and data delivery time of SUs. Also an explicit solution for channels selection probabilities of each SU is extracted for PRP M/M/1 model specifically. The effect of handoffs is considered as the interrupted packets which return to the SUs’ low priority queue when the high priority Primary User’s packets are arrived to take service. The queuing delay of SUs’ and the effect of these returned packets are considered in order to balance the load of SUs on channels so that the minimum spectrum access time is sensed by each SU. The non-cooperative spectrum load balancing with handoff management game is proposed to find a distributed solution for each SU. It is shown that this game has a unique Nash equilibrium point which can be achieved by SUs as decision makers. At this equilibrium, each SU incurs the minimum delay on all channels while the free spectrum holes of channels are utilized efficiently. Simulation results are provided to evaluate the performance of the proposed scheme in terms of spectrum access delay, fairness, and channels spectrum holes utilization.     

Primary service outage and secondary service performance in cognitive radio networks

In this work, we have used stochastic geometry to analyze the effects of the radio environment and the secondary service sensing error on the primary service outage probability. We have also obtained a closed form expression for the primary service outage probability in a Rayleigh fading channel. Furthermore, an approximation was formulated for a general fading channel. The results obtained were used to drive an expression for the secondary service successful transmission density. Finally, we formulated an optimization problem to achieve highest density of secondary service successful transmissions while keeping the primary service outage probability in check by adjusting sensing error and secondary service node density to their optimal values. Copyright © 2014 John Wiley & Sons, Ltd.     

Profit maximization for secondary users in dynamic spectrum auction of cognitive radio networks

As a powerful economic theory, auction mechanism has been extensively studied in dynamic spectrum allocation for cognitive radio networks (CRNs) recently. Different from most of existing works that focused on the mechanism design from the spectrum owner's side, we study from a new perspective on profit maximization of the secondary users (SUs). Because the spectrum auction mechanism has already been designed by the spectrum owner, we derive SUs' optimal bid strategies, which maximize their profits. First, we relax the limitation of SU's value on spectrum band, which is formerly defined as the transmission rate on channel, and introduce the affiliated value considering the impacts from other SUs. Further, the optimal value determination function is derived, which maximizes SU's expected profit; second, we analyze the auctioneer cheating issue, which has great influence on SU's profit, and the Nash equilibrium strategies for both spectrum owner and SUs are derived. Moreover, the repeated auction game mechanism is proposed that resists the auctioneer cheating effectively. Copyright © 2013 John Wiley & Sons, Ltd.