Outage performance of cognitive radio networks with multiple decode‐and‐forward relays

This paper considers the cognitive radio network with one primary user (PU), one secondary user (SU), and multiple decode‐and‐forward relays. We propose a relaying scheme to ensure the priority of primary transmission, where the relays are used to forward PU's message and sometimes also SU's message. First, SU is allowed to use the spectrum to transmit only when its transmission would not affect the decoding status of PU's message at all relays. Second, once the secondary transmission happens, the relays that successively decode SU's message are allowed to retransmit this message when it would not affect the decoding status of PU's message at primary receiver. The interference from PU to SU and the interference from SU to PU are both considered. By analyzing the decoding status of primary message and secondary message at different relays, we formulate the outage probabilities of both primary transmission and secondary transmission. When all channels follow Rayleigh distributions, we derive the analytical expressions for the general case of any number of relays, which are validated by means of Monte Carlo simulations. Copyright © 2016 John Wiley & Sons, Ltd.     

Energy‐efficient outage‐constrained power allocation based on statistical channel knowledge for dual‐hop cognitive relay networks

This paper investigates the power allocation problem in decode‐and‐forward cognitive dual‐hop systems over Rayleigh fading channels. In order to optimize the performance of the secondary network in terms of power consumption, an outage‐constrained power allocation scheme is proposed. The secondary nodes adjust their transmit power subject to an average interference constraint at the primary receiver and an outage probability constraint for the secondary receivers while having only statistical channel knowledge with respect to the primary nodes. We compare this approach with a power allocation scheme based on instantaneous channel state information under a peak interference constraint. Analytical and numerical results show that the proposed approach, without requiring the constant interchange of channel state information, can achieve a similar performance in terms of outage probability as that of power allocation based on instantaneous channel knowledge. Moreover, the transmit power allocated by the proposed approach is considerably smaller than the power allocated by the method based on instantaneous channel knowledge in more than 50% of the time. Copyright © 2015 John Wiley & Sons, Ltd.     

Optimal power allocation for multi-user OFDM and distributed antenna cognitive radio with RoF

In cognitive radio (CR), power allocation plays an important role in protecting primary user from disturbance of secondary user. Some existing studies about power allocation in CR utilize 'interference temperature' to achieve this protection, which might not be suitable for the OFDM-based CR. Thus in this paper, power allocation problem in multi-user orthogonal frequency division multiplexing (OFDM) and distributed antenna cognitive radio with radio over fiber (RoF) is firstly modeled as an optimization problem, where the limitation on secondary user is not 'interference temperature', but that total throughput of primary user in all the resource units (RUs) must be beyond the given threshold. Moreover, based on the theorem about maximizing the total throughput of secondary user, equal power allocation algorithm is introduced. Furthermore, as the optimization problem for power allocation is not convex, it is transformed to be a convex one with geometric programming, where the solution can be obtained using duality and Karush-Kuhn-Tucker (KKT) conditions to form the optimal power allocation algorithm. Finally, extensive simulation results illustrate the significant performance improvement of the optimal algorithm compared to the existing algorithm and equal power allocation algorithm.     

认知中继网络中认知用户基于频谱感知机会中继的中断性能分析

认知无线电中继网络中,认知用户需要成功感知到其所在簇内的主用户频谱空穴后才能成为认知中继节点,且各认知中继节点发射功率受到各自主用户干扰温度限制(ITC)。该文对认知中继节点采用分布式空时编码和解码转发协议时认知用户的中断性能进行了分析;给出了认知用户在干扰温度限制下中断概率的上下界,得出中断概率的上下界在不同干扰温度限下与认知用户归一化数据速率、中继数量和其对主用户检测概率的关系。给出了源节点和频谱感知中继节点在相同干扰温度限下的数值仿真,并对仿真结果进行了分析。     

Secure communication in cognitive radio networks with untrusted AF relays

In this paper, two underlay based cognitive cooperative radio networks, each with one secondary source (SS), one secondary destination (SD), N untrusted secondary amplify and forward relays (USAFRs), one primary transmitter, and one primary receiver (PU‐RX), are considered for evaluating the secrecy performance. The SS sends the information to the SD in two time slots via multiple USAFRs in the absence of direct link between SS and SD. In the first time slot, SS and SD transmit the message and jamming signal to multiple USAFRs, respectively. In the second slot, a selected USAFR amplifies and forwards the combined received signals to the SD. The transmit powers of the secondary nodes are chosen so as to maintain the overall interference at PU‐RX below a specified limit. The transmit power of a selected USAFR is derived using the harvested energy from the RF signals of SS and SD. Two network scenarios of eavesdropping by USAFRs are studied: in one case, all USAFRs eavesdrop; while in the second case, only the selected USAFR eavesdrops the message during forwarding of the signal and power is allocated to secondary nodes on the basis of outage threshold of primary network. We investigate the secrecy outage probability (SOP) in both of the networks under several physical parameters. Analytical framework for evaluating SOP for both the cases are given while SOP in single integration form is given for the second case. MATLAB simulation results are presented for both the cases.     

