Performance Analysis of Cognitive Radio Multiple-Access Channels Over Dynamic Fading Environments

In dynamically changing environments, the spectrum-sharing method is a promising method to address the spectrum underutilization problem for cognitive radio (CR) systems. This paper investigates the capacity of cognitive radio multiple-access channel (CR-MAC) over a dynamic fading environment. Multiple secondary users (SUs) transmit to the secondary base station under the transmit power (TP) and interference temperature (IT) at the primary base station constraints. In order to perform a general analysis, a theoretical dynamic fading model termed hyper-fading model, which is suitable to the dynamic nature of cognitive radio channel, is considered. The optimal power allocation method is employed to maximize the capacity of CR-MAC for hyper-fading channel with TP and IT constraints and full channel side information. Through the numerical simulations, the capacity of the hyper-fading channels are compared with that of other channel fading models such as Rayleigh, Nakagami-2, and with an additive white Gaussian noise channel. Additionally, the impacts of the number of SUs on capacity is investigated.     

Maximized achievable rate of SINR‐measurement‐based spectrum sharing with binary feedback

Motivated by the difficulty in measuring channel state information between heterogeneous primary and secondary systems, we propose a signal‐to‐interference‐noise ratio (SINR)‐based spectrum sharing policy. In the proposed spectrum sharing policy, a secondary user who does not cause SINR outage at the primary receiver is admitted to share the primary user's spectrum. In this article, we analyze the achievable rate of a secondary user and for whom the achievable rate is maximized in the SINR‐constrained spectrum sharing. The maximized achievable rate is determined by the ratio of the distance between the secondary transmitter and the primary receiver to the distance between the secondary transmitter and receiver, and it is proportional to the distance ratio. In conclusion, secondary links with large distance ratio can support high data rate applications so long as SINR constraint of the primary user is guaranteed. Copyright © 2011 John Wiley & Sons, Ltd.     

Performance analysis of an opportunistic multi‐user cognitive network with multiple primary users

Consider a multi‐user underlay cognitive network where multiple cognitive users concurrently share the spectrum with a primary network with multiple users. The channel between the secondary network is assumed to have independent but not identical Nakagami‐m fading. The interference channel between the secondary users (SUs) and the primary users is assumed to have Rayleigh fading. A power allocation based on the instantaneous channel state information is derived when a peak interference power constraint is imposed on the secondary network in addition to the limited peak transmit power of each SU. The uplink scenario is considered where a single SU is selected for transmission. This opportunistic selection depends on the transmission channel power gain and the interference channel power gain as well as the power allocation policy adopted at the users. Exact closed form expressions for the moment‐generating function, outage performance, symbol error rate performance, and the ergodic capacity are derived. Numerical results corroborate the derived analytical results. The performance is also studied in the asymptotic regimes, and the generalized diversity gain of this scheduling scheme is derived. It is shown that when the interference channel is deeply faded and the peak transmit power constraint is relaxed, the scheduling scheme achieves full diversity and that increasing the number of primary users does not impact the diversity order. Copyright © 2014 John Wiley & Sons, Ltd.     

Cooperative amplify‐and‐forward partial relay selection with outdated channel information in spectrum‐sharing systems

Recently, cooperative relaying techniques have been integrated into spectrum‐sharing systems in an effort to yield higher spectral efficiency. Many investigations on such systems have assumed that the channel state information between the secondary transmitter and primary receiver used to calculate the maximum allowable transmit secondary user transmit power to limit the interference is known to be perfect. However, because of feedback delay from the primary receiver or the time‐varying properties of the channel, the channel information may be outdated, which is an important scenario to cognitive radio systems. In this paper, we investigate the impact of outdated channel state information for relay selection on the performance of partial relay selection with amplify and forward in underlay spectrum‐sharing systems. We begin by deriving a closed‐form expression for the outage probability of the secondary network in a Rayleigh fading channel along with peak received interference power constraint and maximum allowable secondary user transmit power. We also provide a closed‐form expression for the average bit‐error rate of the underlying system. Moreover, we present asymptotic expressions for both the outage probability and average bit‐error rate in the high signal‐to‐noise ratio regime that reveal practical insights on the achievable diversity gain. Finally, we confirm our results through comparisons with computer simulations. Copyright © 2016 John Wiley & Sons, Ltd.     

Cognitive amplify‐and‐forward relay networks with beamforming under primary user power constraint over Nakagami‐m fading channels

