Joint subcarrier and power allocation with fairness in uplink OFDMA systems based on ant colony optimization

One of the key problems in uplink orthogonal frequency division multiple access systems is to efficiently and fairly allocate subcarriers and powers. However, most existing work has not sufficiently taken into account fairness when allocating these resources so that subcarriers cannot be fairly allocated among users with different channel conditions. To overcome this shortcoming, we first present an optimization framework with fairness, which aims to fairly allocate subcarriers among different users and to distribute the transmission power of each user over the assigned subcarriers. Here, the fairness is guaranteed by associating each user with a utility function and placing a lower limit on the number of subcarriers assigned. In particular, different from previous work, utility functions are allowed to be nonconcave and nondifferentiable so that our framework can be suitable for resource allocation for real‐time applications. Furthermore, an iterative algorithm based on the ant colony optimization is proposed, according to which subcarriers can be efficiently and fairly allocated among different users. Simulation results verify the convergence of our algorithm. In addition, our algorithm outperforms several other algorithms in terms of the fairness of resource allocation. Copyright © 2012 John Wiley & Sons, Ltd.     

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.     

Dynamic subcarrier and power allocation based on cooperative game theory in symmetric cooperative OFDMA networks

In order to improve the efficiency and fairness of radio resource utilization,a scheme of dynamic cooperative subcarrier and power allocation based on Nash bargaining solution(NBS-DCSPA) is proposed in the uplink of a three-node symmetric cooperative orthogonal frequency division multiple access(OFDMA) system.In the proposed NBS-DCSPA scheme,resource allocation problem is formulated as a two-person subcarrier and power allocation bargaining game(SPABG) to maximize the system utility,under the constraints of each user’s maximal power and minimal rate,while considering the fairness between the two users.Firstly,the equivalent direct channel gain of the relay link is introduced to decide the transmission mode of each subcarrier.Then,all subcarriers can be dynamically allocated to the two users in terms of their selected transmission mode.After that,the adaptive power allocation scheme combined with dynamic subcarrier allocation is optimized according to NBS.Finally,computer simulation is conducted to show the efficiency and fairness performance of the proposed NBS-DCSPA scheme.     

Optimal power and subcarrier allocation with partial side information for downlink OFDMA system

In this paper,we investigate the power and subcarrier allocation issue in the case of partial side information for downlink orthogonal frequency division multiple access(OFDMA)system.Relaxation method is utilized to characterize the necessary conditions of the optimal solution and the uniqueness of the optimal solution is proved.The game theoretical concept,surplus function is also introduced to analyze the optimal solution.Based on the theoretical analysis,we propose iterative surplus balancing algorithm(ISBA)that can jointly assign the power and subcarriers in multiple rounds,and then the optimality of ISBA is proved.Simulation results are presented to show the characteristics of the theoretical analysis and ISBA.     

基于M2M终端组的比例公平资源分配研究

基于M2M终端组的资源分配策略可以有效提高M2M通信中的资源利用率.本文研究了M2M通信系统中基于组的保证不同组间传输速率的比例公平资源分配问题,提出了一种次优的能够保证不同终端组间传输速率比例公平的资源分配算法,并通过仿真对算法的性能进行了验证,给出了速率最大化算法与终端组比例公平算法的性能比较.     

考虑整数比特率及公平性的认知无线电OFDMA功率分配算法

在基于正交频分多址(OFDMA)的认知无线电系统中,每个认知用户在实际中都是以整数比特进行传输,而以往的速率取整算法只考虑了单认知用户。针对这种情况,提出了一种新的速率取整算法,该算法在原有算法的基础上进行了改进,让每个子载波最多参与一次速率的调整,从而使其在应用于多认知用户时保证了速率取整时的公平性,同时总的传输比特率比原算法有了一定的提高。仿真结果表明,所提算法有效提高了各认知用户在速率取整时的公平性。     

Adaptive subcarrier and bit allocation in OFDMA systems supporting heterogeneous services

Orthogonal Frequency Division Multiple Access (OFDMA) is an efficient multiple access method for the future wireless systems. This paper studies the adaptive subcarrier and bit allocation problem in OFDMA systems to support heterogeneous services. The goal of the considered resource optimization technique is to maximize the total system throughput under the overall transmit power constraint while guaranteeing the QoS requirement of realtime users and supporting proportional fairness among non-realtime users. First, we introduce a Rate Adaptive (RA) resource allocation algorithm for non-realtime users and a Margin Adaptive (MA) algorithm for realtime users. Then, based on the previous algorithms, a novel algorithm is proposed to allocate the resource to both classes of users, which makes an efficient tradeoff between the resource usage of realtime users and non-realtime users. The algorithm is locally optimal solution provided that the MA and RA algorithms are utilized. Also, to reduce the computational complexity, a suboptimal method based on the balancing of the average power per subcarrier is also introduced. Monte Carlo simulation results show that all the proposed algorithms outperform the existing counterparts. The results also show that the suboptimal method for heterogeneous services can efficiently reduce the computational complexity at the cost of very little performance degradation. This work was supported by the National Natural Science Foundation of China (Nos. 60472079, 60572115), and by the Natural Science Foundation of Zhejiang Province (No. Z104252), China.     

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.     

