Optimized Cell Planning for Path Loss Reduction

N. Sah
{"title":"Optimized Cell Planning for Path Loss Reduction","authors":"N. Sah","doi":"10.1109/ICCEE.2008.19","DOIUrl":null,"url":null,"abstract":"In this paper, an optimized cell planning for path loss reduction has been proposed. A 10 by 10 Km square block is considered as traffic required area (TRA) which consists of number of base stations (BSs) and mobile stations (MSs). The optimization algorithm: Tabu search, is used to optimize the position of base stations in such a way that the path loss (or reciprocal signal strength) between the BS and MS is minimum (or maximum). In order to accommodate large number of users, algorithm adds new BSs and also drops existing BSs. Then, the propagation path loss from a base station to a receiver point was calculated according to Okumura-Hata and Walfisch-Ikegami model. These are empirical models based on the measurement data. In order to improve the efficiency of the Tabu search, intensification through dynamic Tabu list and Tabu time have been used. Results obtained showed that proposed algorithm is highly effective. There is a capacity improvement by 14% at 900 MHz and 15% at 1200 MHz and the corresponding reduction in outdoor propagation path loss varies from 1 to 15 dB.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Computer and Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEE.2008.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, an optimized cell planning for path loss reduction has been proposed. A 10 by 10 Km square block is considered as traffic required area (TRA) which consists of number of base stations (BSs) and mobile stations (MSs). The optimization algorithm: Tabu search, is used to optimize the position of base stations in such a way that the path loss (or reciprocal signal strength) between the BS and MS is minimum (or maximum). In order to accommodate large number of users, algorithm adds new BSs and also drops existing BSs. Then, the propagation path loss from a base station to a receiver point was calculated according to Okumura-Hata and Walfisch-Ikegami model. These are empirical models based on the measurement data. In order to improve the efficiency of the Tabu search, intensification through dynamic Tabu list and Tabu time have been used. Results obtained showed that proposed algorithm is highly effective. There is a capacity improvement by 14% at 900 MHz and 15% at 1200 MHz and the corresponding reduction in outdoor propagation path loss varies from 1 to 15 dB.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
路径损耗减少的优化单元规划
本文提出了一种减少路径损耗的优化单元规划方法。一个10乘10公里的正方形块被认为是通信量所需面积(TRA),它由基站(BSs)和移动基站(MSs)的数目组成。优化算法:禁忌搜索,用于优化基站的位置,使BS和MS之间的路径损耗(或信号强度的倒数)最小(或最大)。为了容纳大量的用户,算法会增加新的BSs,同时也会删除现有的BSs。然后,根据Okumura-Hata和Walfisch-Ikegami模型计算基站到接收点的传播路径损耗。这些是基于测量数据的经验模型。为了提高禁忌搜索的效率,采用了动态禁忌列表强化和禁忌时间强化。实验结果表明,该算法是非常有效的。900 MHz和1200 MHz的容量分别提高14%和15%,室外传播路径损耗相应减少1到15 dB。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Understanding Code Patterns Analysis, Interpretation and Measurement Community Collaborative Filtering for E-Learning A Nonlinear Control Approach to Increase Power Oscillations Damping by SSSC Automatic Recognition of Pavement Surface Crack Based on BP Neural Network A Dynamic Model for Early Vision Processing
×
引用
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