Employing Clustering Techniques in Mobile Network Planning

L. F. Ibrahim, M. A. Harbi
{"title":"Employing Clustering Techniques in Mobile Network Planning","authors":"L. F. Ibrahim, M. A. Harbi","doi":"10.1109/NTMS.2008.ECP.42","DOIUrl":null,"url":null,"abstract":"Network planning is of key importance during the construction of new communities and cities, in which telephone and data services have to be introduced as a component of the overall master plan of the city. With the rapid development in mobile network we need effective network planning tool to satisfy the need of customers. However, deciding upon the optimum placement for the base stations (BS's) to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original partitioning around medoids PAM algorithm. The PAM original algorithm has been modified and a new algorithm M- PAM (modified-partitioning around medoids) has been proposed by the authors in a recent work (L.F Ibrahin and M.H. Al Harbi, 2008). This paper presents CWN-PAM (clustering with weighted node-partitioning around medoids) algorithm and compare it with M-PAM algorithm. Implementation of this algorithm to a real case study is presented. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problem of mobile network planning.","PeriodicalId":432307,"journal":{"name":"2008 New Technologies, Mobility and Security","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 New Technologies, Mobility and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NTMS.2008.ECP.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Network planning is of key importance during the construction of new communities and cities, in which telephone and data services have to be introduced as a component of the overall master plan of the city. With the rapid development in mobile network we need effective network planning tool to satisfy the need of customers. However, deciding upon the optimum placement for the base stations (BS's) to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original partitioning around medoids PAM algorithm. The PAM original algorithm has been modified and a new algorithm M- PAM (modified-partitioning around medoids) has been proposed by the authors in a recent work (L.F Ibrahin and M.H. Al Harbi, 2008). This paper presents CWN-PAM (clustering with weighted node-partitioning around medoids) algorithm and compare it with M-PAM algorithm. Implementation of this algorithm to a real case study is presented. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problem of mobile network planning.
应用聚类技术进行移动网络规划
网络规划在建设新社区和新城市期间具有关键的重要性,其中电话和数据服务必须作为城市总体总体规划的一个组成部分加以引进。随着移动网络的快速发展,需要有效的网络规划工具来满足用户的需求。然而,决定基站的最佳位置以实现最佳服务,同时降低成本是一项复杂的任务,需要大量的计算资源。本文通过改进原有的围绕媒质的PAM算法进行划分,解决了天线放置问题或小区规划问题,涉及到移动网络基础设施的定位和配置。作者在最近的工作(L.F ibrahim and M.H. Al Harbi, 2008)中对PAM原始算法进行了改进,提出了一种新的算法M- PAM (modified-partitioning around mediids)。提出了CWN-PAM算法,并与M-PAM算法进行了比较。最后给出了该算法在实际应用中的具体实现。结果表明,该修正算法在解决移动网络规划这一重要问题上具有有效性和灵活性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信