基于比例公平原则的多用户MIMO-OFDM系统资源分配

提出了一种基于比例公平原则提高MIMO-OFDM系统吞吐量的子载波和功率分配算法.它在总功率和误比特率的约束下,以获取最大系统吞吐量为目标,同时为兼顾用户间资源享用的公平性,根据用户速率成比例推导出了子载波分配限制准则.仿真结果表明,本算法不仅可满足不同用户的速率要求,而且平衡了容量最大化和用户间公平性的矛盾,同时计算...     

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

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

一种新型的OFDMA比例公平资源分配算法

针对已有算法对系统容量和高公平性兼顾较差的情况,提出了一种满足公平性的系统容量最大化资源分配算法。在子载波分配中通过建立信道效率控制模型,给当前用户分配信道效率最高的子载波,将信道增益低于门限值的子载波重新分配,改进了最大化最小(max-min)用户速率模型。在功率分配中将系统模型转化成用注水线表示的数学模型,首先求解各用户的注水线,再求解各用户的功率分配,保证了用户间比例公平性。两种信噪比情形下的仿真和分析表明,整个方案计算复杂度稍低,系统容量获得较大提升,并且用户间的公平性始终为1。     

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

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

优化公平性的多用户OFDM系统下行链路资源分配算法

研究了优化公平性的多用户OFDM系统下行链路的资源分配算法,根据系统各用户的业务需求,在保证用户所得数据速率满足一定比例以及系统总功率限制的前提下,提高系统总数据速率。首先,根据公平性原则进行用户的子载波分配,子载波功率分配使用注水算法;子载波分配完成后,利用贪婪功率分配算法,以最大化用户数据速率和提高功率利用率为目标,对各用户内部子载波功率和比特数进行再分配。仿真结果表明,相比参考文献[10]的算法,该算法在提高系统总速率的同时,更好地保证了用户数据速率的公平性;相比参考文献[12]的算法,该算法虽然牺牲了一定的系统总速率,但能提供更高的用户数据速率公平性。     

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

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

OFDM-UWB系统基于用户速率的多用户动态资源分配算法

在原有动态资源分配算法基础上,提出了一种基于用户速率需求的动态资源分配算法。该算法在满足用户数据速率需求和服务质量要求(QoS)的前提下,以用户公平性为原则,分步执行子载波和比特分配来降低系统总的发射功率。首先,通过比较不同子载波对用户速率的影响,引入速率影响因子,对子载波进行分配;然后为每个用户子载波分配比特,并根据用户速率需求进行比特调整。为了进一步降低系统的复杂度,提出了一种通过子载波分组来完成子载波比特分配的方法。仿真结果表明,该算法能够降低系统功耗、误码率和系统复杂度。     

协作系统中基于比例公平的资源分配方法

针对多用户协作中继系统中的资源分配问题,提出了一种在满足用户速率比例公平约束条件下的新算法。该算法先将由2个时隙组成的中继用户传输链路转换为一个等效信道链路,将涉及子载波分配、中继选择和功率分配的组合优化问题转化为分步的次优化问题。该算法在等功率分配情况下,根据各用户速率比例公平系数进行初步子载波数目分配;以瞬时信道增益最佳原则,进行剩余子载波数目分配及具体子载波分配,同时完成中继选择;在速率比例公平约束条件下推导出次优化功率分配的闭式表达式,从而完成各子载波上的功率分配。仿真结果表明,该算法在有效提高系统容量的同时,保证了各用户速率之间的比例公平性。     

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

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

一种兼顾速率公平的多用户子载波功率联合分配算法

随着无线通信技术的迅猛发展,无线资源的需求量越来越大,用户对服务质量的要求也越来越高,因此,未来通信系统需要智能地在用户服务质量(QoS)需求和无线资源限制间进行一个有效的折中。为了提高认知无线网络频谱利用率,在可用子载波、次级用户功率预算及公平性等约束条件下,基于速率自适应(RA)准则,提出了在认知正交频分复用(OFDM)系统中兼顾速率公平的多用户子载波功率联合分配算法。该算法将子载波和功率分配分为两步,在兼顾各次级用户速率公平性的同时,最大化链路容量。仿真结果表明,该联合分配算法在系统吞吐量与次级用户速率公平性之间可以取得有效的折中。     