In this paper, we analyze the performance of cognitive amplify‐and‐forward (AF) relay networks with beamforming under the peak interference power constraint of the primary user (PU). We focus on the scenario that beamforming is applied at the multi‐antenna secondary transmitter and receiver. Also, the secondary relay network operates in channel state information‐assisted AF mode, and the signals undergo independent Nakagami‐m fading. In particular, closed‐form expressions for the outage probability and symbol error rate (SER) of the considered network over Nakagami‐m fading are presented. More importantly, asymptotic closed‐form expressions for the outage probability and SER are derived. These tractable closed‐form expressions for the network performance readily enable us to evaluate and examine the impact of network parameters on the system performance. Specifically, the impact of the number of antennas, the fading severity parameters, the channel mean powers, and the peak interference power is addressed. The asymptotic analysis manifests that the peak interference power constraint imposed on the secondary relay network has no effect on the diversity gain. However, the coding gain is affected by the fading parameters of the links from the primary receiver to the secondary relay network. Copyright © 2012 John Wiley & Sons, Ltd.     

Joint evolutionary spectrum and autoregressive‐based approach to modeling non‐stationary flat fading channels

Modeling of wireless channels, especially non‐stationary fading channels, is important for design and performance analysis of wireless communication systems. Recently, we proposed a new approach to modeling non‐stationary fading channels, based on the theory of evolutionary spectrum (ES). In this paper, we develop a time‐varying autoregressive (AR) model for a non‐stationary flat fading channel; specifically, we develop a method to determine the time‐varying coefficients of the AR channel model, given the ES of a non‐stationary process. Furthermore, with the ES theory, we develop a trace‐driven time‐varying AR channel simulator to generate a non‐stationary flat fading process. Simulation results show that the ES of the channel gain process produced by our joint ES‐and‐AR‐based channel model agrees well with the user‐specified ES, indicating the accuracy of our joint ES‐and‐AR‐based channel model. Copyright © 2012 John Wiley & Sons, Ltd.     

Effective capacity of a correlated Nakagami‐m fading channel

The grail of next‐generation wireless networks is providing real‐time services for delay‐sensitive applications, which require that the wireless networks provide QoS guarantees. The effective capacity (EC) proposed by Wu and Negi provides a powerful tool for design of QoS provisioning mechanisms. In this paper, we intend to generalize their formula for the effective capacity of a correlated Rayleigh fading channel; specifically, we derive a closed form approximate EC formula for a special correlated Nakagami‐m fading channel, for which the inverse of the correlation coefficient matrix is tridiagonal. To verify its accuracy via simulation, we develop a Green‐matrix based approach, which allows us to analytically obtain the effective capacity (given the joint probability density function of a correlated Nakagami‐m fading channel) while being able to simulate the corresponding channel gain process. Simulation results show that our EC formula is accurate. Furthermore, to facilitate the application of the EC theory to the design of practical QoS provisioning mechanisms, we propose a simple algorithm for estimating the EC of an arbitrary correlated Nakagami‐m fading channel, given channel measurements; simulation results demonstrate the accuracy of our proposed EC estimation algorithm showing its suitability in practice. Copyright © 2011 John Wiley & Sons, Ltd.     

Study on cognitive DF relaying cooperation with the mutual interference between primary and secondary users over Nakagami‐m fading channels

In this paper, the cognitive relay cooperation (CRC) wireless communication systems are investigated over Nakagami‐m fading channels. The decode‐and‐forward (DF) relay is employed to assist the communications between cognitive source and destination. Especially, to achieve full diversity order, we consider the case in which there is a direct path between cognitive source and destination. Besides the interference at primary users (PUs) created by secondary users (SUs), the interference at SUs created by PUs is also considered. For the interested CRC systems, we first achieve the exact expression for the CDF of the equivalent end‐to‐end signal‐to‐interference ratio (SIR) of CRC systems. Then, with the exact CDF, the exact average symbol error ratio (SER) and outage performance of CRC systems are achieved. The derivation is of significance, by which we can obtain a detailed knowledge about CRC systems. Though a single integral included in the derivation, it can be calculated numerically by employing some mathematical tools such as Matlab. At the same time, to obtain the insight and highlight the effect of system parameters on the considered CRC systems, by using the high SIR approximation, we obtain the asymptotic closed‐form expression of CDF as well as the ones of average SER and outage probability. From the asymptotic results, we can find the main factors that dominate the performance of CRC systems. The presented simulation results for outage probability and average SER show the derivations and simulations are in agreement. Moreover, in high SIR the achieved asymptotic results match well the exact ones. As a result, in high SIR we can employ the asymptotic closed‐form solutions to evaluate the exact performance of CRC systems. This can reduce greatly the implementation complexity. Besides this, the simulations also show that the diversity order is dominated by the fading severities of the secondary systems, i.e. the diversity order be proportional to the summation of the minimum fading severity between the two hops and that of the direct link. In contrast, the parameters of the primary systems only affect the coding gain, not the diversity gain. Copyright © 2014 John Wiley & Sons, Ltd.     

