{"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}
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