速率比例公平下多用户OFDM系统的自适应资源分配

在多用户正交频分复用(MU-OFDM)系统中,考虑各个用户之间具有比例数据传输速率限制条件下的一种公平的自适应资源分配方案的最优算法计算量巨大,为此,提出了一种将子信道分配和功率分配相分离的次优算法.首先,在假设相同功率分配的情况下进行子信道的分配,然后在保持一定比例公平条件下使总容量最大时进行最优功率分配.对该算法的仿真表明,在用户数为2、子信道数为10的系统中,所提算法的容量性能接近最优算法,而计算量由指数增长变为线性增长.所提资源分配算法的总容量比以前的算法在用户间的分配更公平也更灵活.     

Adaptive proportional fairness resource allocation for OFDM-based cognitive radio networks

In this paper, we study the resource allocation problem in multiuser Orthogonal Frequency Division Multiplexing (OFDM)-based cognitive radio networks. The interference introduced to Primary Users (PUs) is fully considered, as well as a set of proportional rate constraints to ensure fairness among Secondary Users (SUs). Since it is extremely computationally complex to obtain the optimal solution because of integer constraints, we adopt a two-step method to address the formulated problem. Firstly, a heuristic subchannel assignment is developed based on the normalized capacity of each OFDM subchannel by jointly considering channel gain and the interference to PUs, which approaches a rough proportional fairness and removes the intractable integer constraints. Secondly, for a given subchannel assignment, we derive a fast optimal power distribution algorithm that has a complexity of O(L ² N) by exploiting the problem’s structure, which is much lower than standard convex optimization techniques that generally have a complexity of O((N + K)³), where N, L and K are the number of subchannels, PUs and SUs, respectively. We also develop a simple power distribution algorithm with complexity of only O(L + N), while achieving above 90 % sum capacity of the upper bound. Experiments show that our proposed algorithms work quite well in practical wireless scenarios. A significant capacity gain is obtained and the proportional fairness is satisfied perfectly.     

Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints

Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for achieving high downlink capacities in future cellular and wireless local area network (LAN) systems. The sum capacity of MU-OFDM is maximized when each subchannel is assigned to the user with the best channel-to-noise ratio for that subchannel, with power subsequently distributed by water-filling. However, fairness among the users cannot generally be achieved with such a scheme. In this paper, a set of proportional fairness constraints is imposed to assure that each user can achieve a required data rate, as in a system with quality of service guarantees. Since the optimal solution to the constrained fairness problem is extremely computationally complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. In the proposed algorithm, subchannel allocation is first performed by assuming an equal power distribution. An optimal power allocation algorithm then maximizes the sum capacity while maintaining proportional fairness. The proposed algorithm is shown to achieve about 95% of the optimal capacity in a two-user system, while reducing the complexity from exponential to linear in the number of subchannels. It is also shown that with the proposed resource allocation algorithm, the sum capacity is distributed more fairly and flexibly among users than the sum capacity maximization method.     

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.     

Proportional-fairness resource allocation for uplink OFDM-based cognitive radio systems

This paper has proposed a proportional-fairness resource allocation algorithm, including both subcarrier assignment algorithm and power allocation algorithm, for uplink orthogonal frequency division multiplexing (OFDM)-based cognitive radio (CR) systems. First, to get a better performance in the proposed system model, the influence factor (a,b,c) was introduced to realize the assignment of the subcarriers. Second, the transmit power of the secondary users (SUs) was allocated to the corresponding subcarriers in order to maximize the uplink capacity of the SUs subject to both power and interference constraints. With the appropriate influence factor in the subcarrier assignment, the loss of transmitted data rate arising from the fairness was minimized. Simulation results showed that the proposed algorithm can achieve a perfect fairness among the SUs while maximizing the system capacity simultaneously, and is of a low computation complexity.     

Proportional-fair energy-efficient radio resource allocation for OFDMA smallcell networks

This paper investigates the energy-efficient radio resource allocation problem of the uplink smallcell networks. Different from the existing literatures which focus on improving the energy efficiency (EE) or providing fairness measured by data rates, this paper aims to provide fairness guarantee in terms of EE and achieve EE-based proportional fairness among all users in smallcell networks. Specifically, EE-based global proportional fairness utility optimization problem is formulated, taking into account each user’s quality of service, and the cross-tier interference limitation to ensure the macrocell transmission. Instead of dealing with the problem in forms of sum of logarithms directly, the problem is transformed into a form of sum of ratios firstly. Then, a two-step scheme which solves the subchannel and power allocation separately is adopted, and the corresponding subchannel allocation algorithm and power allocation algorithm are devised, respectively. The subchannel allocation algorithm is heuristic, but can achieve close-to-optimal performance with much lower complexity. The power allocation scheme is optimal, and is derived based on a novel method which can solve the sum of ratios problems efficiently. Numerical results verify the effectiveness of the proposed algorithms, especially the capability of EE fairness provisioning. Specifically, it is suggested that the proposed algorithms can improve the fairness level among smallcell users by 150–400 % compared to the existing algorithms.     

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.     