Orthogonal spectral precoder for minimizing adjacent channel leakage ratio in OFDM based cognitive radio

One of the major drawback of an orthogonal frequency division multiplexing based cognitive radio is high out‐of‐band leakage that can severely affect primary users operating in adjacent bands. The paper aims to design a new spectral precoding scheme that minimizes Adjacent Channel Leakage Ratio (ACLR) while retaining the orthogonality among data symbols. The problem is formulated as trace ratio minimization subjected to unitary constraint that can be effectively solved using iterative methods. The proposed precoder's error performance is similar to uncoded orthogonal frequency division multiplexing system due to orthogonal multiplexing. Also, it is practically realizable due to lower complexity. The scheme also extends for distinct ACLR requirements in upper and lower adjacent bands. A relative important factor is introduced so as to flexibly control the interference leakage in upper and lower adjacent channels. An algorithm is suggested for choosing suitable values of this factor. Simulation results display the superiority of proposed scheme over existing techniques in terms of ACLR and throughput. Copyright © 2016 John Wiley & Sons, Ltd.     

Cooperative quadrature physical layer network coding in wireless relay networks

This paper proposes a cooperative quadrature physical layer network coding (CQPNC) scheme for a dual‐hop cooperative relay network, which consists of two source nodes, one relay node and one destination node. All nodes in the network have one antenna, and the two source nodes transmit their signals modulated with quadrature carriers. In this paper, a cooperative quadrature physical layer network coded decode‐and‐forward (DF) relay protocol (CQPNC‐DF) is proposed to transmit the composite information from the two source nodes via the relay node to the destination node simultaneously to reduce the number of time slots required for a transmission. The proposed CQPNC‐DF relay protocol is compared with time‐division multiple‐access amplify‐and‐forward (TDMA‐AF), TDMA‐DF, cooperative network coded DF (CNC‐DF) and cooperative analog network coded AF (CANC‐AF) relay protocols to demonstrate its effectiveness in terms of bit error rate (BER) and system throughput under different propagation conditions. The simulation results reveal that the proposed CQPNC‐DF relay protocol can significantly improve the network performance. Compared with two TDMA schemes and CNC‐DF, the proposal can provide up to 100% and 50% throughput gains, respectively. Moreover, no matter what the scene, the proposed scheme always has the lowest BER in the low SNR region. Copyright © 2013 John Wiley & Sons, Ltd.     

Optimal resource allocation scheme for cognitive radio networks with relay selection based on game theory

In this paper,we present a non-transferable utility coalition graph game(NTU-CGG) based resource allocation scheme with relay selection for a downlink orthogonal frequency division multiplexing(OFDMA) based cognitive radio networks to maximize both system throughput and system fairness.In this algorithm,with the assistance of others SUs,SUs with less available channels to improve their throughput and fairness by forming a directed tree graph according to spectrum availability and traffic demands of SUs.So this scheme can effectively exploit both space and frequency diversity of the system.Performance results show that,NTU-CGG significantly improves system fairness level while not reducing the throughput comparing with other existing algorithms.     

Outage analysis of opportunistic multi-antenna relay selection in decode-and-forward relay networks

This article studies the closed-form expressions of outage performance for opportunistic relay under aggregate power constraint in decode-and-forward(DF)relay networks over Rayleigh fading channels,assuming that multiple antennas are available at the relay node.According to whether instantaneous signal-to-noise ratio(SNR)or average SNR can be utilized for relay selection,two opportunistic relay schemes,opportunistic multi-antenna relay selection(OMRS)and average best relay selection(ABRS)are proposed.The performances of both two schemes are evaluated by means of theoretical analysis and simulation.It is observed that OMRS is outage-optimal among multi-antenna relay selection schemes and closely approaches the beamforming(BF)scheme known as theoretical outage-optimal.Compared with previous single-antenna opportunistic relaying(OR)scheme,OMRS brings remarkable performance improvement,which is obtained from maximum ratio combining(MRC)and beamforming techniques.It is also shown that the performance of ABRS in asymmetric channels is close to OMRS in the low and median SNR range.     

Power splitting–based energy‐harvesting protocol for wireless‐powered communication networks with a bidirectional relay

In this paper, we apply the power splitting–based energy‐harvesting protocol to enhance the transmission between a wireless access point and a mobile user via a helping relay. The mobile user exploits the energy supplied by the access point and forwarded by the relay to transmit its own data back to the access point, again with the helping of the relay. Here, the effect of various system parameters, including power‐splitting factor and the power‐to‐noise ratio on the system performance, is rigorously studied, with closed‐form expressions for the outage probability and system throughput as the results. Furthermore, we figure out the optimal power‐splitting ratio at which the information throughput from the user to the AP is maximized, subject to the constraint on the transmitting power at the access point. All above analytical results are also supported by Monte Carlo simulation.     

