Opportunistic power allocation strategies and fair subcarrier allocation in OFDM-based cognitive radio networks

In this paper we have studied the subcarrier and optimal power allocation strategy for OFDM-based cognitive radio (CR) networks. Firstly, in order to protect the primary user communication from the interference of the cognitive user transmissions in fading wireless channels, we design an opportunistic power control scheme to maximize the cognitive user capacity without degrading primary user’s QoS. The mathematical optimization problem is formulated as maximizing the capacity of the secondary users under the interference constraint at the primary receiver and the Lagrange method is applied to obtain the optimal solution. Secondly, in order to limit the outage probability within primary user’s tolerable range we analyze the outage probability of the primary user with respect to the interference power of the secondary user for imperfect CSI. Finally, in order to get the better tradeoff between fairness and system capacity in cognitive radio networks, we proposed an optimal algorithm of jointing subcarrier and power allocation scheme among multiple secondary users in OFDM-based cognitive radio networks. Simulation results demonstrate that our scheme can improve the capacity performance and efficiently guarantee the fairness of secondary users.     

Optimal power allocation for cognitive radio under interference outage constraint

Cognitive radio is able to share the spectrum with primary licensed user, which greatly improves the spectrum efficiency. We study the optimal power allocation for cognitive radio to maximize its ergodic capacity under interference outage constraint. An optimal power allocation scheme for the secondary user with complete channel state information is proposed and its approximation is presented in closed form in Rayleigh fading channels. When the complete channel state information is not available, a more practical transmitter-side joint access ratio and transmit power constraint is proposed. The new constraint guarantees the same impact on interference outage probability at primary user receiver. Both the optimal power allocation and transmit rate under the new constraint are presented in closed form. Simulation results evaluate the performance of proposed power allocation schemes and verify our analysis.     

Improving Water-Filling Algorithm to Power Control Cognitive Radio System Based Upon Traffic Parameters and QoS

Cognitive radio scenario is based upon the ability to determine the radio transmission parameters from its surrounding environment. Power allocation in cognitive radio systems improves secondary network capacity subject to primary receiver interference level threshold. In this paper, statistical property of the injected interference power in primary user channel is used to establish the container bottom for each subcarrier employing water filling algorithm. In other words, the container bottom level of each subcarrier depends on the injected interference in primary user (PU) (most probably from the overloaded neighbor subcarriers). Traffic statistical parameters are also employed to formulate power allocation problem. Within this context, quality of service constraint is considered also to improve performance of power allocation algorithm. Simulation Results show that the injected interference in PU is decreased while the secondary user capacity improves. Indeed, the proposed algorithm is more compatible than a waterfilling algorithm with cognitive radio system constraints.     

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.     

Ergodic capacity and outage probability optimization for secondary user in cognitive radio networks under interference outage constraint

This paper considers a cognitive radio network where a secondary user (SU) coexists with a primary user (PU). The interference outage constraint is applied to protect the primary transmission. The power allocation problem to jointly maximize the ergodic capacity and minimize the outage probability of the SU, subject to the average transmit power constraint and the interference outage constraint, is studied. Suppose that the perfect knowledge of the instantaneous channel state information (CSI) of the interference link between the SU transmitter and the PU receiver is available at the SU, the optimal power allocation strategy is then proposed. Additionally, to manage more practical situations, we further assume only the interference link channel distribution is known and derive the corresponding optimal power allocation strategy. Extensive simulation results are given to verify the effectiveness of the proposed strategies. It is shown that the proposed strategies achieve high ergodic capacity and low outage probability simultaneously, whereas optimizing the ergodic capacity (or outage probability) only leads to much higher outage probability (or lower ergodic capacity). It is also shown that the SU performance is not degraded due to partial knowledge of the interference link CSI if tight transmit power constraint is applied.     

多用户OFDM系统中一种新颖的自适应功率分配方案

针对多用户正交频分复用(OFDM)系统自适应资源分配的问题,提出了一种新的自适应子载波分配方案。子载波分配中首先通过松弛用户速率比例约束条件确定每个用户的子载波数量,然后对总功率在所有子载波间均等分配的前提下,按照最小比例速率用户优先选择子载波的方式实现子载波的分配;在功率分配中提出了一种基于人工蜂群算法和模拟退火算法(ABC-SA)相结合的新功率分配方案,并且通过ABC-SA算法的全局搜索实现了在所有用户之间的功率寻优,同时利用等功率的分配方式在每个用户下进行子载波间的功率分配,最终实现系统容量的最大化。仿真结果表明,与其他方案相比,所提方案在兼顾用户公平性的同时还能有效地提高系统的吞吐量,进而证明了所提方案的有效性。     

