共查询到20条相似文献，搜索用时 15 毫秒
1.
Yanyan Shen Gang Feng Bo Yang Xinping Guan 《Wireless Communications and Mobile Computing》2014,14(2):269-283
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. 相似文献
2.
针对实际正交频分复用多址访问（OFDMA,Orthogonal Frequency Division Multiple Access）系统中整数比特的限制问题,以及用户间公平性要求较为松弛的情况,提出了一种新的整数比特条件下的功率与比特分配算法。该算法首先按公平比例进行功率和比特分配,然后对分配结果取整,并将剩余的功率与比特再进行分配。仿真结果表明：该算法保持用户间的比例公平性的基础上取得与贪婪算法接近的系统容量,公平性优于贪婪算法。 相似文献
3.
This article investigates two fairness criteria with regard to adaptive resource allocation for uplink orthogonal frequency division multiple access （OFDMA） systems. Nash bargaining solution （NBS） fairness and proportional fairness （PF） are two suitable candidates for fairness consideration, and both can provide attractive trade-offs between total throughput and each user＇s capacity. Utilizing Karush-Kuhn- Tucker （KKT） condition and iterative method, two effective algorithms are designed, to achieve NBS fairness and proportional fairness, respectively. Simulation results show that the proposed resource allocation algorithms achieve good tradeoff between the overall rate and fairness, with little performance loss from the total capacity. 相似文献
4.
Chai Zheng‐Yi Zhu Si‐Feng Shen Lian‐Feng 《International Journal of Communication Systems》2014,27(11):3255-3265
Rate adaptive downlink resource allocation in orthogonal frequency division multiple access system is a constraint optimization problem, which is to maximize the minimum data rate of the user subject to constraint that total power cannot exceed a given value. How to handle the constraint is a key issue for constrained optimization problem. Different with the available schemes on constraint handling, the proposed algorithm converts the constraint into an objective. Then, the resource allocation is combined into a multi‐objective optimization problem. An improved multi‐objective optimization algorithm based on artificial immune system is proposed to solve it. The simulation results show that, compared with previous schemes, the proposed algorithm performs remarkable improvement in sum capacity. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
5.
在正交频分多址(OFDMA)系统中,合理的资源分配对于提升系统的性能具有重要的意义.针对多用户OFDMA系统,对最大化系统容量为目标的资源分配算法进行研究,提出了一种基于智能水滴算法的无向全连通图资源分配模型,以无向全连通图的顶点集和边集来描述用户与子载波之间的匹配关系.在此基础上,进一步对智能水滴算法进行改进.仿真结果表明,在满足用户比例公平性的条件下,与蚁群算法相比,基于改进智能水滴算法的全连通图分配方案能够提高2.17%~4.91%的系统速率,同时具有更快的收敛速度,提高了系统性能. 相似文献
6.
Fei Wang Xiaofeng Liao Songtao Guo Hongyu Huang 《International Journal of Communication Systems》2014,27(10):1505-1521
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. 相似文献
7.
8.
针对多用户协作中继系统中的资源分配问题,提出了一种在满足用户速率比例公平约束条件下的新算法。该算法先将由2个时隙组成的中继用户传输链路转换为一个等效信道链路,将涉及子载波分配、中继选择和功率分配的组合优化问题转化为分步的次优化问题。该算法在等功率分配情况下,根据各用户速率比例公平系数进行初步子载波数目分配;以瞬时信道增益最佳原则,进行剩余子载波数目分配及具体子载波分配,同时完成中继选择;在速率比例公平约束条件下推导出次优化功率分配的闭式表达式,从而完成各子载波上的功率分配。仿真结果表明,该算法在有效提高系统容量的同时,保证了各用户速率之间的比例公平性。 相似文献
9.
Dionysis Xenakis Dimitris Tsolkas Nikos Passas Nancy Alonistioti Lazaros Merakos 《Wireless Communications and Mobile Computing》2012,12(11):985-998
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. 相似文献
10.
针对多小区OFDMA系统下行链路,研究了用户公平性约束下的资源分配问题,提出了一种多基站协作的迭代优化的分布式资源分配算法。每个小区根据干扰状况及用户公平性,迭代地进行子载波和功率的资源优化;而每次迭代中,根据用户公平性准则分配子载波,并将非凸的小区功率优化问题转化为其下界的凸问题,通过一个分布式算法来求解。通过仿真验证了算法的有效性;仿真结果表明,与传统网络的固定功率分配的情形相比,所提算法保证了用户之间的公平性并显著提高了系统吞吐量。 相似文献
11.
LIN Le-xiang LIU Yuan-an LIU Fang XIE Gang LIU Kai-ming GE Xin-yang 《中国邮电高校学报(英文版)》2012,19(1):44-49,123
In this paper,we focus on the resource scheduling in the downlink of long term evolution advanced (LTE-A) assuming equal power allocation among subcarriers.Considering the backward compatibility,the LT... 相似文献
12.
13.
Cooperative game theory can be applied to orthogonal frequency division multiple access (OFDMA) networks for fair resource allocation. In this work, we consider a comprehensive cross‐layer framework including physical and medium access control layer requirements. We apply two cooperative games, nontransferable utility (NTU) game and transferable utility (TU) game, to provide fairness in OFDMA networks. In NTU game, fairness is achieved by defining appropriate objective function, whereas in TU game, fairness is provided by forming the appropriate network structure. For NTU game, we analyze the Nash bargaining solution as a solution of NTU game taking into account channel state information and queue state information. In a TU game, we show that coalition among subcarriers to jointly provide rate requirements leads to better performance in terms of power consumption. The subcarrier's payoff is determined according to the amount of payoff which that subcarrier brings to the coalition by its participation. We show that although NTU and TU games are modeled as rate adaptive and margin adaptive problems, respectively, both solutions provide a fair distribution of resources with minimum fairness index of 0.8. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
14.
在OFDMA系统中,小区边缘用户由于受到来自相邻小区的同频干扰,通信质量严重下降.有效地抑制小区间干扰,极大地提升无线网络性能尤其是小区边缘用户性能是5G移动通信系统的目标之一.基于速率自适应(RA)准则提出了一种提高小区边缘用户性能的子载波和功率的联合资源分配算法,该算法分为子载波分配和混合功率分配两步,在提高小区边缘用户性能的同时,最大化链路吞吐量.仿真结果表明,小区边缘用户吞吐量增益为25％以上,混合功率分配下的系统吞吐量逼近全部用户使用注水法时的系统吞吐量,并且降低了运算复杂度. 相似文献
15.
16.
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. 相似文献
17.
Shaowei Wang Fangjiang Huang Mindi Yuan Sidan Du 《International Journal of Communication Systems》2012,25(2):254-269
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. 相似文献
18.
Wei Wang Wenbo Wang Qianxi Lu Tao Peng 《International Journal of Communication Systems》2009,22(5):603-623
Cognitive radio makes it possible for an unlicensed user to access a spectrum unoccupied by licensed users. In cognitive radio networks, extra constraints on interference temperature need to be introduced into radio resource allocation. In this paper, the uplink radio resource allocation is investigated for OFDMA‐based cognitive radio networks. In consideration of the characteristics of cognitive radio and OFDMA, an improved water‐filling power allocation scheme is proposed under the interference temperature constraints for optimal performance. Based on the improved water‐filling power allocation, a simple subcarrier allocation algorithm for uplink is proposed. The subcarrier allocation rules are obtained by theoretical deduction. In the uplink subcarrier allocation algorithm, the subcarriers are allocated to the users with the best channel quality initially and then adjusted to improve the system performance. A cursory water‐filling level estimation method is used to decrease the complexity of the algorithm. Asymptotic performance analysis gives a lower bound of the stability of the water‐filling level estimation. The complexity and performance of the proposed radio resource allocation scheme are investigated by theoretical analysis and numerical results. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
19.
一种自适应的OFDMA系统下行分组调度算法 总被引：1，自引：0，他引：1
提出了一种适合于OFDMA（正交频分多址接入）系统的资源分配与调度算法,该算法利用物理层的信道信息和MAC层的队列状态信息,并综合考虑了数据分组传输的时延要求和业务的优先级,采取资源块与子载波分配相结合的资源分配方式。仿真结果表明,该算法在吞吐量和公平性方面都得到了较好的改善。 相似文献
