Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling
type: Item
instance of: scholarly article
title: Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling
zbMATH Open document ID: 1166.90005
DOI: 10.1007/BF03168553
author: Catherine Gloaguen
author: Hendrik Schmidt
author: Volker Schmidt
author: F. Schweiggert
author: Frank Fleischer
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2009-02-26T00:00:00Z
review text: 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.
reviewed by: Jerzy Martyna
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 60D05
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5519704
zbMATH Keywords: stochastic geometry
zbMATH Keywords: network models, stochastic
zbMATH Keywords: graph algorithms
zbMATH Keywords: programming involving graphs in networks
MaRDI profile type: Publication
cites work: On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation with applications to wireless communications
cites work: Superposition of planar voronoi tessellations
cites work: Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks
cites work: Approximate decomposition of some modulated-Poisson Voronoi tessellations
cites work: Approximations of functionals of some modulated-Poisson Voronoi tessellations with applications to modeling of communication networks
cites work: An introduction to the theory of point processes
cites work: Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
cites work: Analysis of shortest paths and subscriber line lengths in telecommunication access networks
cites work: Distributional properties of the typical cell of stationary iterated tessellations
cites work: Radial generation of n-dimensional poisson processes
cites work: Q4842952
cites work: A Problem in Geometric Probability.
full work available at URL: https://doi.org/10.1007/bf03168553
OpenAlex ID: W2011270663
description: scientific article; zbMATH DE number 5519704