检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学通信与信息工程学院,重庆400065
出 处:《计算机应用》2014年第6期1533-1536,共4页journal of Computer Applications
基 金:国家科技重大专项(2013ZX03003014-004;2011ZX03003-003-02)
摘 要:传统的基于终端节能的绿色资源分配算法大都忽略了无线信道的时间选择性对能耗与系统性能的影响,为此提出一种结合多用户分集的绿色资源分配算法。在保证用户公平性的基础上引入多用户分集,动态调整多用户分集子模块大小以满足信道时变特性要求;分集子模块内有多个频带可供使用,用户资源尽可能集中在比较少的时隙内传输以降低总的终端接收能耗,通过顶点搜索快速寻找最优解。仿真结果表明,系统吞吐量可以提高13%左右,其稳定性得到改善;同时算法具有计算复杂度低、收敛速度快等特点,保持了良好的终端节能增益。The traditional green resource allocation algorithms are based on terminal energy saving, while most of them neglect the impact of time-selectivity of the channel on energy consumption and system performance. An efficient green resource allocation algorithm which incorporated multi-user diversity was proposed. This algorithm guaranteed fairness among users and dynamically adjusted size of diversity sub-module to satisfy the time-varying character of channel. Due to multiple available frequency bands in any diversity sub-module, the receiving energy of user equipments could be minimized by scheduling users' resources into fewer time slots. The optimal solution could be reached efficiently by searching along the boundary. The simulation results illustrate that the proposed algorithm can increase system throughput about 13% with improved stability, lower computational complexity and faster convergence, maintaining a good terminal power-saving gain.
关 键 词:正交频分复用 时变信道 时延 多用户分集 绿色资源分配
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3