基于中断概率的协作通信中继选择与功率分配算法

研究了功率受限情况下多中继协作通信网络的中继选择和功率优化问题。在AF网络中,提出了一种低复杂度中继选择与功率分配算法,其目标是在总功率一定的条件下使系统的中断概率最小。本算法对源节点和所有潜在中继节点进行功率分配,结合当前信噪比选择最优的中继集合,通过最速下降法求出使系统中断概率最低的功率分配因子。该算法不需要知道大量瞬时信道信息、不需要系统在等功率条件下进行中继选择,只需求得中继节点排列矩阵便可根据当前信噪比自适应获得最优中继节点集合。仿真结果表明,在相同条件下,该算法明显优于不同中继节点集合下几种算法的中断性能,并且与传统的SAF及AAF算法相比,有效降低了中断概率,提升了系统性能和功率效率。     

Proportional Fair Resource Allocation Based on Chance-Constrained Programming for Cognitive OFDM Network

Proportional fair resource allocation plays a critical role to balance the spectrum efficiency and fairness for cognitive orthogonal frequency division multiplexing (OFDM) network. However, due to the lack of cooperation between cognitive radio (CR) network and primary network, channel state information between CR base station (CRBS) and primary user (PU) could not be estimated precisely. Therefore, the interference of CRBS–PU couldn’t be computed precisely and chance-constrained programming is adopted to formulate the resource allocation problem. In this work, we study the proportional fair resource allocation problem based on chance-constrained programming for cognitive OFDM network. The objective function maximizes the spectral efficiency of cognitive OFDM network over subcarrier and power allocation. The constraint conditions include the interference constraint of PU with the target probability requirement and the proportional fair rate requirement of CR users. In order to solve the above optimization problem, two steps are taken to develop hybrid immune optimization algorithm (HIOA). In the first step, the probabilistic interference constraint condition is transformed as an uncertain function which is computed by a generalized regression neural network (GRNN). In the second step, we combine immune optimization algorithm and GRNN to develop HIOA. Simulation results demonstrate that HIOA yields higher spectral efficiency while the probabilistic interference constraint condition and the proportional fair rate constraint condition could be satisfied very well.     

Cognitive Engine with Dynamic Priority Resource Allocation for Wireless Networks

A cognitive engine with dynamic priority resource allocation (CE-DPRA) is proposed for wireless networks by utilizing a maximum likelihood estimation method. The receiving signal strength (RSS) from an unlicensed cognitive radio (CR) user can be measured through estimating the unknown position of a licensed mobile user. The priority algorithm for access control enables the selection of a proper CR user waiting for transmission. Both data rate and spectral efficiency can be increased after adapting CE-DPRA. Also the power constraint method can avoid excessive interference caused by signal transmitting from CR users so as to improve the communication quality of mobile users. Simulation results show that the proposed CE-DPRA achieves the performance of high transmission data rate, less interference power, and low average outage probability.     

OFDMA上行链路中基于博弈论的子载波和功率分配算法

传统OFDMA上行链路资源分配算法中一般以最大化各用户速率或最小化发射功率为依据对子载波和功率进行分配,而对于各用户的功率效率问题并没有加以考虑。针对这一问题,该文提出了一种基于功率效率最优的联合子载波功率分配算法。首先给出了在各用户峰值功率约束条件下达到收益函数最优的必要条件并证明了算法纳什均衡的存在及唯一性,然后给出了子载波功率分配算法。仿真表明:相比最大边界速率子载波和功率分配算法(MaxRt+WF)和固定子载波和功率分配算法(MaxFA+WF),该文算法能大幅度提高各用户的功率效率。同时如果合理地选择代价参数,算法获得的和功率效率能够达到更大。     

Analysis of Network Path Selection Based on Outage Probability in Cognitive Relay Networks

This paper evaluates the outage performance of cognitive relay networks with mutual interference between secondary users and primary users under the underlay approach, while adhering to the interference constraint on the primary user. A network path selection criterion, suitable for cognitive relay networks, is provided, from which we derive the outage probability expression of cognitive relay networks. It is shown that the outage probability considering the interference to secondary user from primary user is higher than that without considering the interference to secondary user from primary user. In addition, the outage probability is affected by key network parameters. We analyze network path selection method based on outage probability and prove that the interference to secondary user from primary user has a significant effect on the network path selection and can not be ignored in practical wireless communication environments. Simulation investigation is also provided and used to verify the theoretical analysis.     

