Planejamento celular usando diagramas de Voronoi.

Abstract

This thesis presents the cells of a cellular network as an ordered order-A: multiplicatively weighted Voronoi diagram. The Voronoi diagram demies partitions in the W space according to a proximity rule which is stated based on a distance function defined in terms of the environment propagation characteristics. The features of this diagram are applied to represent coverage, seetorization, cell hierarchy and cell borders. The Voronoi diagram provides proximity relations between base stations to be used in the analysis of the spatial traffic and related functions as handoff, interference, and outage. A channel allocation method is developed and applied to the case of a temporary base station. A new parameter, named neighboring level, is proposed to be used in the schemes of frequency reuse. A model to represent common coverage to adjacent cells is presented. The outage contour is expressed as an edge of the multiplicatively weighted Voronoi diagram to a pair of cells. The cell border is in fact an stochastic figure. However, its radius can be estimated by prediction and statistical methods. The path loss prediction as well as the statistical models are used to estimate the cells radii in order to obtain the distance function used in the geometric properties of the diagram. The estimated radius is used as the weight to the Euclidean distance between base stations in order to define the proximity rule.