An evolutionary spectrum approach to modeling non‐stationary fading channels

To evaluate mobile communication systems, it is important to develop accurate and concise fading channel models. However, fading encountered in mobile communication is usually non‐stationary, and the existing methods can only model quasi‐stationary or piecewise‐stationary fading instead of general non‐stationary fading. To address this, this paper proposes an evolutionary spectrum (ES)‐based approach to modeling non‐stationary fading channels. Our ES approach is more general than the existing piecewise‐stationary models and is capable of characterizing a general non‐stationary fading channel that has an arbitrary ES (or time‐varying power spectral density); our ES approach is parsimonious and is also able to generate stationary fading processes. As an example, we show how to apply our ES approach to generating stationary and non‐stationary correlated Nakagami‐m fading channel processes. Simulation results show that the ES of the channel gain process produced by our ES‐based channel model agrees well with the user‐specified ES, indicating the accuracy of our ES‐based channel model. Copyright © 2011 John Wiley & Sons, Ltd.     

End‐to‐end security‐reliability analysis of multi‐hop cognitive relaying protocol with TAS/SC‐based primary communication,total interference constraint and asymmetric fading channels

In this paper, we analyze the tradeoff between outage probability (OP) and intercept probability (IP) for a multi‐hop relaying scheme in cognitive radio (CR) networks. In the proposed protocol, a multi‐antenna primary transmitter (PT) communicates with a multi‐antenna primary receiver (PR), using transmit antenna selection (TAS) / selection combining (SC) technique, while a secondary source attempts to transmit its data to a secondary destination via a multi‐hop approach in presence of a secondary eavesdropper. The secondary transmitters such as source and relays have to adjust their transmit power to satisfy total interference constraint given by PR. We consider an asymmetric fading channel model, where the secondary channels are Rician fading, while the remaining ones experience the Rayleigh fading. Moreover, an optimal interference allocation method is proposed to minimize OP of the primary network. For the secondary network, we derive exact expressions of end‐to‐end OP and IP which are verified by Monte Carlo simulations.     

Ergodic capacity analysis of cooperative amplify‐and‐forward relay networks over generalized fading channels

This paper presents two new methods for evaluating the ergodic channel capacities of cooperative non‐regenerative multirelay networks in a myriad of fading environments and under three distinct source‐adaptive transmission policies: (i) optimal rate adaptation with a fixed transmit power; (ii) optimal joint power‐and‐rate adaptation; and (iii) truncated channel inversion with fixed rate. In contrast to the previous related works, our proposed unified analytical frameworks that are based on the moment generating function and/or the cumulative distribution function of end‐to‐end signal‐to‐noise ratio allow us to gain insights into how power assignment during different transmission phases, relay node placement, fade distributions, and dissimilar fading statistics across the distinct communication links impact the ergodic capacity, without imposing any restrictions on the channel fading parameters. Copyright © 2013 John Wiley & Sons, Ltd.     

Unified performance analysis of maximal‐ratio combining for spectrum sharing systems with antenna correlation

A comprehensive analytical framework of a spectrum sharing system, in which secondary receiver (SR) is equipped with multiple antennas, is presented over Rayleigh fading channels. The impact of spatial fading correlation on the performance of spectrum sharing system with maximal‐ratio combining at the SR is investigated. In particular, we explicitly derive the CDF and moment generating function of the end‐to‐end signal‐to‐noise ratio by assuming a correlation model with arbitrary eigenvalue multiplicities at the SR. On the basis of these results, we conduct an evaluation of secondary system performance in terms of the outage probability, the average symbol error probability, and the ergodic capacity. All analytical results are verified by Monte Carlo simulations. Furthermore, to obtain an insight of system performance, the asymptotic analysis is studied to obtain the diversity gain and the coding gain in the peak transmit power dominated region. Our results show that the diversity gain is unaffected by antenna correlation whereas the coding gain is degraded. Copyright © 2013 John Wiley & Sons, Ltd.     