Energy-efficient cooperative sensing and transmission in relay-assisted cognitive radio network

An innovative EE-oriented cooperative sensing and transmission scheme in relay-assisted cognitive radio networks,called energy-efficient best-relay cooperative transmission (BCT) was proposed.Based on the BCT scheme,mean energy efficiency (MEE) maximization problem with sensing duration and transmitting power as optimization variables was modeled for fading channels under constraint of minimal secondary outage probability.By virtue of Jensen’s inequality,the original optimization problem was decomposed into two relatively independent subproblems which solved sensing duration and power allocation respectively.And for the two subproblems,an efficient cross iteration based algorithm was proposed to obtain the suboptimal solutions.Both analytical and simulation results demonstrate that the proposals can achieve significantly higher EE while enhancing reliability of secondary transmission remarkably compared to non-cooperation single cognitive transmission schemesin high QoS requirement.     

Joint energy efficiency and spectral efficiency optimization algorithm for UDN under the restriction of interference threshold and backhaul capacity

Aiming at the scenarios which consider the constraint of backhaul capacity restriction and interference threshold in ultra-dense networks (UDN),an integer linear programming (ILP) and Lagrangian dual decomposition (LDD) based joint optimization algorithm of energy efficiency and spectrum efficiency was proposed.In the proposed algorithms,the user association problem with the constraint of limited backhaul capacity was modelled as an ILP problem and then finished the connection between the user and the base station of microcell by solving this problem with dynamic programming method.Therefor,Lagrangian dual decomposition (LDD) was applied in an iteration algorithm for spectrum resource allocation and power allocation.The simulation results show that compared with traditional schemes,the proposed algorithm can significantly improve the energy efficiency and spectrum efficiency of system and use the microcell’s load capacity more efficiently.     

Joint overlay and underlay resource allocation with weighted fairness in OFDM‐based cognitive radio systems

In this paper, the problem of hybrid overlay and underlay spectrum access is investigated for OFDM‐based cognitive radio (CR) systems. Both the metrics for system (e.g. capacity) and users (e.g. fairness) are integrated into the unified framework of weighted‐capacity maximization with the interference constraint in CR systems. For easing the procedure of resource allocation, two criteria, respectively, for subcarrier assignment and power allocation are theoretically derived based on the Karush–Kuhn–Tucker conditions. Under the guidance of the two criteria, max‐capacity subcarrier assignment and optimal power allocation are proposed to flexibly distribute spectrum resources to secondary users. In order to reduce the computational complexity further, a suboptimal power allocation algorithm, referred to as cap‐limited waterfilling, is also presented by decomposing the interference constraint. Simulation results show that the capacity and fairness performance of the proposed algorithms is considerably better than the conventional ones in references. The proposed suboptimal algorithm with substantially lower complexity approaches to optimal power allocation in the vicinity of only 1% performance gap. Meanwhile, joint access model is greatly beneficial to spectrum efficiency enhancement in CR systems. Copyright © 2014 John Wiley & Sons, Ltd.     

Energy‐Efficiency Power Allocation for Cognitive Radio MIMO‐OFDM Systems

This paper studies energy‐efficiency (EE) power allocation for cognitive radio MIMO‐OFDM systems. Our aim is to minimize energy efficiency, measured by “Joule per bit” metric, while maintaining the minimal rate requirement of a secondary user under a total power constraint and mutual interference power constraints. However, since the formulated EE problem in this paper is non‐convex, it is difficult to solve directly in general. To make it solvable, firstly we transform the original problem into an equivalent convex optimization problem via fractional programming. Then, the equivalent convex optimization problem is solved by a sequential quadratic programming algorithm. Finally, a new iterative energy‐ efficiency power allocation algorithm is presented. Numerical results show that the proposed method can obtain better EE performance than the maximizing capacity algorithm.     

Multiuser OFDM with adaptive subcarrier, bit, and power allocation

Multiuser orthogonal frequency division multiplexing (OFDM) with adaptive multiuser subcarrier allocation and adaptive modulation is considered. Assuming knowledge of the instantaneous channel gains for all users, we propose a multiuser OFDM subcarrier, bit, and power allocation algorithm to minimize the total transmit power. This is done by assigning each user a set of subcarriers and by determining the number of bits and the transmit power level for each subcarrier. We obtain the performance of our proposed algorithm in a multiuser frequency selective fading environment for various time delay spread values and various numbers of users. The results show that our proposed algorithm outperforms multiuser OFDM systems with static time-division multiple access (TDMA) or frequency-division multiple access (FDMA) techniques which employ fixed and predetermined time-slot or subcarrier allocation schemes. We have also quantified the improvement in terms of the overall required transmit power, the bit-error rate (BER), or the area of coverage for a given outage probability     

