Mutual interference considered power allocation in OFDM-based cognitive networks: the multiple SUs case

Power allocation for secondary users (SUs) in cognitive networks is an important issue to ensure the SUs’ quality of service. When the mutual interference between the primary users (PUs) and the SUs is taken into consideration, it is wanted to achieve the conflict-free power allocation while synchronously maximizing the capacity of the secondary network. In this paper, the optimal power allocation problem is considered in orthogonal frequency division multiplexing cognitive networks. The single SU case is primarily formulated as a constrained optimization problem. On this basis, the multiple SUs case is then studied and simulated in detail. During the analysis, the mutual interference among the PUs and the SUs is comprehensively formulated as the restrictions on the SU’s transmission power and the optimization problems are finally resolved by iterative water-filling algorithms. Consequently, the proposed power allocation scheme restrains the interference to the primary network, as well as maximizing the capacity of the secondary network. Specifying the multiple-SUs case, simulation results are exhibited in a simplified scenario to confirm the efficiency of the proposed water-filling algorithm, and the influence of the mutual interference on the power allocation and the system capacity is further illustrated.     

Joint power allocation and beamforming with users selection for cognitive radio networks via discrete stochastic optimization

Cognitive radio is a promising technique to dynamic utilize the spectrum resource and improve spectrum efficiency. In this paper, we study the problem of mutual interference cancellation among secondary users (SUs) and interference control to primary users (PUs) in spectrum sharing underlay cognitive radio networks. Multiple antennas are used at the secondary base station to form multiple beams towards individual SUs, and a set of SUs are selected to adapt to the beams. For the interference control to PUs, we study power allocation among SUs to guarantee the interference to PUs below a tolerable level while maximizing SUs?? QoS. Based on these conditions, the problem of joint power allocation and beamforming with SUs selection is studied. Specifically, we emphasize on the condition of imperfect channel sensing due to hardware limitation, short sensing time and network connectivity issues, which means that only the noisy estimate of channel information for SUs can be obtained. We formulate the optimization problem to maximize the sum rate as a discrete stochastic optimization problem, then an efficient algorithm based on a discrete stochastic optimization method is proposed to solve the joint power allocation and beamforming with SUs selection problem. We verify that the proposed algorithm has fast convergence rate, low computation complexity and good tracking capability in time-varying radio environment. Finally, extensive simulation results are presented to demonstrate the performance of the proposed scheme.     

Joint routing and channel assignment using online learning in cognitive radio networks

Cognitive radio networks (CRNs) are the solution for the problem of underutilizing the licensed spectrum for which there are more requests in the last couple of decades. In CRNs, Secondary users (SUs) are permitted to access opportunistically the licensed spectrum owned by primary users (PUs). In this paper, we address the problem of joint routing and channel assignment for several flows generated by source SUs to a given destination. We consider a more realistic model based on Markov modulated Poisson process for modeling the PUs traffic at each channel and the SUs try to exploit short lived spectrum holes between the PUs packets at the selected channel. The SUs want to cooperatively minimize the end-to-end delay of source SUs flows meanwhile the quality of service requirements of the PUs would be met. To consider partial observation of SUs about PUs activity at all channels and quick adaptation of SUs decisions to environment changes and cooperative interaction of SUs, we use decentralized partially observable markov decision process for modeling the problem. Then, an online learning based scheme is proposed for solving the problem. Simulation results show that the performance of the proposed method and the optimal method is close to each other. Also, simulation results show that the proposed method greatly outperforms related works at control of interference to the PUs while maintains the end-to-end delay of SU flows in a low level.

     

基于中断概率最小化的认知无线网络衰落信道条件下的功率控制