Effect of imperfect channel state information and co‐channel interferences on two‐hop fixed gain amplify‐and‐forward relay networks with beamforming

This letter investigates the joint effects of imperfect channel state information and co‐channel interferences on a two‐hop fixed gain amplify‐and‐forward (AF) relay network with beamforming. Specifically, the analytical expressions of the outage probability and the average symbol error rate for the AF relaying are derived. Moreover, the asymptotic analysis at high signal‐to‐noise ratio is also presented to reveal the diversity order and array gain of the considered AF relay system. Finally, computer simulations are given to confirm the validity of the analytical results. Copyright © 2014 John Wiley & Sons, Ltd.     

协作多组多播认知无线网络的资源优化配置

考虑到无线电频谱资源日益紧缺,提出了一种基于组间组内协作传输的多播组新机制,涉及多个多播组并使用同一频谱资源以协作方式传输信息。基于认知无线网络中该机制,研究了系统的资源优化配置,理论分析得出了功率分配方案,进而讨论了系统加权总传输速率的优化,同时考虑了主用户和认知用户之间信号干扰及功率限制对传输速率的影响,最优化用户性能。仿真结果表明,优化方案下多播组传输速率随用户人数的增加而上升,达到最优化用户服务质量;当功率限制时,通过设置加权因子,能够保证主用户拥有良好的通信性能。     

Power allocation policies with full and partial inter-system channel state information for cognitive radio networks

This paper investigates several power allocation policies in orthogonal frequency division multiplexing -based cognitive radio networks under the different availability of inter-system channel state information (CSI) and the different capability of licensed primary users (PUs). Specifically, we deal with two types of PUs having different capabilities: a dumb (peak interference-power tolerable) PU and a more sophisticated (average interference-power tolerable) PU. For such PU models, we first formulate two optimization problems that maximize the capacity of unlicensed secondary user (SU) while maintaining the quality of service of PU under the assumption that both intra- and inter-system CSI are fully available. However, due to loose cooperation between SU and PU, it may be difficult or even infeasible for SU to obtain the full inter-system CSI. Thus, under the partial inter-system CSI setting, we also formulate another two optimization problems by introducing interference-power outage constraints. We propose optimal and efficient suboptimal power allocation policies for these four problems. Extensive numerical results demonstrate that the spectral efficiency achieved by SU with partial inter-system CSI is less than half of what is achieved with full inter-system CSI within a reasonable range of outage probability (e.g., less than 10 %). Further, it is shown that the average interference-power tolerable PU can help to increase the saturated spectral efficiency of SU by about 20 and 50 % in both cases of full and partial inter-system CSI, respectively.     

Resource allocation for multiuser cognitive OFDM networks with proportional rate constraints

In this paper we study the resource allocation problem for the multiuser orthogonal frequency division multiplexing (OFDM)‐based cognitive radio (CR) systems with proportional rate constraints. The mutual interference introduced by primary user (PU) and cognitive radio user (also referred to secondary user, SU) makes the optimization problem of CR systems more complex. Moreover, the interference introduced to PUs must be kept under a given threshold. In this paper, the highest achievable rate of each OFDM subchannel is calculated by jointly considering the channel gain and interference level. First, a subchannel is assigned to the SU with the highest achievable rate. The remaining subchannels are always allocated to the SU that suffers the severest unjustness. Second, an efficient bit allocation algorithm is developed to maximize the sum capacity, which is again based on the highest achievable rate of each subchannel. Finally, an adjustment procedure is designed to maintain proportional fairness. Simulation results show that the proposed algorithm maximizes the sum capacity while keeping the proportional rate constraints satisfied. The algorithm exhibits a good tradeoff between sum capacity maximization and proportional fairness. Furthermore, the proposed algorithm has lower complexity compared with other algorithms, rendering it promising for practical applications. Copyright © 2011 John Wiley & Sons, Ltd.     

认知中继网络中的信道分配方法研究

认知中继网络中,对信道进行分配可以有效地提高端到端吞吐量。对三节点认知中继网络下的信道分配进行了研究。中继节点采用解码转发协议时,提出了一种次优的分配方法,将信道按信道增益排序,然后逐个地分配中继信道。中继节点采用放大转发协议时,给出了最优的信道分配方法,提出了一种次优的信道分配方法。次优方法逐个地比较中继信道采用传统协作方式传输时的端到端吞吐量、分配为双跳信道S-R和R-D链路时的端到端吞吐量完成分配。和最优方法相比,两种次优方法以较小的性能损失换取了计算复杂度的降低。给出了数值仿真,比较了两种传输方式下的端到端吞吐量性能,验证了以上方法的有效性。通过对比仿真时间,比较了最优方法和次优方法的计算复杂度。给定信道总数,对次优方法下信道分配后的比例进行了仿真,发现待分配中继信道以1/3的比例分配为直传信道;而在放大转发下,待分配中继信道几乎不被分配为双跳信道。      

