检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄晓燕[1] 毛玉明[1] 吴凡[1] 冷甦鹏[1]
机构地区:[1]电子科技大学通信与信息工程学院,成都610054
出 处:《计算机应用研究》2009年第5期1860-1864,共5页Application Research of Computers
基 金:国家"863"计划资助项目(2005AA121122)
摘 要:主要研究了QoS和BE两种混合业务场景下OFDM无线网络下行链路的资源调度问题,提出了一个基于效用函数的跨层资源调度模型,其能够自适应地对两种业务进行资源的联合优化分配。该模型被抽象为一个非线性整数规划问题,优化目标是系统总效用最大化,同时满足同信道干扰(CCI)约束以及QoS业务的质量要求。将该非线性整数规划问题转换为连续松弛凸规划问题进行求解,并结合最优松弛解,提出了一种简单的动态子载波分配算法,即MMU(mix-max-utility)算法。仿真结果验证了该调度算法能使系统较好地支持混合业务,系统实际效用接近理论最优值。This paper concentrated on the problem of resource allocation in OFDM wireless networks which support both QoS traffic and best effort (BE) traffic, and proposed a utility-based cross-layer resource scheduling model, which performed combinational-optimization adaptive resources allocation. First, formulated the scheduling model as a non-linear integer program problem with the objective of maximization total utility, constrained to the CCI restriction and the quality-of-service requirement of QoS traffic. And then,transformed the original integer program into a continue relaxing convex program problem and solved it. Based on the optimal relaxing solution,proposed a low complexity dynamic subcarrier allocation algorithm, namely MMU algorithm. Simulation results demonstrate that the scheduling algorithm guarantees a good performance of supporting heterogeneous services, and the system utility value obtained by MMU algorithm is very close to the optimal value.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15