Interference‐resilient spectrum sharing with collision detection and data recovery for cognitive radio networks

Data recovery under collision of primary/secondary users in cognitive radio networks is largely an unaddressed problem. Existing approaches require either (a) retransmissions, (b) interference‐free alignment of transmission parameters, or (c) prior knowledge for data recovery. In contrast to the existing approaches, the paper proposes estimation of channel state information based on received collided frames and recommends techniques for spectrum sharing, collision detection, and data recovery. Specifically, based on estimated channel vector, interference‐resilient spectrum‐sharing protocol and techniques are proposed for (a) identification of primary user (PU) activity before (or during) secondary user's (SU's) transmission, (b) MIMO channel estimation under collision, (c) optimal pilot permutation, and (d) interference cancellation (with/without receiver diversity). Results are reported for different baseband modulation techniques under frequency selective/flat fading channel scenarios that demonstrate the efficacy of a proposed work.     

Chip‐interleaving direct sequence spread spectrum system over Rician multipath fading channels

Chip interleaving (CI) is a unique technique to exploit time diversity in direct sequence spread spectrum (DS/SS)‐based systems operating in fading environments. In order to facilitate design of CI systems in various fading situations, we present a performance analysis for CI DS/SS system over Rician multipath time‐varying fading channels. We derive the analytical bit error rate (BER) expression for CI DS/SS to allow fast and accurate evaluation of BER performance based on the interleaving depth selected, spreading codes employed, and the time correlation function of the channel. We then discuss some ideal cases by using the analytical results to reveal some of the insights presented in the performance analysis. For the purpose of comparison, we also obtain the BER expression for conventional DS/SS system as a special case of CI system with an interleaving depth of one. Using numerical examples, we verify the analytical results with computer simulations and illustrate the BER performance behavior of CI DS/SS system with varying interleaving depth for all possible combinations of two sets of spreading codes of different type and two different time correlation functions of the channel. Copyright © 2011 John Wiley & Sons, Ltd.     

Exact SEP and performance bounds for orthogonal space‐time block codes in cooperative multiantenna AF relaying networks

In this paper, we derive a moment generating function (MGF) for dual‐hop (DH) amplify‐and‐forward (AF) relaying networks, in which all nodes have an arbitrary number of antennas, with orthogonal space‐time block code (OSTBC) transmissions over Rayleigh fading channels. We present an exact error rate expression based on the derived MGF and another analytical approach to derive achievable performance bounds as closed‐forms of symbol error rate, outage probability, and normalized channel capacity. Furthermore, we derive the asymptotic behavior of symbol error rate and outage probability. From this asymptotic behavior, it is shown that the diversity order and its dependence on antenna configurations can be explicitly determined. Simulation results are also presented to verify their accuracy by comparing with numerical results and to provide an insight to the relationship between relaying networks' antenna configuration and diversity order. It is confirmed that the transmit antenna gain of the source node and the receive antenna gain of the relay node can be obtained only when the relay is close to the destination, and then, the transmit antenna gain of the relay node and the receive antenna gain of the destination node can be obtained only when the relay is close to the source.     

Performance analysis of a variable‐gain amplify‐and‐forward relayed mixed RF‐FSO system

In this work, an amplify‐and‐forward variable‐gain relayed mixed RF‐FSO system is studied. The considered dual‐hop system consists of a radio frequency (RF) link followed by a free space optical (FSO) channel. The RF link is affected by short‐term multipath fading and long‐term shadowing effects and is assumed to follow the generalized‐K fading distribution that approximates accurately several important distributions often used to model communication channels. The FSO channel experiences fading caused by atmospheric turbulence that is modeled by the gamma‐gamma distribution characterizing moderate and strong turbulence conditions. The FSO channel also suffers path loss and pointing error induced misalignment fading. The performance of the considered system is analyzed under the collective influence of distribution shaping parameters, pointing errors that result in misalignment fading, atmospheric turbulence, and path loss. The moment‐generating function of the Signal power to noise power ratio measured end‐to‐end for this system is derived. The cumulative distribution function for the Signal power to noise power ratio present between the source and destination receiver is also evaluated. Further, we investigate the error and outage performance and the average channel capacity for this system. The analytical expressions in closed form for the outage probability, symbol and bit error rate considering different modulation schemes and channel capacity are also derived. The mathematical expressions obtained are also demonstrated by numerical plots.     