Cognitive radio allows Secondary Users (SUs) to dynamically use the spectrum resource li-censed to Primary Users (PUs ), and significantly improves the efficiency of spectrum utilization and is viewed as a promising technology. In cognitive radio networks, the problem of power control is an important issue. In this paper, we mainly focus on the problem of power control for fading channels in cognitive radio networks. The spectrum sharing un-derlay scenario is considered, where SUs are al-lowed to coexist with PUs on the condition that the outage probability of PUs is below the maximum outage probability threshold limitation due to the interference caused by SUs. Moreover, besides the outage probability threshold which is defined to protect the performance of PUs, we also consider the maximum transmit power constraints for each SU. With such a setup, we emphasize the problem of power control to minimize the outage probability of each SU in fading channels. Then, based on the statistical information of the fading channel, the closed expression for outage probability is given in fading channels. The Dual-Iteration Power Control (DIPC) algorithm is also proposed to minimize the outage probability based on Perron-Frobenius theo-ry and gradient descent method under the constraint condition. Finally, simulation results are illustrated to demonstrate the performance of the proposed scheme.     

Cluster‐based coordination scheme for cooperative cognitive radio networks

In this paper, a cluster‐based two‐phase coordination scheme for cooperative cognitive radio networks is proposed considering both spectrum efficiency and network fairness. Specifically, candidate secondary users (SUs) are first selected by a partner selection algorithm to enter the two‐phase cooperation with primary users (PUs). In phase I, the selected SUs cooperate with PUs to acquire a fraction of time slot as a reward. In phase II, all SUs including the unselected ones share the available spectrum resources in local clusters; each of which is managed by a cluster head who participated in the cooperation in phase I. To improve the total network utility of both PUs and SUs, the maximum weighted bipartite matching is adopted in partner selection. To further improve the network performance and communication reliability, network coding is exploited during the spectrum sharing within the cluster. Simulation results demonstrate that, with the proposed cluster‐based coordination scheme, not only the PUs' transmission performance is improved, but also SUs achieve spectrum access opportunities. Copyright © 2015 John Wiley & Sons, Ltd.     

MaxDiv: an optimal randomized spectrum access with maximum diversity scheme for cognitive radio networks

Cognitive radio network (CRN) is an emerging technology that can increase the utilization of spectrum underutilized by primary users (PUs). In the literature, most exiting investigations on CRNs have focused on how secondary users (SUs) can coexist harmlessly with the PUs. Despite the importance of such a coexistence issue, it is also crucial to investigate the coexistence of SUs because (i) the PUs usually rarely use the licensed spectrum and (ii) the advantages of CRN will significantly increase the number of SUs in the future. To address this challenging issue, we propose, in this paper, an optimal randomized spectrum access scheme, whose main ideas include the following: (i) an SU shares its sensing results with neighboring SUs and (ii) with the regional sensing results, an SU will access available channels with a non‐uniform probability distribution. We first formulate a multichannel optimal randomized multiple access (MC‐ORMA) problem that aims to maximize the throughput of the CRN; we then develop efficient distributed algorithms to solve the MC‐ORMA problem; we derive the closed‐form value of collision probability for each SU; and finally, we conduct extensive numerical experiments and compare our theoretical analysis with simulation results to demonstrate the advantages of our scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

New coalition formation game for spectrum sharing in cognitive radio networks

In cognitive radio networks, Secondary Users (SUs) can access the spectrum simultaneously with the Primary Users (PUs) in underlay mode. In this case, interference caused to the licensed users has to be effectively controlled. The SUs have to make spectrum access decisions in order to enhance their quality of service, but without causing harmful interference to the coexisting PUs. In this paper, we propose a cooperative spectrum decision, which enables the SUs to share the spectrum with the PUs more efficiently. Our approach is based on a new coalitional game in which the coalition value is a function of the SUs' spectral efficiencies, the inter‐SUs interference, and the interference caused to the PUs. By applying new Enter and Leave rules, we obtain a stable coalition structure. Simulation results show that the SUs' spectral efficiencies are considerably increased and that the interference caused to the coexisting PU is reduced by about 7.5% as compared to an opportunistic spectrum access scheme. Moreover, the proposed coalitional game results in a more balanced spectrum sharing in the network. Copyright © 2014 John Wiley & Sons, Ltd.     