考虑用户优先级的OFDMA下行链路自适应子载波分配

针对OFDMA下行链路系统,在总功率以及用户数据速率成比例的约束下,以获取整个系统容量极大化为准则,提出一种考虑用户优先级的自适应子载波分配算法.该算法初始分配时允许每个用户根据用户数据速率的相对比例以及自己的信道状态在所有子载波上独立的进行最优选择,当出现多个用户同时选择一个子载波,即出现冲突时,由平均信道增益的大小来决定用户选择该子载波的优先级.文中分别研究了平均信道增益大者为高优先级以及平均信道增益小者为高优先级的两种冲突解决办法,仿真结果表明,由平均信道增益小的用户来优先选择冲突子载波的算法综合考虑了公平性和频谱效率,与系统容量上限相比,性能损失较小,复杂度低,速度快,能够满足实时要求.     

Resource allocation in orthogonal frequency division multiple access‐based cognitive radio systems with minimum rate constraints

In this paper, resource allocation problem in orthogonal frequency division multiple access‐based cognitive radio (CR) systems to maintain minimum transmission rate constraints of CR users (CRUs) with the specified interference thresholds is investigated. Firstly, a single primary user (PU) CR system is considered, and a suboptimal resource allocation algorithm to maximize the sum transmission rate of all CRUs is proposed. Secondly, the single‐PU scenario is extended to multiple‐PU case, and an asymptotically optimal resource allocation algorithm is proposed using dual methods subject to constraints on both interference thresholds of PUs and total transmit power of all CRUs. Analysis and numerical results show that, in contrast to classical resource allocation algorithms, the proposed algorithm can achieve higher transmission rate and guarantee each CRU's minimum transmission rate in both scenarios. Copyright © 2012 John Wiley & Sons, Ltd.     

一种基于干扰温度限制的信道与功率联合分配新算法

随着无线通信业务的不断增长,频谱资源越来越紧缺,然而另一方面大量授权的无线频谱却被闲置或者利用率极低,于是认知无线电技术应运而生,已成为无线通信领域的研究热点。认知无线电的基本思想是次用户（认知用户）利用主用户（授权用户）未占用的空闲频谱进行通信,其可用无线资源是根据授权用户的频谱使用情况而动态变化的。因此,能否实现对系统可用无线资源的合理有效管理,对整个认知无线电系统性能的优劣起着决定性作用。本文提出了一种在干扰温度限制下基于公平的功率与信道联合分配算法,该算法在主用户干扰温度及次用户发射功率的双重限制下,以最大化系统容量为基本目标,实现信道与功率的联合分配,并且引入贫困线来保证各个用户信道分配的公平性。论文建立了该问题的非线性规划数学模型,给出了模型的求解方法,并进一步设计了具体分配算法及其步骤。论文对干扰门限分别为-90dBm、-95dBm、-100dBm、-105dBm、-110dBm时的系统归一化容量累积分布函数进行了仿真比较,发现当干扰门限越低时,本文算法的优势越明显。这是因为在干扰门限较低时,干扰温度限制是功率分配的主要制约因素,而本文的算法正是基于干扰门限进行分配的。因此基于干扰温度限制的公平的功率与信道联合分配算法具有良好的性能,在保证了系统的公平性效益的同时,提高了系统的归一化容量。      

Resource allocation based on dynamic hybrid overlay/underlay for heterogeneous services of cognitive radio networks

In cognitive radio networks (CRNs), hybrid overlay and underlay sharing transmission mode is an effective technique to improve the efficiency of radio spectrum. Unlike existing works in literatures where only one secondary user (SU) uses both overlay and underlay mode, the different transmission modes should dynamically be allocated to different SUs according to their different quality of services (QoS) to achieve the maximal efficiency of radio spectrum. However, dynamic sharing mode allocation for heterogeneous services is still a great challenge in CNRs. In this paper, we propose a new resource allocation method based on dynamic allocation hybrid sharing transmission mode of overlay and underlay (Dy-HySOU) to obtain extra spectrum resource for SUs without interfering with the primary users. We formulate the Dy-HySOU resource allocation problem as a mixed-integer programming to optimize the total system throughput with simultaneous heterogeneous QoS guarantee. To decrease the algorithm complexity, we divide the problem into two sub-problems: subchannel allocation and power allocation. Cutset is used to achieve the optimal subchannel allocation, and the optimal power allocation is obtained by Lagrangian dual function decomposition and subgradient algorithm. Simulation results show that the proposed algorithm further improves spectrum utilization with simultaneous fairness guarantee, and the achieved Dy-HySOU diversity gain is satisfying.     