混合频谱共享方式下多用户动态频谱分配算法

为解决混合overlay/underlay频谱共享方式下多用户动态频谱分配问题,构建了混合频谱共享方式下动态频谱分配模型,提出了基于Q学习的多用户动态频谱分配算法. 该算法在不对主用户产生有害干扰的前提下,以最大化次用户总吞吐量为目标,构建了与次用户相对应的虚拟次用户作为智能体. 通过与环境交互学习,进行信道和共享方式初选;频谱分配系统根据冲突情况和各智能体的学习结果调整信道分配策略直至次用户间无冲突. 仿真结果表明,该算法在无信道检测和信道先验知识的条件下,能根据前一时隙信道状态和次用户传输速率需求,实现动态信道分配和频谱共享方式确定,避免次用户间冲突,减少主次用户间冲突,有效提升次用户总吞吐量.     

Interference‐aware spectrum handover for cognitive radio networks

Cognitive radio (CR) is a promising technique for future wireless networks, which significantly improves spectrum utilization. In CR networks, when the primary users (PUs) appear, the secondary users (SUs) have to switch to other available channels to avoid the interference to PUs. However, in the multi‐SU scenario, it is still a challenging problem to make an optimal decision on spectrum handover because of the the accumulated interference constraint of PUs and SUs. In this paper, we propose an interference‐aware spectrum handover scheme that aims to maximize the CR network capacity and minimize the spectrum handover overhead by coordinating SUs’ handover decision optimally in the PU–SU coexisted CR networks. On the basis of the interference temperature model, the spectrum handover problem is formulated as a constrained optimization problem, which is in general a non‐deterministic polynomial‐time hard problem. To address the problem in a feasible way, we design a heuristic algorithm by using the technique of Branch and Bound. Finally, we combine our spectrum handover scheme with power control and give a convenient solution in a single‐SU scenario. Experimental results show that our algorithm can improve the network performance efficiently.Copyright © 2012 John Wiley & Sons, Ltd.     

On the optimum processing gain for a hybrid DS/FFH‐CDMA cellular system over Rayleigh fading channels

The optimization between the processing gain and the theoretically achievable average channel capacity per user (in the Shannon sense) of a constant total system's allocated bandwidth hybrid direct sequence/fast frequency hopping code‐division multiple‐access (DS/FFH‐CDMA) cellular system, when operating in a Rayleigh fading environment, is presented. Then, the spectral efficiency, expressed in (bits/s/Hz), is estimated in terms of the achievable average channel capacity per user, during the operation over a broadcast cellular time‐varying link, and leads to a simple theoretical novel‐closed‐form expression for the optimal processing gain value based on the maximization of the achieved spectral efficiency. The final expression derived can be useful for the practical design of a DS/FFH‐CDMA cellular system and for an initial quantitative analysis since it relates to the optimal processing gain applied and all system's parameters. Finally, numerical results are presented to illustrate and prove the validity of the presented analysis. Copyright © 2011 John Wiley & Sons, Ltd.     

Achievable rate region for the multiple-access channel with multiple cognitive transmitters

A scenario where one ＇dumb＇ radio and multiple cognitive radios communicating simultaneously with a common receiver is considered. In this paper, we derive an achievable rate region of the multiple-user cognitive multiple-access channel （MUCMAC） under both additive white Gaussian noise （AWGN） channel and rayleigh fading channel, by using a combination of multiple user dirty paper coding （DPC） and superposition coding. Through cognition, it is assumed that the secondary users （SUs） are able to obtain the message of the primary user （PU） non-causally beforehand. Using this side information, the SUs can perform multiple user DPC to avoid the interference from the SU. Besides, the SUs can also allocate part of their transmit power to aid the PU, using superposition coding. Therefore, the capacity region of traditional multiple-access channel （MAC） can be enlarged. Moreover, some asymptotic results are shown as the number of SUs increases. In the AWGN case, it is illustrated that the maximum achievable rate of the PU grows logarithmically with the increase of the number of SUs, whereas in the Rayleigh case, we show that the cognitive gain will increase with the decreasing of the channel signal to noise ratio （SNR）.