认知无线网络中基于主用户行为的联合路由和信道分配算法

针对认知无线网络中主用户行为将导致频谱瞬时变化而影响路由稳定性的问题,提出了一种基于主用户行为的路由和信道联合分配算法。该算法通过采用呼叫模型对主用户行为建模,并根据动态源路由协议的路由寻找机制,在目的节点等待多个路由请求分组后选择受主用户行为影响最小的路由,然后沿着所选定路径的反方向传送路由回复分组并完成信道分配。理论分析证明了算法中的链路平均持续时间期望与主用户活动概率成反比且具有与网络节点数成正比的计算复杂度。仿真结果表明,该算法具有比Gymkhana路由方案更高的分组投递率和更低的平均分组时延。     

Resource allocation in underlay cognitive radio networks with full‐duplex cognitive base station

This paper considers an underlay cognitive radio network with a full‐duplex cognitive base station and sets of half‐duplex downlink and uplink secondary users, sharing multiple channels with the primary user. The resource allocation problem to maximize the sum rate of all the secondary users is investigated subject to the transmit power constraints and the interference power constraint. The optimization problem is highly nonconvex, and we jointly use the dual optimization method and the successive convex approximation method to derive resource allocation algorithms to solve the problem. Extensive simulations are shown to verify the performance of the resource allocation algorithms. It is shown that the proposed algorithms achieve much higher sum rate than that of the optimal half‐duplex algorithms and the reference full‐duplex algorithms.     

Power allocation and relay selection for AF two‐path successive relaying networks

Two‐path or successive relaying, which aims to establish two relay links transmitting different information symbols in adjacent time slots, has recently emerged as an attractive wireless communication protocol to improve the spectral efficiency in half‐duplex cooperative systems. In this paper, we investigate power allocation and relay selection techniques for amplify‐and‐forward two‐path successive relaying networks. Our approach is based on the maximization of the received SNR subject to a total power budget consumed by the source and the relay assisting this specific transmission. Two scenarios including with and without direct link are considered here. We show that the main problem has a closed‐form solution and only requires a few amounts of feedback bits to be broadcasted. Numerical results reveal that the proposed approaches are more insensitive to the inter‐relay interference and robust to channel estimation errors; meanwhile, they perform better than the existing schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

Resource allocation in MIMO‐OFDM‐based cooperative cognitive radio networks: optimal and suboptimal low complexity approaches

The problem of resources allocation in multiple‐input multiple‐output‐orthogonal frequency division multiplexing based cooperative cognitive radio networks is considered, in this paper. The cooperation strategy between the secondary users is decode‐and‐forward (DF) strategy. In order to obtain an optimal subcarrier pairing, relay selection and power allocation in the system, the dual decomposition technique is recruited. The optimal resource allocation is realized under the individual power constraints in source and relays so that the sum rate is maximized while the interference induced to the primary system is kept below a pre‐specified interference temperature limit. Moreover, because of the high computational complexity of the optimal approach, a suboptimal algorithm is further proposed. The jointly allocation of the resources in suboptimal algorithm is carried out taking into account the channel qualities, the DF cooperation strategy, the interference induced to the primary system and the individual power budgets. The performance of the different approaches and the impact of the constraint values and deploying multiple antennas at users are discussed through the numerical simulation results. Copyright © 2014 John Wiley & Sons, Ltd.     

Resource allocation in heterogeneous cooperative cognitive radio networks

In cognitive radio networks (CRNs), resources available for use are usually very limited. This is generally because of the tight constraints by which the CRN operate. Of all the constraints, the most critical one is the level of permissible interference to the primary users. Attempts to mitigate the limiting effects of this constraint, thus achieving higher productivity, are a current research focus, and in this work cooperative diversity is investigated as a promising solution. Cooperative diversity has the capability to achieve diversity gain for wireless networks. In the work, therefore, the possibility of and mechanism for achieving greater utility for the CRN when cooperative diversity is incorporated are studied. To accomplish this, a resource allocation model is developed and analyzed for the heterogeneous, cooperative CRN. In the model, during cooperation, a best relay is selected to assist the secondary users that have poor channel conditions. Overall, the cooperation makes it feasible for virtually all the secondary users to improve their transmission rates while still causing minimal harm to the primary users. The results show a marked improvement in the resource allocation performance of the CRN when cooperation is used in contrast to when the CRN operates only by direct communication.