移动网络综合战略研究

V. Lyandres
{"title":"移动网络综合战略研究","authors":"V. Lyandres","doi":"10.37394/23204.2021.20.13","DOIUrl":null,"url":null,"abstract":"Effective design of mobile communication network includes optimization of two bounded together processes: the network base stations placement and the channel assignment. In real environments the well-known cellular concept fails due to not uniformly spaced traffic and not isotropic wave propagation. We find a rather universal method for synthesis of a close to optimal network structure. The proposed design approach is based on the idea of adaptive vector quantization for a map with random traffic. As a result, the service zone of the network becomes discrete and is being transformed to a map with not equal cells and approximately equal number of requests in every one. This fact allows to apply the simplest periodic reuse pattern. The algorithm finds a point with minimal average Euclidean distance from all its requests. This point defines optimal placement of the corresponding base station. The approach guarantees maximum coverage","PeriodicalId":330638,"journal":{"name":"WSEAS TRANSACTIONS ON COMMUNICATIONS","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On a Strategy of Mobile Networks Synthesis\",\"authors\":\"V. Lyandres\",\"doi\":\"10.37394/23204.2021.20.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Effective design of mobile communication network includes optimization of two bounded together processes: the network base stations placement and the channel assignment. In real environments the well-known cellular concept fails due to not uniformly spaced traffic and not isotropic wave propagation. We find a rather universal method for synthesis of a close to optimal network structure. The proposed design approach is based on the idea of adaptive vector quantization for a map with random traffic. As a result, the service zone of the network becomes discrete and is being transformed to a map with not equal cells and approximately equal number of requests in every one. This fact allows to apply the simplest periodic reuse pattern. The algorithm finds a point with minimal average Euclidean distance from all its requests. This point defines optimal placement of the corresponding base station. The approach guarantees maximum coverage\",\"PeriodicalId\":330638,\"journal\":{\"name\":\"WSEAS TRANSACTIONS ON COMMUNICATIONS\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"WSEAS TRANSACTIONS ON COMMUNICATIONS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37394/23204.2021.20.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"WSEAS TRANSACTIONS ON COMMUNICATIONS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37394/23204.2021.20.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

有效的移动通信网络设计包括网络基站布局和信道分配两个紧密结合的过程的优化。在实际环境中,众所周知的蜂窝概念由于通信间隔不均匀和波传播不各向同性而失效。我们找到了一种较为通用的逼近最优网络结构的综合方法。所提出的设计方法是基于随机交通地图的自适应矢量量化思想。因此,网络的服务区域变得离散,并被转换为具有不相等单元和每个单元中请求数量大致相等的地图。这一事实允许应用最简单的周期性重用模式。该算法从所有请求中找到一个平均欧氏距离最小的点。这一点定义了相应基站的最佳位置。这种方法保证了最大的覆盖率
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On a Strategy of Mobile Networks Synthesis
Effective design of mobile communication network includes optimization of two bounded together processes: the network base stations placement and the channel assignment. In real environments the well-known cellular concept fails due to not uniformly spaced traffic and not isotropic wave propagation. We find a rather universal method for synthesis of a close to optimal network structure. The proposed design approach is based on the idea of adaptive vector quantization for a map with random traffic. As a result, the service zone of the network becomes discrete and is being transformed to a map with not equal cells and approximately equal number of requests in every one. This fact allows to apply the simplest periodic reuse pattern. The algorithm finds a point with minimal average Euclidean distance from all its requests. This point defines optimal placement of the corresponding base station. The approach guarantees maximum coverage
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信