Energy-efficient transceiver designs for multiuser MIMO cognitive radio networks via interference alignment

This paper studies the transceiver design for multiuser multiple-input multiple-output cognitive radio networks. Different from the conventional methods which aim at maximizing the spectral efficiency, this paper focuses on maximizing the energy efficiency (EE) of the network. First, we formulate the precoding and decoding matrix designs as optimization problems which maximize the EE of the network subject to per-user power and interference constraints. With a higher priority in accessing the spectrum, the primary users (PUs) can design their transmission strategies without awareness of the secondary user (SU) performance. Thus, we apply a full interference alignment technique to eliminate interference between the PUs. Then, the EE maximization problem for the primary network can be reformulated as a tractable concave-convex fractional program which can be solved by the Dinkelbach method. On the other hand, the uncoordinated interference from the PUs to the SUs cannot be completely eliminated due to a limited coordination between the PUs with the SUs. The secondary transceivers are designed to optimize the EE while enforcing zero-interference to the PUs. Since the EE maximization for the secondary network is an intractable fractional programming problem, we develop an iterative algorithm with provable convergence by invoking the difference of convex functions programming along with the Dinkelbach method. In addition, we also derive closed-form expressions for the solutions in each iteration to gain insights into the structures of the optimal transceivers. The simulation results demonstrate that our proposed method outperforms the conventional approaches in terms of the EE.     

Reinforcement Learning Enhanced Iterative Power Allocation in Stochastic Cognitive Wireless Mesh Networks

As the scarce spectrum resource is becoming over-crowded, cognitive wireless mesh networks have great flexibility to improve the spectrum utilization by opportunistically accessing the licensed frequency bands. One of the critical challenges for realizing such network is how to adaptively allocate transmit powers and frequency resources among secondary users (SUs) of the licensed frequency bands while maintaining the quality-of-service (QoS) requirement of the primary users (PUs). In this paper, we consider the power control problem in the context of cognitive wireless mesh networks formed by a number of clusters under the total transmit power constraint by each SU as well as the mean-squared error (MSE) constraint by PUs. The problem is modeled as a non-cooperative game. A distributed iterative power allocation algorithm is designed to reach the Nash equilibrium (NE) between the coexisting interfered links. It offers an opportunity for SUs to negotiate the best use of power and frequency with each other. Furthermore, how to adaptively negotiate the transmission power level and spectrum usage among the SUs according to the changing networking environment is discussed. We present an intelligent policy based on reinforcement learning to acquire the stochastic behavior of PUs. Based on the learning approach, the SUs can adapt to the dynamics of the interference environment state and reach new NEs quickly through partially cooperative information sharing via a common control channel. Theoretical analysis and numerical results both show effectiveness of the intelligent policy.     

Joint Beamforming and Power Allocation for Multiple Access Channels in Cognitive Radio Networks

A cognitive radio (CR) network refers to a secondary network operating in a frequency band originally licensed/allocated to a primary network consisting of one or multiple primary users (PUs). A fundamental challenge for realizing such a system is to ensure the quality of service (QoS) of the PUs as well as to maximize the throughput or ensure the QoS, such as signal-to-interference-plus-noise ratios (SINRs), of the secondary users (SUs). In this paper, we study single-input multiple output multiple access channels (SIMO-MAC) for the CR network. Subject to interference constraints for the PUs as well as peak power constraints for the SUs, two optimization problems involving a joint beamforming and power allocation for the CR network are considered: the sum-rate maximization problem and the SINR balancing problem. For the sum-rate maximization problem, zero-forcing based decision feedback equalizers are used to decouple the SIMO-MAC, and a capped multi-level (CML) water-filling algorithm is proposed to maximize the achievable sum-rate of the SUs for the single PU case. When multiple PUs exist, a recursive decoupled power allocation algorithm is proposed to derive the optimal power allocation solution. For the SINR balancing problem, it is shown that, using linear minimum mean-square-error receivers, each of the interference constraints and peak power constraints can be completely decoupled, and thus the multi-constraint optimization problem can be solved through multiple single-constraint sub-problems. Theoretical analysis for the proposed algorithms is presented, together with numerical simulations which compare the performances of different power allocation schemes.     

