期刊文献+

超密集异构网中基于配对理论的用户关联算法 被引量:3

A User Association Algorithm Based on Matching Theory in Ultra-dense Heterogeneous Networks
下载PDF
导出
摘要 超密集异构网络作为提升网络数据流量和用户速率的有效手段,成为5G关键技术中的一员。但超密集部署的小小区基站势必会导致系统总能耗的增加,以及用户接入公平性等问题。解决给定目标速率条件下基于能效优化的用户关联(也称为用户接入)问题。改进了原有的功耗优化模型,使之更准确地反映基站的实际发射功率和总功耗。在此基础上,利用拉格朗日对偶和二分法对关联过程中用户分配到的资源比例和基站为每个关联用户提供的发射功率进行优化和调节;同时结合配对理论,提出一种综合考虑能效和接入公平度的用户关联算法。性能仿真和对比结果表明,算法在保持良好的用户接入公平性的基础上有效提升了系统能效。 Ultra-dense heterogeneous network,as an effective means to meet the needs of exponential growth in data traffic and high user rate,has become a member of 5G s key technologies.While ultra-densely deployed small cell base stations will inevitably result in increased power consumption and access fairness problem.The problem of user association(also called user access)with energy efficiency(EE)optimization under given rate demands was investigated.The original power consumption model was improved to make it more accurately reflect the actual transmit power and whole power consumption of the base station.And then,lagrange duality and bisection method were used to optimize and adjust the proportion of resource allocated to users and the transmit power provided by the base station for each associated user.Combined with matching theory,a user association algorithm considering both EE and access fairness was proposed.Performance simulation and comparison results show that the proposed approach performs well in access fairness and effectively improves EE of the system.
作者 陈莉佳 尼俊红 郭浩然 CHEN Li-jia;NI Jun-hong;GUO Hao-ran(School of Electrical and Electronic Engineering College,North China Electric Power University(Baoding),Baoding 071003,China)
出处 《科学技术与工程》 北大核心 2018年第25期61-65,共5页 Science Technology and Engineering
基金 国家自然科学基金(61771195 61601182) 河北省科学基金(F2017502059)资助
关键词 超密集异构网络 用户关联 能效优化 配对理论 ultra-dense heterogeneous network user association energy efficiency optimization matching theory
  • 相关文献

参考文献1

二级参考文献1

共引文献3

同被引文献8

引证文献3

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部