...
首页> 外文期刊>Wireless Communications, IEEE Transactions on >Design and Evaluation of a Backhaul-Aware Base Station Assignment Algorithm for OFDMA-Based Cellular Networks
【24h】

Design and Evaluation of a Backhaul-Aware Base Station Assignment Algorithm for OFDMA-Based Cellular Networks

机译:基于OFDMA的蜂窝网络的回程感知基站分配算法的设计和评估

获取原文
获取原文并翻译 | 示例
           

摘要

Existing base station (BS) assignment methods in cellular networks are mainly driven by radio criteria since it is assumed that the only limiting resource factor is on the air interface. However, as enhanced air interfaces have been deployed, and mobile data and multimedia traffic increases, a growing concern is that the backhaul of the cellular network can become the bottleneck in certain deployment scenarios. In this paper, we extend the BS assignment problem to cope with possible backhaul congestion situations. A backhaul-aware BS assignment problem is modeled as an optimization problem using a utility-based framework, imposing constraints on both radio and backhaul resources, and mapped into a Multiple-Choice Multidimensional Knapsack Problem (MMKP). A novel heuristic BS assignment algorithm with polynomial time is formulated, evaluated and compared to classical schemes based exclusively on radio conditions. Simulation results demonstrate that the proposed algorithm can provide the same system capacity with less backhaul resources so that, under backhaul bottleneck situations, a better overall network performance is effectively achieved.
机译:蜂窝网络中现有的基站(BS)分配方法主要由无线电标准驱动,因为假定唯一的限制资源因素在空中接口上。但是,随着增强型空中接口的部署以及移动数据和多媒体流量的增加,人们越来越担心的是,在某些部署方案中,蜂窝网络的回程可能成为瓶颈。在本文中,我们扩展了BS分配问题,以应对可能的回程拥塞情况。使用基于实用程序的框架将回程感知的BS分配问题建模为优化问题,对无线电和回程资源都施加约束,并映射到多选择多维背包问题(MMKP)。制定,评估并评估了一种具有多项式时间的新颖启发式BS分配算法,并将其与仅基于无线电条件的经典方案进行了比较。仿真结果表明,该算法能够以较少的回程资源提供相同的系统容量,从而在回程瓶颈的情况下有效地实现了较好的整体网络性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号