Efficient Spectrum Sensing with Minimum Transmission Delay in Cognitive Radio Networks

In cognitive radio (CR) networks, the secondary users (SUs) need to find idle channels via spectrum sensing for their transmission. In this paper, we study the problem of designing the sensing time to minimize the SU transmission delay under the condition of sufficient protection to primary users (PUs). Energy detection sensing scheme is used to prove that the formulated problem indeed has one optimal sensing time which yields the minimum SU transmission delay. Then, we propose a novel cooperative spectrum sensing (CSS) framework, in which one SU’s reporting time can be used for other SUs’ sensing. The analysis focuses on two fusion strategies: soft information fusion and hard information fusion. Under soft information fusion, it is proved that there exists one optimal sensing time that minimizes the SU transmission delay. Under hard information fusion, for time varying channels, the novel multi-slot CSS is derived. The performance of SU transmission delay is studied in both perfect and imperfect reporting channels. Some simple algorithms are derived to calculate the optimal sensing settings that minimize the SU transmission delay. Computer simulations show that fundamental improvement of delay performance can be obtained by the optimal sensing settings. In addition, the novel multi-slot CSS scheme shows a much lower transmission delay than CSS based on general frame structure.     

A game approach for cooperative spectrum sharing in cognitive radio networks

We consider the problem of cooperative spectrum sharing among primary users (PUs) and secondary users (SUs) in cognitive radio networks. In our system, each PU selects a proper set of SUs to serve as the cooperative relays for its transmission and in return, leases portion of channel access time to the selected SUs for their own transmission. PU decides how to select SUs and how much time it would lease to SUs, and the cooperative SUs decide their respective power levels in helping PU's transmission, which are proportional to their access times. We assume that both PUs and SUs are rational and selfish. In single‐PU scenario, we formulate the problem as a noncooperative game and prove that it converges to a unique Stackelberg equilibrium. We also propose an iterative algorithm to achieve the unique equilibrium point. We then extend the proposed cooperative mechanism to a multiple‐PU scenario and develop a heuristic algorithm to assign proper SUs to each PU considering both performance and fairness. The simulation results show that when the competition among SUs is fierce, the performance gap between our heuristic algorithm and the optimal one is smaller than 3%. Copyright © 2013 John Wiley & Sons, Ltd.     

Spectrum auction with interference constraint for cognitive radio networks with multiple primary and secondary users

Extensive research in recent years has shown the benefits of cognitive radio technologies to improve the flexibility and efficiency of spectrum utilization. This new communication paradigm, however, requires a well-designed spectrum allocation mechanism. In this paper, we propose an auction framework for cognitive radio networks to allow unlicensed secondary users (SUs) to share the available spectrum of licensed primary users (PUs) fairly and efficiently, subject to the interference temperature constraint at each PU. To study the competition among SUs, we formulate a non-cooperative multiple-PU multiple-SU auction game and study the structure of the resulting equilibrium by solving a non-continuous two-dimensional optimization problem, including the existence, uniqueness of the equilibrium and the convergence to the equilibrium in the two auctions. A distributed algorithm is developed in which each SU updates its strategy based on local information to converge to the equilibrium. We also analyze the revenue allocation among PUs and propose an algorithm to set the prices under the guideline that the revenue of each PU should be proportional to its resource. We then extend the proposed auction framework to the more challenging scenario with free spectrum bands. We develop an algorithm based on the no-regret learning to reach a correlated equilibrium of the auction game. The proposed algorithm, which can be implemented distributedly based on local observation, is especially suited in decentralized adaptive learning environments as cognitive radio networks. Finally, through numerical experiments, we demonstrate the effectiveness of the proposed auction framework in achieving high efficiency and fairness in spectrum allocation.     