Discrete polynary coding immune clonal selection‐based joint subcarrier and power allocation in uplink cognitive OFDM network

Cognitive radio has been considered to be one of the main technologies to solve the problem of low spectrum utilization, while the adaptive allocation of network resource is one of the key technologies. A discrete polynary coding immune clonal selection (DPICS)‐based joint subcarrier and power allocation algorithm is proposed to solve the resource allocation problem in uplink cognitive OFDM networks. The novelties of DPICS include the following: A unique coding method is adopted to deal with multi‐value discrete variables. Compared with the traditional methods, the proposed method can acquire the shortest code. Meanwhile, the constraints of the subcarrier allocation are avoided. A heuristic mutation scheme is used to direct the mutation. Subcarriers are reallocated randomly to the secondary users with larger homotactic noise, which has a large probability to produce the optimal solution and improves the searching process. Subcarriers and power are allocated simultaneously, which is different with the traditional biphasic resource allocation algorithms. The biphasic resource allocation algorithms cannot acquire the subcarrier allocation result and power allocation result simultaneously, which makes the final result imprecise. The proposed algorithm avoids this situation and improves the accuracy of the final result. Compared with state‐of‐the‐art algorithms, the proposed algorithm is shown as effective by simulation results. Copyright © 2014 John Wiley & Sons, Ltd.     

雷达通信一体化子载波和功率联合分配方法

雷达通信一体化系统是缓解无线电频谱拥塞和频谱资源短缺的高效解决方案。在雷达的最小信号噪声比和最小通信传输速率的约束条件下,通过构建混合整数非线性优化模型,提出了子载波和功率联合分配方法,实现系统总发射功率的最小化。首先将优化模型转化为线性模型并添加罚因子,然后选择用于雷达或通信目的的子载波。考虑到雷达性能和通信性能评价标准的差异,对用于雷达或通信目的子载波设置不同的发射功率约束,最终通过循环优化实现子载波和功率的联合分配。数值仿真结果表明,所提方法显著节约了功率资源。     

基于改进智能水滴算法的多用户OFDMA系统资源分配

在正交频分多址(OFDMA)系统中,合理的资源分配对于提升系统的性能具有重要的意义.针对多用户OFDMA系统,对最大化系统容量为目标的资源分配算法进行研究,提出了一种基于智能水滴算法的无向全连通图资源分配模型,以无向全连通图的顶点集和边集来描述用户与子载波之间的匹配关系.在此基础上,进一步对智能水滴算法进行改进.仿真结果表明,在满足用户比例公平性的条件下,与蚁群算法相比,基于改进智能水滴算法的全连通图分配方案能够提高2.17%~4.91%的系统速率,同时具有更快的收敛速度,提高了系统性能.     

一种新的OFDMA系统功率与比特分配算法

针对实际正交频分复用多址访问（OFDMA,Orthogonal Frequency Division Multiple Access）系统中整数比特的限制问题,以及用户间公平性要求较为松弛的情况,提出了一种新的整数比特条件下的功率与比特分配算法。该算法首先按公平比例进行功率和比特分配,然后对分配结果取整,并将剩余的功率与比特再进行分配。仿真结果表明：该算法保持用户间的比例公平性的基础上取得与贪婪算法接近的系统容量,公平性优于贪婪算法。     

Dynamic resource allocation in adaptive wireless OFDMA systems

Modern wireless orthogonal frequency division multiple access (OFDMA) systems incorporate dynamic resource allocation (DRA), adaptive modulation and coding (AMC), and power control (PC) to exploit multiuser diversity and achieve higher system throughput. In the literature, only a few proposed algorithms deal with the contiguous DRA problem according to which a contiguous collection of resources can be allocated to each user. This paper formulates this high complexity problem, provides a suitable decision metric and a simple yet efficient solution. The proposed algorithm allocates in each step a contiguous collection of resources to the pending user that leads to the highest estimated correctly received number of bits. Simulation results show that, in this way, considerably improved performance can be achieved in terms of overall system throughput, spectral efficiency, and served traffic. Copyright © 2010 John Wiley & Sons, Ltd.     

基于比例速率保证的信道误差OFDMA中继系统资源分配

针对存在有信道估计误差的正交频分多址( OFDMA)中继系统,在考虑用户传输中断概率的同时,提出了满足不同用户最小服务质量( QoS)需求和比例公平性约束条件下的中继选择、子载波分配和功率分配的联合优化问题,建立了以最大化系统总容量为目标的优化模型。在此基础上以速率最大化为目标进行最佳中继选择,并通过动态子载波分配来满足用户的最小QoS需求和比例公平性,最后采用拉格朗日乘子法来得到最优功率分配方案。仿真结果表明,此算法在降低用户中断概率的同时,提高了系统吞吐量并保证了用户速率的比例公平性。     

