| 注册
首页|期刊导航|电子科技大学学报|异构蜂窝网络中一种基于匈牙利算法的用户关联方法

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

苏恭超 陈彬 林晓辉 王晖 李乐民

电子科技大学学报2017,Vol.46Issue(2):346-351,6.
电子科技大学学报2017,Vol.46Issue(2):346-351,6.DOI:10.3969/j.issn.1001-0548.2017.02.005

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

User Association in Heterogeneous Cellular Networks Via the Hungarian Method

苏恭超 1陈彬 2林晓辉 2王晖 2李乐民2

作者信息

  • 1. 电子科技大学通信与信息工程学院成都 611731
  • 2. 深圳大学现代通信与信息处理重点实验室广东深圳 518060
  • 折叠

摘要

Abstract

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.

关键词

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

Key words

bipartite matching/cell association/heterogeneous networks/Hungarian method/load balancing

分类

信息技术与安全科学

引用本文复制引用

苏恭超,陈彬,林晓辉,王晖,李乐民..异构蜂窝网络中一种基于匈牙利算法的用户关联方法[J].电子科技大学学报,2017,46(2):346-351,6.

基金项目

国家自然科学基金(61301182, 61372078, 61171071) (61301182, 61372078, 61171071)

国家973项目(2013CB329103) (2013CB329103)

电子科技大学学报

OA北大核心CSCDCSTPCD

1001-0548

访问量0
|
下载量0
段落导航相关论文