A mathematical model for joint optimization of coverage and capacity in Self-Organizing Network in centralized manner

Wei Luo, Jie Zeng, Xin Su, Jingyu Li, Limin Xiao
{"title":"A mathematical model for joint optimization of coverage and capacity in Self-Organizing Network in centralized manner","authors":"Wei Luo, Jie Zeng, Xin Su, Jingyu Li, Limin Xiao","doi":"10.1109/ChinaCom.2012.6417558","DOIUrl":null,"url":null,"abstract":"In this paper we introduce a mathematical model in the framework of long term evolution (LTE) to solve the problem of coverage and capacity optimization by employing multi-level random Taguchi's Method. The optimization process runs in a centralized manner with no human intervention required and interacts with environment situation automatically. Under the mathematical model which combines coverage and capacity optimization by a coefficient factor, conventional Taguchi's Method transcends traditional trial-and-error approach in convergence speed and simple implementation, to offer even more search capacity, Gaussian shrink coefficient and random optimization offset are applied to the level-to-tilts mapping function. Antenna tilt is an effective interference reduction technique, which has been adopted as the tuning parameter. The simulation results turn out to be better than traditional Taguchi's Method and trial-and-error approach. The system model presented and evaluated also gives an insight to the mathematical model especially the trade-off between coverage and capacity in homogeneous scenario.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Conference on Communications and Networking in China","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ChinaCom.2012.6417558","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this paper we introduce a mathematical model in the framework of long term evolution (LTE) to solve the problem of coverage and capacity optimization by employing multi-level random Taguchi's Method. The optimization process runs in a centralized manner with no human intervention required and interacts with environment situation automatically. Under the mathematical model which combines coverage and capacity optimization by a coefficient factor, conventional Taguchi's Method transcends traditional trial-and-error approach in convergence speed and simple implementation, to offer even more search capacity, Gaussian shrink coefficient and random optimization offset are applied to the level-to-tilts mapping function. Antenna tilt is an effective interference reduction technique, which has been adopted as the tuning parameter. The simulation results turn out to be better than traditional Taguchi's Method and trial-and-error approach. The system model presented and evaluated also gives an insight to the mathematical model especially the trade-off between coverage and capacity in homogeneous scenario.
自组织网络集中覆盖与容量联合优化的数学模型
本文引入了长期演进(LTE)框架下的数学模型,利用多层随机田口法解决覆盖和容量优化问题。优化过程以集中的方式运行,不需要人工干预,并自动与环境情况交互。在一个系数因子结合覆盖和容量优化的数学模型下,传统的田口法在收敛速度和实现简单方面超越了传统的试错法,为提供更大的搜索容量,将高斯收缩系数和随机优化偏移量应用于水平到倾斜的映射函数。天线倾斜是一种有效的抗干扰技术,采用倾斜作为调谐参数。仿真结果优于传统的田口法和试错法。所提出和评估的系统模型也提供了对数学模型的洞察,特别是在同构场景下覆盖率和容量之间的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信