基于对偶分解的OFDMA系统资源分配算法  

A Dual-decomposition-based Resource Allocation Algorithm for OFDMA Systems

作　　者：左勇[1] 刘学勇[1] 刘海洋[1] 陈杰[1] 

机构地区：[1]中国科学院微电子研究所,北京100029

出　　处：《电子与信息学报》2012年第12期2843-2849,共7页Journal of Electronics & Information Technology

基　　金：国家973计划项目(2009CB320304)资助课题

摘　　要：该文针对多业务OFDMA系统资源分配问题,建立了考虑业务服务质量、数据到达、系统约束的最优化问题。分析了不同业务的速率约束、延时约束和队列长度之间的关系,并利用对偶分解方法将原问题分解为若干独立子问题,分别得到了最优资源块与最优功率分配规则,进而提出了基于对偶分解的最优资源分配算法。仿真结果表明,该算法在业务违反概率较低、公平性较好、算法复杂度略有上升的情况下,可以实现非实时业务吞吐量最大化。The resource allocation issue in multi-services OFDMA systems is formulated by taking Quality of Service （QoS） requirement, data arrival process, system constraints into account. The relations among the traffic rate constraint, latency constraint and the queue length are analyzed. The original issue is decomposed into some independent sub-problems by dual decomposition scheme. The optimal resource blocks allocation scheme and optimal power allocation scheme can be obtained and a Dual Decomposition Based （DDB） optimization resource allocation algorithm is proposed. Simulation results show that total throughput maximum for non-real-time services is achieved by employing DDB algorithm with low service violation probability, nice fairness and slightly increased algorithm complexity.

关 键 词：正交频分多址接入(OFDMA) 资源分配 最优化 对偶分解 

分 类 号：TN92[电子电信—通信与信息系统]