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

R. Atawia, Mariam El Azab, T. Elshabrawy, M. Ashour
{"title":"Ranked overlapping coverage based construction of efficient neighboring cell list for GSM/UMTS cellular networks","authors":"R. Atawia, Mariam El Azab, T. Elshabrawy, M. Ashour","doi":"10.1109/ICCITECHNOL.2012.6285802","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"60 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Communications and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHNOL.2012.6285802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于排序重叠覆盖的GSM/UMTS蜂窝网络高效相邻小区列表构建
切换保证移动用户在蜂窝网络内移动时的持续连接。在典型蜂窝网络的规划阶段,相邻小区列表(NCL)结构描述了指导每个小区切换性能的最重要特征。NCL定义了有限数量的小区(邻居)作为从给定用户的服务小区进行切换的候选者。在交接过程中,特定语言共同体成员的身份和数量起着至关重要的作用,而交接过程的成功主要取决于语言共同体的正确构建。相邻细胞缺失的ncl会导致切换失败或切换决策次优。另一方面,较长的ncl与切换延迟有关。在典型的蜂窝服务提供商中,初始ncl是手动构建的,然后在运行期间进一步优化定义的列表。根据手工生成列表的效率,在这些列表得到优化之前,网络可能会遭受糟糕的切换性能。为了克服这一问题,本文引入了一种基于经验模型计算的基于重叠覆盖排序的新规划单元自动生成高效NCL的机制。该算法在GSM和UMTS两种类型的实际网络上进行了测试。结果表明,所设计的NCL包含运行优化列表的所有基本邻域,且NCL平均长度增加最小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the BEP performance of binary noncoherent modulation schemes in frequency-nonselective M2M double Hoyt fading channels Sequential spectrum sensing based on higher-order statistics for cognitive radios TPC-H benchmarking of Pig Latin on a Hadoop cluster Enhanced Slotted ALOHA protocol with collision processing and relay cooperation Case study: Impacts on information systems governance, agility and strategic flexibility of simultaneous implementation of several process approaches
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1