异构蜂窝网络中一种基于匈牙利算法的用户关联方法  

User Association in Heterogeneous Cellular Networks Via the Hungarian Method

作　　者：苏恭超[1,2] 陈彬[2] 林晓辉[2] 王晖[2] 李乐民[1] SU Gong-chao CHEN Bin LIN Xiao-hui WANG Hui LI Le-min(School of Communication and Information Engineering, University of Electronic Science and Technology of China Chengdu 611731 Key Lab of Advanced Communications and Information Processing, Shenzhen University Shenzhen Guangdong 518060)

机构地区：[1]电子科技大学通信与信息工程学院,成都611731 [2]深圳大学现代通信与信息处理重点实验室,广东深圳518060

出　　处：《电子科技大学学报》2017年第2期346-351,共6页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(61301182;61372078;61171071);国家973项目(2013CB329103)

摘　　要：在异构蜂窝网络中使用传统的小区选择方法会导致宏基站和小基站的负载失衡,而与小基站关联的用户面临服务质量(Qo S)的降低的问题。针对该问题,提出了一种基于效用函数最大化的用户与基站关联方法。该方法将用户与基站的关联过程建模为双目标优化问题并且线性化为系数可调的效用函数最大化问题,以实现基站负载均衡和用户Qo S之间的折中。通过设计权值系数,将该效用函数最大化问题转化为基于二部图的最大匹配,并用匈牙利算法求得最优解。仿真结果表明,该方法实现了异构蜂窝网络中宏基站与小基站之间的负载均衡,并且通过系数调节,达到了基站负载均衡和用户Qo S之间的折中。In heterogeneous cellular networks, traditional user association schemes based on reference signal power result in load imbalances between macro cell base stations （MBSs） and small cell base stations （SBSs）. Meanwhile, offloading users to SBSs face the quality of service （QoS） degradation. In this paper, we propose a utility maximization framework to address the user association problem. In order to strike a tradeoff between load balancing and user QoS experiences, a bi-criterion optimization problem is formulated to solve the user association problem. The bi-criterion optimization problem is then linearized as a utility maximization problem with a tunable parameter. In addition, we show that the utility maximization problem can be reformulated as a maximum bi-partite matching problem and can be solved in polynomial time by using the Hungarian method. Simulation results show that our proposed method achieves load balancing and can strike tradeoffs between load balancing and user QoS by tuning the optimization parameter.

关 键 词：二部图匹配 用户关联 异构网络 匈牙利算法 负载均衡 

分 类 号：TN92[电子电信—通信与信息系统]