• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2012 2nd International Conference on Communications and Information Technology >Ranked overlapping coverage based construction of efficient neighboring cell list for GSM/UMTS cellular networks
【24h】

Ranked overlapping coverage based construction of efficient neighboring cell list for GSM/UMTS cellular networks

机译：基于排序重叠覆盖的GSM / UMTS蜂窝网络的有效相邻小区列表构建

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Handover guarantees sustained connectivity during movement of mobile subscribers within cellular networks. In the planning phase of a typical cellular network, the neighboring cell list (NCL) construction depicts the most important feature that would guide the handover performance for each cell. The NCL defines a limited number of cells (neighbors) as candidates for handover from the serving cell of a given subscriber. The identity and number of members of a given NCL play a critical role in the performance of handover where successful handover procedures are mainly attributed to correct construction of NCL. NCLs that suffer from missing neighbor cells result in handover failure or sub-optimal handover decisions. On the other hand, long NCLs are associated with handover delay. In a typical cellular service provider, the initial NCLs are manually constructed and then the defined lists are further optimized during operation. Depending on the efficiency of the manually generated list, the network may suffer bad handover performance until these lists are optimized. To overcome this problem, this paper introduces a mechanism to automatically generate an efficient NCL for a new planned cell based on ranked overlapping coverage using empirical model calculations. The proposed algorithm was tested on a real-life network for two types of mobile generations (GSM and UMTS). The designed NCL is shown to contain all essential neighbors of operationally optimized lists with minimal increase of average NCL lengths.
机译：切换保证了移动用户在蜂窝网络内移动期间的持续连接。在典型的蜂窝网络的规划阶段，相邻小区列表（NCL）的构建描绘了最重要的功能，该功能将指导每个小区的切换性能。 NCL定义了数量有限的小区（邻居）作为从给定用户的服务小区进行切换的候选者。给定NCL的身份和成员数量在切换性能中起着至关重要的作用，其中成功的切换过程主要归功于NCL的正确构造。遭受丢失相邻小区影响的NCL导致切换失败或次优切换决策。另一方面，长的NCL与切换延迟相关联。在典型的蜂窝服务提供商中，手动构造初始NCL，然后在操作过程中进一步优化定义的列表。取决于手动生成的列表的效率，在优化这些列表之前，网络可能会遭受不良的切换性能。为了克服这个问题，本文介绍了一种机制，该机制可以使用经验模型计算，根据排名重叠的覆盖范围，自动为新的计划小区生成有效的NCL。该算法在现实生活的网络中针对两种类型的移动代（GSM和UMTS）进行了测试。显示设计的NCL包含操作优化列表的所有基本邻居，并且平均NCL长度的增加最小。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号