低复杂度的OFDMA系统调度与资源分配算法  

Scheduling and resource allocation algorithm for OFDMA system with low complexity

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

机构地区：[1]中国科学院微电子研究所通信与多媒体SoC研究室,北京100029

出　　处：《沈阳工业大学学报》2013年第5期572-579,共8页Journal of Shenyang University of Technology

基　　金：国家重点基础研究发展计划(973计划)资助项目(2009CB320304)

摘　　要：针对多用户多业务OFDMA系统存在的缺陷与不足,提出了一种低复杂度的分组调度与资源分配算法.该算法考虑队列状态、QoS要求、信道情况和业务优先级等信息,分别定义了实时轮询服务、非实时轮询服务和尽力而为服务的效用函数,算法在满足各种业务延时、传输速率和丢包率约束条件下,通过最大化非实时业务总吞吐量实现调度和资源分配.仿真结果表明,与已有算法相比,该算法在非实时业务总吞吐量下降不大的情况下,在性能和复杂度之间取得了较好的折中.In order to overcome the disadvantages in multi-user and multi-service OFDM system, a packet scheduling and resource allocation algorithm with low complexity was proposed. With considering such information as queue state, QoS requirement, channel condition and service priority, the utility functions for real-time polling services （rtPS）, non-real-time polling services （ nrtPS ） and best effort （BE） services were defined, respectively. With satisfying the constraint conditions such as various service delay, transmission rate and packet loss rate, the scheduling and resource allocation were realized through maximizing the total throughput for non-real-time services in the proposed algorithm. The simulated results show that compared with the existing algorithms, a better tradeoff between the performance and complexity can be achieved in the proposed algorithm when the decline of total throughput for non-real-time services is slight.

关 键 词：通信技术 OFDMA系统 多用户多业务 分组调度 资源分配 包延时 传输速率 丢包率 公平性 

分 类 号：TN911.72[电子电信—通信与信息系统]