Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling (Q1002494)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling
scientific article

    Statements

    Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 February 2009
    0 references
    This paper provides an analysis of a specialized case of modulated Poisson-Voronoi tesselations. The modulation used in the paper was generated by a Boolean germ-grain model with circular grains. This means that this model can be used to model densities or spatial densities of network devices on nationwide scales. In addition, the possible randomness of the radius of the grains allows us to minimize the observed features of the towns lying in a given area. In the stationary case, the typical cell obtained by these tessellations can be regarded as a cell chosen at random out of the pool of all cells. These tessellations may either have a deterministic or random but bounded radius. Furthermore, the Poisson tessellation modulated in this way can provide Voronoi tessellation, as well as so-called inner city model or swiss cheese model. Several values of the mean distance from a randomly choosen location to its nearest Voronoi cell nucleus are used as the basic cost in many networks, especially for computating functionals, such as costs, prices, etc. These models are valuable for telecommunication operators and provide many useful characteristics important from a telecommunications point of view. The important result achieved in this paper is that the estimated cost functionals from presented models are in accordance with the values computed using theoretical framework. This means that the algorithm presented in the paper can be used in modeling practice.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    stochastic geometry
    0 references
    network models, stochastic
    0 references
    graph algorithms
    0 references
    programming involving graphs in networks
    0 references
    0 references