Open AccessOn a Strategy of Mobile Networks Synthesis
Author(s) -
V. Lyandres
Publication year - 2021
Publication title -
wseas transactions on communications/wseas transactions on communications
Language(s) - English
Resource type - Journals
eISSN - 2224-2864
pISSN - 1109-2742
DOI - 10.37394/23204.2021.20.13
Subject(s) - base station , computer science , cellular network , bounded function , base (topology) , euclidean geometry , quantization (signal processing) , point (geometry) , topology (electrical circuits) , dijkstra's algorithm , mathematical optimization , algorithm , distributed computing , mathematics , theoretical computer science , computer network , graph , shortest path problem , geometry , combinatorics , mathematical analysis
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