Resource allocation with proportional rate fairness in orthogonal frequency division multiple access relay networks

We address the problem of subchannel and transmission power allocation in orthogonal frequency division multiple access relay networks with an aim to maximize the sum rate and maintain proportional rate fairness among users. Because the formulated problem is a mixed‐integer nonlinear optimization problem with an extremely high computational complexity, we propose a low‐complexity suboptimal algorithm, which is a two‐step separated subchannel and power allocation algorithm. In the first step, subchannels are allocated to each user, whereas in the second step, the optimal power allocation is carried out on the basis of the given subchannel allocation and the nonlinear interval Gauss–Seidel method. Simulation results have demonstrated that the proposed algorithm can achieve a good trade‐off between the efficiency and the fairness compared with two other existing relevant algorithms. In particular, the proposed algorithm can always achieve 100% fairness under various conditions. Copyright © 2012 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.     

Joint subchannel and power allocation in multiuser OFDM systems with minimal rate constraints

In this paper, we study the adaptive resource allocation in multiuser orthogonal frequency division multiplexing (OFDM) systems. We try to maximize the sum capacity of an OFDM system with given transmission power budget, while meeting users' minimal rate requirements. Unlike other resource allocation schemes, which generally separate subchannel allocation and power distribution into independent procedures, our proposed algorithm implements joint subchannel and power allocation. Given a set of subchannels, the required power to satisfy a user's minimal rate constraint is calculated by water‐filling policy. Then, the user who requires the maximum power to meet the rate requirement has a priority to obtain an additional subchannel. The procedure continues until all subchannels are consumed, by which time the consumed power to meet all users' rate requirements is also worked out. Finally, the margin power is allocated among all subchannels in an optimal manner to maximize the sum capacity of the OFDM system. Simulation results show that our proposed algorithm performs better than other existing ones. The solution produced by our proposed algorithm is close to the upper bound, while its complexity is relatively lower compared with other methods, which makes it attractive for applications. Copyright © 2012 John Wiley & Sons, Ltd.     

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.     

Resource allocation for non-real-time services in OFDM-based cognitive radio systems

We study the resource allocation (RA) problem in a multiuser OFDM-based cognitive radio (CR) system for non-realtime (NRT) applications in which average user data rates are to be maintained proportionally. In contrast to existing algorithms designed for multiuser OFDM systems, which are unable to guarantee users proportional rates when applied in a CR system, the proposed optimal RA algorithm ensures that CR user rates are maintained in proportion to predefined target rates while at the same time providing an improved system throughput.     

基于应用时间窗多用户MIMO-OFDM系统中的比例公平算法

该文针对基于延时信道状态信息的多用户MIMO-OFDM系统,在用户比例速率要求和功率限制的情况下,以最大化时间窗内系统吞吐量为目标,提出了一种基于应用时间窗比例公平算法。该算法首先设计各子载波上满足用户误比特率要求的星座距离,然后把系统中每个用户按照其比例映射为相应数目的虚拟用户,最后根据影子价格把子载波最优地分配给虚拟用户。仿真结果表明,该算法在保证用户公平性的基础上,有效地提高了系统吞吐量。     

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.     

On proportional fairness of uplink spectral efficiency in cell‐free massive MIMO systems

This paper is concerned with the proportional fairness (PF) of the spectral efficiency (SE) maximization of uplinks in a cell‐free (CF) massive multiple‐input multiple‐output (MIMO) system in which a large number of single‐antenna access points (APs) connected to a central processing unit (CPU) serve many single‐antenna users. To detect the user signals, the APs use matched filters based on the local channel state information while the CPU deploys receiver filters based on knowledge of channel statistics. We devise the maximization problem of the SE PF, which maximizes the sum of the logarithm of the achievable user rates, as a jointly nonconvex optimization problem of receiver filter coefficients and user power allocation subject to user power constraints. To handle the challenges associated with the nonconvexity of the formulated design problem, we develop an iterative algorithm by alternatively finding optimal filter coefficients at the CPU and transmit powers at the users. While the filter coefficient design is formulated as a generalized eigenvalue problem, the power allocation problem is addressed by a gradient projection (GP) approach. Simulation results show that the SE PF maximization not only offers approximately the achievable sum rates as compared to the sum‐rate maximization but also provides an improved trade‐off between the user rate fairness and the achievable sum rate.