Distributed power control for multiuser cognitive radio networks with quality of service and interference temperature constraints

One of the most challenging problems in dynamic resource allocation for cognitive radio networks is to adjust transmission power of secondary users (SUs) while quality of service needs of both SUs and primary users (PUs) are guaranteed. Most power control algorithms only consider interference temperature constraint in single user scenario while ignoring the interference from PUs to SUs and minimum signal to interference plus noise ratio (SINR) requirement of SUs. In this paper, a distributed power control algorithm without user cooperation is proposed for multiuser underlay CNRs. Specifically, we focus on maximizing total throughput of SUs subject to both maximum allowable transmission power constraint and SINR constraint, as well as interference temperature constraint. To reduce the burden of information exchange and computational complexity, an average interference constraint is proposed. Parameter range and convergence analysis are given for feasible solutions. The resource allocation is transformed into a convex optimization problem, which is solved by using Lagrange dual method. In computer simulations, the effectiveness of our proposed scheme is shown by comparing with distributed constrained power control algorithm and Nash bargaining power control game algorithm. Copyright © 2014 John Wiley & Sons, Ltd.     

基于稳定匹配的认知无线网络协作物理层安全机制

在Underlay认知无线网络中,次用户被允许在主用户进行数据发送时接入主用户的频谱.此时,主用户将对次用户和窃听者造成干扰.利用协作干扰技术,主用户产生的干扰可以被用来改善次用户的物理层安全.基于此,本文针对包含多个主次用户的Underlay认知无线网络,提出了一种新的协作物理层安全机制.为了在保证主用户通信质量的前提下,最大化网络中次用户的总的安全容量,该机制将对次用户进行合理的频谱接入选择和功率控制.另外,考虑到个体理性和自私性对于频谱接入稳定性的影响,该机制利用稳定匹配理论将频谱接入选择问题建模为一对一的双边匹配问题,通过构建主次用户之间的稳定匹配来保证频谱接入的稳定性.仿真结果表明,使用本文所提安全机制,可以在保证主用户通信质量的前提下,稳定而又有效地改善网络中次用户获得的总的安全容量.     

Robust Probabilistic Distributed Power Control Algorithm for Underlay Cognitive Radio Networks under Channel Uncertainties

Due to limited cooperation among users and erratic nature of wireless channel, it is difficult for secondary users (SUs) to obtain exact values of system parameters, which may lead to severe interference to primary users (PUs) and cause communication interruption for SUs. In this paper, we study robust power control problem for spectrum underlay cognitive radio networks with multiple SUs and PUs under channel uncertainties. Precisely, our objective is to minimize total transmit power of SUs under the constraints that the satisfaction probabilities of both interference temperature of PUs and signal-to-interference-plus-noise ratio of SUs exceed some thresholds. With knowledge of statistical distribution of fading channel, probabilistic constraints are transformed into closed forms. Under a weighted interference temperature constraint, a globally distributed power control iterative algorithm with forgetting factor to increase convergence speed is obtained by dual decomposition methods. Numerical results show that our proposed algorithm outperforms worst case method and non-robust method.     

A low‐complexity resource allocation algorithm in OFDMA‐based cooperative cognitive radio networks

In this paper, we propose a low‐complexity resource allocation algorithm for the orthogonal frequency division multiplexing cooperative cognitive radio networks, where multiple primary users (PUs) and multiple secondary users (SUs) coexist. Firstly, we introduce a new concept of ‘efficiency capacity’ to represent the channel conditions of SUs by considering both of the interference caused by the PUs and the channel gains of the SUs with the assist of the relays. Secondly, we allocate the relay, subcarrier and transmission power jointly under the constraint of limiting interference caused to the PUs. Simulation results show that the proposed algorithm can achieve a high data rate with a relative low power level. Copyright © 2014 John Wiley & Sons, Ltd.     