A Novel Genetic Algorithm for Adaptive Resource Allocation in MIMO-OFDM Systems with Proportional Rate Constraint

This paper considers base station allocation of subcarriers and power to each user to maximize the sum of user data rates, subject to constraints on total power, bit error rate, and proportionality among user data rates in Multiple Input Multiple Output Orthogonal Frequency Division Multiple access (MIMO-OFDMA) system. Previous allocation methods have been iterative nonlinear methods suitable for offline optimization. The subcarrier allocation is tackled using a novel algorithm which combines the aspects of both deterministic and Genetic Algorithms (GA). This modified GA gave very encouraging results as can be seen from the simulation results shown. The simulation results show a marked improvement in the performance of the algorithm as the number of users increase. The capacity attained from the subcarrier allocation scheme generated by our algorithm is found to be comparable to that attained by previous algorithms.     

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.     

Fair Multiuser Channel Allocation for OFDMA Networks Using Nash Bargaining Solutions and Coalitions

In this paper, a fair scheme to allocate subcarrier, rate, and power for multiuser orthogonal frequency-division multiple-access systems is proposed. The problem is to maximize the overall system rate, under each user's maximal power and minimal rate constraints, while considering the fairness among users. The approach considers a new fairness criterion, which is a generalized proportional fairness based on Nash bargaining solutions and coalitions. First, a two-user algorithm is developed to bargain subcarrier usage between two users. Then a multiuser bargaining algorithm is developed based on optimal coalition pairs among users. The simulation results show that the proposed algorithms not only provide fair resource allocation among users, but also have a comparable overall system rate with the scheme maximizing the total rate without considering fairness. They also have much higher rates than that of the scheme with max-min fairness. Moreover, the proposed iterative fast implementation has the complexity for each iteration of only$O(K^2Nlog_2 N+K^4)$, where$N$is the number of subcarriers and$K$is the number of users.     

Radio Resource Allocation Algorithms for the Downlink of Multiuser OFDM Communication Systems

This article surveys different resource allocation algorithms developed for the downlink of multiuser OFDM wireless communication systems. Dynamic resource allocation algorithms are categorized into two major classes: margin adaptive (MA) and rate adaptive (RA). The objective of the first class is to minimize the total transmit power with the constraint on users? data rates whereas in the second class, the objective is to maximize the total throughput with the constraints on the total transmit power as well as users? data rates. The overall performance of the algorithms are evaluated in terms of spectral efficiency and fairness. Considering the trade-off between these two features of the system, some algorithms attempt to reach the highest possible spectral efficiency while maintaining acceptable fairness in the system. Furthermore, a large number of RA algorithms considers rate proportionality among the users and hence, are categorized as RA with constrained-fairness. Following the problem formulation in each category, the discussed algorithms are described along with their simplifying assumptions that attempt to keep the performance close to optimum but significantly reduce the complexity of the problem. It is noted that no matter which optimization method is used, in both classes, the overall performance is improved with the increase in the number of users, due to multiuser diversity. Some on-going research areas are briefly discussed throughout the article.     

Fairness based resource allocation for multiuser MISO-OFDMA systems with beamforming

Resource allocation problem in multiuser multiple input single output-orthogonal frequency division multiple access (MISO-OFDMA) systems with downlink beamforming for frequency selective fading channels is studied. The article aims at maximizing system throughput with the constraints of total power and bit error rate (BER) while supporting fairness among users. The downlink proportional fairness (PF) scheduling problem is reformulated as a maximization of the sum of logarithmic user data rate. From necessary conditions on optimality obtained analytically by Karush-Kuhn-Tucker (KKT) condition, an efficient user selection and resource allocation algorithm is proposed. The computer simulations reveal that the proposed algorithm achieves tradeoff between system throughput and fairness among users.