首页> 外文会议>IEEE International Conference on Communications Workshops >Backhaul-aware optimal access selection for traffic offloading in small-cell networks
【24h】

Backhaul-aware optimal access selection for traffic offloading in small-cell networks

机译:小型网络中用于回传流量的回传感知最佳访问选择

获取原文

摘要

The limited backhaul capacity has been considered as an important issue that influences the performance of traffic offloading in small-cell networks. We thus investigate how mobile users (MUs) efficiently offload traffic to different small cells with the new paradigm of dual-connectivity, subject to different backhaul capacities of small cells. Specifically, we formulate an optimization problem that jointly optimizes the MUs' access-selections, traffic scheduling, and transmit-power allocations, with the objective of minimizing all MUs' mobile data cost. To tackle with the difficulty due to the mixed binary nonconvex optimization problem, we decompose the joint optimization problem into a subproblem that optimizes the MUs' traffic scheduling and power allocations and a top problem that optimizes the MUs' access-selections. Based on our previous study [1], we can efficiently solve the subproblem by exploiting its hidden monotonicity. With the solution of the subproblem, we further propose two effective algorithms (namely, a simulated annealing based algorithm and a fast access-selection algorithm) to solve the top problem. The key idea of the fast access-selection algorithm is to exploit the information of limited backhaul capacities and properly remove the infeasible selection to reduce the search space. Numerical results validate the effectiveness of our proposed algorithms and the performance advantage of the proposed joint resource allocations for traffic offloading.
机译:有限的回程容量已被视为影响小蜂窝网络中流量分流性能的重要问题。因此,我们研究了移动用户(MU)如何通过双重连接的新范式有效地将流量分流到不同的小型小区,而这种新的范式则取决于小型小区的不同回程容量。具体来说,我们制定了一个优化问题,该问题可以共同优化MU的访问选择,流量调度和发射功率分配,目的是最大程度地降低所有MU的移动数据成本。为了解决由于混合二进制非凸优化问题而带来的困难,我们将联合优化问题分解为一个子问题,该子问题优化了MU的流量调度和功率分配,同时将其分解为优化MU的接入选择的首要问题。根据我们先前的研究[1],我们可以通过利用其隐藏的单调性来有效地解决子问题。通过该子问题的解决方案,我们进一步提出了两种有效的算法(即基于模拟退火的算法和快速访问选择算法)来解决上述问题。快速访问选择算法的关键思想是利用有限的回程容量信息,并适当地删除不可行的选择以减少搜索空间。数值结果验证了我们提出的算法的有效性以及提出的用于交通分流的联合资源分配的性能优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号