Prediction‐based MAC‐layer sensing in cognitive radio networks

We consider a cognitive radio network which coexists with multiple primary users (PUs) and secondary users (SUs) transmit over time‐varying channels. In this scenario, one problem of the existing work is the poor performances of throughput and fairness due to variances of SUs' channel conditions and PUs' traffic patterns. To solve this problem, we propose a novel prediction‐based MAC‐layer sensing algorithm. In the proposed algorithm, the SUs' channel quality information and the probability of the licensed channel being idle are predicted. Through the earlier predicted information, we schedule the SUs to sense and transmit on different licensed channels. Specifically, multiple significant factors, including network throughput and fairness, are jointly considered in the proposed algorithm. Then, we formulate the prediction‐based sensing scheduling problem as an optimization problem and solve it with the Hungarian algorithm in polynomial time. Simulation results show that the proposed prediction‐based sensing scheduling algorithm could achieve a good tradeoff between network throughput and fairness among SUs. Copyright © 2014 John Wiley & Sons, Ltd.     

认知无线电中基于MIMO波束成形的协同频谱接入设计

协同认知无线电技术由于其高效的频谱利用效率已经吸引越来越多的关注。在协同认知网络中,当第一用户（Primary User,PU）之间的信道状况恶劣时,特定的第二用户（Secondary User, SU）被选为中继协同PU完成信息传递,作为回报,PU分配一定的信道资源给SU,使其用于传输自己的信息。当SU系统中一个节点拥有多天线时,假设其可以很好的获悉其与PU之间的信道状态信息,通过波束成形设计可以使其在中继PU信息的同时完成自身信息的发送,而且使两者之间的信号互不干扰。这种频谱共享式的接入方式可以节约信道资源,提高频谱利用率。本文对采用放大转发（Amplify and Forward, AF）中继协议的SU发射端分别采用最小化加权均方误差和准则（Minimizing Sum of Weighted Mean Square Errors, MSWMSE）和迫零准则（Zero Forcing, ZF）对波束成形参数进行设计。仿真结果表明,两种设计方式都可以满足消除用户间干扰的要求;另外,由于基于MSWMSE准则的波束成形参数能够更好的平衡噪声和用户间干扰项对信号的损耗,因而获得更优的性能表现,而且通过调整加权系数可以满足PU用户不同的性能要求。      

Dynamic spectrum access based on interruptible spectrum leasing

Dynamic spectrum access (DSA) based on interruptible spectrum leasing allows secondary users (SUs) to lease a licensed, but idle, spectrum that is owned by primary users (PUs) on condition that the PUs preempt the access to the leased spectrum. This paper considers a DSA scenario where the SUs opportunistically use the primary spectrum in addition to their own band and the PUs use their own band regardless of the opportunistic access. This operating scenario can contribute to leverage the spectrum utilization by exploiting underutilized spectrum resources, but involves a problem that the SUs may be forced to interrupt on-going services in response to the PUs?? reclamation of the leased spectrum. In this paper, we address the optimal call admission control (CAC) problem in order to coordinate the DSA based on interruptible spectrum leasing by considering the tradeoff between the additional spectrum use and the penalty on the service interruption. To this end, we adopt the profit of the secondary wireless service provider as a cost function of the CAC policy in a market mechanism manner. The optimization problem is modeled as a profit maximization problem, and a linear programming (LP) formulation of the semi-Markov decision process approach is provided. Through the simulation results, we analyze the LP solution of the optimal CAC for the leasing based DSA and demonstrate that the proposed CAC policy judiciously uses the access opportunities of the SUs considering the service interruption.