Adaptive subcarrier bandwidth and power in OFDM‐based cognitive radio systems for high mobility applications

OFDM‐based cognitive radio systems are spectrally flexible and efficient, but they are vulnerable to intercarrier interference (ICI), especially in high mobility environments. High mobility of the terminal causes large Doppler frequency spread resulting in serious ICI. Such ICI severely degrades the system performance, which is ignored in the existing resource allocation of OFDM‐based cognitive radio systems. In this paper, an adaptive subcarrier bandwidth along with power allocation problem in OFDM‐based cognitive radio systems for high mobility applications is investigated. This adaptive subcarrier bandwidth method should choose the suitable subcarrier bandwidth not only to balance the tradeoff between ICI and intersymbol interference but also to be large enough to tolerate an amount of Doppler frequency spread but less than the coherence bandwidth. The power budget and interference to primary users caused by cognitive radio users are imposed for primary users' protection. With these constraints, a joint optimization algorithm of subcarrier bandwidth and power allocation is proposed to maximize the bandwidth efficiency of OFDM‐based cognitive radio systems in such conditions. Numerical simulation results show that the proposed algorithm could maximize the system bandwidth efficiency and balance this tradeoff while satisfying the constraints. Copyright © 2012 John Wiley & Sons, Ltd.     

Auction-Based Throughput Maximization in Cognitive Radio Networks Under Interference Constraint

Cognitive radio is an emerging technique to improve the utilization of radio frequency spectrum in wireless communication networks. That is, spectrum efficiency can be increased significantly by giving opportunistic access of the frequency bands to a group of cognitive users to whom the band has not been licensed. In this paper, as a cross layer application (MAC and physical layers) of graph theory, we consider the problem of throughput maximization of spectrum allocation in cognitive radio networks under interference constraint. We propose a novel auction-based channel allocation mechanism which tries to maximize both total and primary users’ utilities while satisfying signal to interference ratio constraint on primary receivers so that transmitted packets will be successfully received, without controlling secondary user powers. For comparison we discuss a greedy algorithm as well, however, one that does not handle interference issue. In order to compare results of proposed and greedy algorithms, we propose net throughput by taking into account outage probability of primary receiver. Simulation results show that exposing higher SINR (outage) threshold not only decreases total gain and primary users’ utilities but also worsens channel distribution performance. On the other hand adding auction mechanism significantly increases total gain throughput and primary user’ s utility. Particularly, up to SINR threshold values of 20 dBs, auction provides outstanding performance and proposed algorithm has total throughput results close to those of the greedy one even though no interference constraint is applied in the greedy algorithm. Another noticeable point of simulation results is crossover of net throughputs of proposed and greedy algorithms at a SINR threshold level after which results of ABSA-UNIC and NASA-UNIC are much better. This clearly shows superiority of proposed mechanism.     

认知无线电网络中基于功率有效性的最优功率分配

在资源受限的认知无线电网络中,如何提高次用户网络的功率利用率是一个值得考虑的问题。针对这个问题,本文首先提出了认知无线电网络中基于功率有效性的次用户最优功率分配算法,该算法不仅考虑主用户网络中断概率对次用户发射功率的限制,而且兼顾次用户网络本身的中断概率要求。其次,为了进一步降低节点的计算复杂度,本文通过降维处理将目标最优化问题转化为两个子问题进行求解,从而提出一种次优的低复杂度功率分配算法。仿真结果表明,次优算法相比最优算法仅带来有限的性能损失,但是却有效地节省了计算时间和存储空间;此外,当中继节点靠近源节点时更有利于系统功率效率的提高,源节点到目的节点链路相比中继链路对系统的性能影响更大。      

基于传输中断概率的认知无线电系统性能分析

如何设计最优的频谱感知与传输框架是认知无线电技术的重要环节。考虑频谱接入过程中数据传输中断对认知网络性能影响的问题,提出了一种新的基于传输中断概率的频谱感知与传输模型,联合优化频谱感知和数据传输两个阶段,将问题建模为对主用户的干扰量约束条件下的非凸优问题,以最大化认知网络吞吐量为目标联合优化感知时间、传输速率,并通过数值计算方法对其进行求解与仿真。数值分析表明,引入传输中断概率后,在满足上述约束条件的同时,在保护主用户和认知网络吞吐量、传输时延之间有了更好的权衡。