东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

Energy-efficient joint relay node selection and power allocation over multihop relaying cellular networks toward LTE-Advanced

ISSN号：1005-8885
期刊名称：《中国邮电高校学报：英文版》
时间：0
分类：TN929.5[电子电信—通信与信息系统;电子电信—信息与通信工程] TE832.2[石油与天然气工程—油气储运工程]
作者机构：[1]Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China
相关基金：Acknowledgements This work was supported by the National Natural science Foundation of China （2009ZX03002-014）, and the National Youth Science Foundation （61001115）.

作者： CHEN Dan JI Hong LI Xi[1]

关键词： OFDM系统, 调度计划, 公平性, 多用户, 跨层, 正交频分复用, 启发式算法, 用户设备, multi-user OFDM, scheduling, cross-layer design, restless bandits

中文摘要：

在象长期的进化(LTE ) 那样的基于 OFDM 的系统，安排计划在不仅改进系统，而且保证的能力起一个必要作用在用户设备(UE ) 之中的公平。然而，关于安排的大多数存在工作仅仅在物理层考虑当前的产量。因此在这糊，基于不安的土匪( CSFRB )的与公平的跨层的安排有 indexability 性质的计划为多用户被建议在申请层最小化失真的直角的频率部门 multiplexing ( OFDM )系统，最大化产量并且在物理层最小化精力消费。安排问题第一作为一个不安的土匪问题被建立，它被最初双的索引解决启发式的算法基于有低复杂性的第一顺序松驰，产出 CSFRB 计划。另外，这个计划被划分成离线的计算和联机选择，在主要工作将在以前的被完成以便减少的地方复杂性进一步。最后，广泛的模拟结果在不同情形与存在的那相比说明建议 CSFRB 计划的重要表演改进。

英文摘要：

In OFDM-based System such as long term evolution （LTE）, the scheduling scheme plays an essential role in not only improving the capacity of system, but also guarantee the fairness among the user equipments （UEs）. However, most existing work about scheduling only considers the current throughput in physical layer. Thus in this paper, a cross-layer scheduling with fairness based on restless bandit （CSFRB） scheme with the ＇indexability＇ property is proposed for the multi-user orthogonal frequency-division multiplexing （OFDM） system to minimize the distortion in the application layer, to maximize the throughput and to minimize the energy consumption in the physical layer. The scheduling problem is firstly established as a restless bandit problem, which is solved by the primal-dual index heuristic algorithm based on the first order relaxation with low complexity, to yield the CSFRB scheme. AdditionaUy, this scheme is divided into offiine computation and online selection, where main work will be finished in former one so as to decrease the complexity further. Finally, extensive simulation results illustrate the significant performance improvement of the proposed CSFRB scheme compared to the existing one in different scenarios.