Discrete bit loading and power allocation for OFDMA downlink with minimum rate guarantee for users

Performance optimization of the communication networks with quality of service (QoS) considerations for all active users is of great practical importance in highly delay-sensitive applications like multipoint videoconferences and interactive video games. Using minimum data rate as the primary criterion for the QoS and the BER as a second one, in this paper, we provide the optimum discrete bit loading for an OFDMA downlink in which the QoS of all users are satisfied. We formulate the problem and solve the dual problem efficiently and without any suboptimality. Albeit the problem is non-convex, it has been shown that the duality gap tends zero in practical scenarios. We propose a novel approach to solve the dual problem by decomposing dual function and finding discrete rate allocation solution for practical applications. Also, we present a novel fast converging iterative algorithm to find the solution with much less complexity compared to that of well-known ellipsoid optimization algorithm. We analyze the complexity of these solutions, and using simulation results, show the superiority of our novel approach.     

Joint subcarrier and power allocation for uplink relay‐enhanced OFDM systems

There has been a lot of research works considering the resource allocation of the downlink multihop orthogonal frequency division multiplexing systems. However, due to the distributed nature of the uplink power constraints, the resource allocation in the uplink multihop systems, where multiple mobile stations transmit to one base station with the aid of one or many relay stations, has much difference and has not been well investigated so far. In this paper, we originally study the joint subcarrier and power allocation problem for the uplink dual‐hop transmission with the aim to maximize the system transmit rate. The resource allocation problem is approximated to be a concave maximization problem. By using mathematical decomposition techniques, the problem is first decoupled and solved by the proposed near‐optimal method, which has low‐computation complexity. Then, our algorithm is extended to the case with subcarrier matching on the dual hops. Numerical results show that our proposed algorithm improves the system transmission rate. Compared with the equal power allocation schemes, our algorithm can achieve significant gain in system transmit rate. Copyright © 2010 John Wiley & Sons, Ltd.     

Joint power,subcarrier and subframe allocation in Multihop relay networks

In this paper we study the problem of subframe, subchannel and power allocation in OFDMA‐based multihop relay networks. The system consists of a base station (BS), a number of relay stations (RS) and mobile stations (MS). We consider frame by frame scheduling, where the frame is divided into two subframes such as BS‐RS and RS‐MS subframes. We study two different problems, satisfying link rate requirements with minimum‐weighted total power and maximizing proportional fairness. For the first problem, we find the optimal solution and also propose a less complex subframe and bandwidth allocation scheme with good performance. For the second problem, we propose an algorithm that outperforms an existing scheme with less feedback. Copyright © 2009 John Wiley & Sons, Ltd.     

OFDMA协同通信系统子载波和功率联合分配算法

针对OFDMA协同通信系统资源分配仅考虑平均功率下的子载波分配,中继存在未用功率情况,研究子载波分配后中继剩余功率分配问题。提出一种既满足业务QoS需求又兼顾用户间公平性的子载波和功率联合分配算法,并设计一种基于二分法的功率注水分配方案。测试表明,该算法能在满足业务QoS需求及用户公平性的同时,提升系统容量。     

OFDM系统中动态子信道和功率的分配

在分析一种多用户OFDM系统中自适应子信道和比特功率分配算法的基础上,根据多径频率选择性衰落信道的瞬时特性,动态地为多用户分配子信道和传输比特数,并服从MA优化准则.并且进一步考虑了系统中有固定速率用户和可变速率用户同时存在的情况:在子信道分配时,先给固定速率的用户分配子信道,再给可变速率用户按照子信道链路增益最大化分配剩余的子信道;在信号发射功率分配上,按照"注水"法则分配,链路增益大的子信道分配的功率大,链路增益小的子信道分配的功率小,则系统的目标函数,总传输速率可以达到最大.仿真证明了此方案优于一般的方案.     

Radio resource allocation for interference management in mobile broadband OFDMA based networks

This paper focuses on the inter‐cell interference (ICI) management problem in the downlink channel for mobile broadband wireless OFDMA‐based systems. This subject is addressed from the standpoint of different interrelated resource allocation mechanisms operating in multi‐cell scenarios in order to exploit frequency and multi‐user diversity: ICI coordination/avoidance and adaptive subcarrier and power allocation. Even though these methods can be applied in a stand‐alone way, a significant performance improvement is achieved if they are jointly designed and operate in a combined basis. Several alternatives for mixed frequency and power ICI coordination schemes are proposed in this paper. Connected with a proper power mask‐based design, the potential gain of a flexible frequency sectorization solution, halfway between fractional/soft frequency reuse and pure frequency sectorization, is explored. The main objective is to outperform fractional/soft frequency reuse offering an attractive trade‐off between cell‐edge user data rates and average cell throughput. Proposals concerning ICI coordination/avoidance have been evaluated in combination with several heuristic adaptive subcarrier and power allocation algorithms. Copyright © 2009 John Wiley & Sons, Ltd.