首页> 外文会议>IEEE Consumer Communications and Networking Conference >Nash bargaining solution based user association optimization in HetNets
【24h】

Nash bargaining solution based user association optimization in HetNets

机译:基于NASH讨价还价的Hetnets的用户关联优化

获取原文

摘要

In this paper, a fair user association scheme is proposed for heterogeneous networks (HetNets), where the user association optimization is formulated as a Nash bargaining problem. The optimization objective is to maximize the sum of rate related utility, under users' minimal rate constrains, while considering user fairness and load balance between cells in different tiers. Nash bargaining solution and coalition are adopted to solve this optimization problem. Firstly, a two-player bargaining scheme is developed for two base stations (BSs) to bargain user association. Then this two-player scheme is extended to a multi-player bargaining scheme with the aid of Hungarian algorithm that optimally groups BSs into pairs. Simulation results show that the proposed scheme can effectively offload users from macrocells, improve user fairness, and also achieve comparable sum rate to the scheme that maximizes the sum rate without considering user fairness.
机译:本文提出了一种公平的用户关联方案,用于异构网络(Hetnet),其中用户关联优化被制定为纳什议中问题。优化目标是在用户最小速率限制下最大化速率相关实用程序的总和,同时考虑用户公平和在不同层中的细胞之间的负载平衡。采用纳什议价解决方案和联盟来解决这一优化问题。首先,为两个基站(BSS)开发了双人讨价还价方案,以讨价还价用户协会。然后,这种双球员方案借助匈牙利算法扩展到多人讨价还价方案,从而使BSS成对地将BSS组成。仿真结果表明,该方案可以有效地卸载来自宏小区的用户,提高用户公平性,并且还实现了在不考虑用户公平的情况下最大化总和率的方案的可比性率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号