Fitting of stochastic telecommunication network models via distance measures and Monte–Carlo tests

We explore real telecommunication data describing the spatial geometrical structure of an urban region and we propose a model fitting procedure, where a given choice of different non-iterated and iterated tessellation models is considered and fitted to real data. This model fitting procedure is based on a comparison of distances between characteristics of sample data sets and characteristics of different tessellation models by utilizing a chosen metric. Examples of such characteristics are the mean length of the edge-set or the mean number of vertices per unit area. In particular, after a short review of a stochastic-geometric telecommunication model and a detailed description of the model fitting algorithm, we verify the algorithm by using simulated test data and subsequently apply the procedure to infrastructure data of Paris.

[1]  D. Stoyan,et al.  Fractals, random shapes and point fields : methods of geometrical statistics , 1996 .

[2]  Konstantin Tchoumatchenko,et al.  Aggregate and fractal tessellations , 2001 .

[3]  Peihua Qiu,et al.  Statistical Analysis of Microstructures in Materials Science , 2002, Technometrics.

[4]  B. Hambly.  Fractals, random shapes, and point fields , 1994 .

[5]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[6]  F. Baccelli,et al.  On a coverage process ranging from the Boolean model to the Poisson–Voronoi tessellation with applications to wireless communications , 2001, Advances in Applied Probability.

[7]  François Baccelli,et al.  Géométrie aléatoire et architecture de réseaux , 1996 .

[8]  Volker Schmidt,et al.  Simulation of typical Cox–Voronoi cells with a special regard to implementation tests , 2005, Math. Methods Oper. Res..

[9]  François Baccelli,et al.  Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks , 1999, Oper. Res..

[10]  F. Baccelli,et al.  Superposition of planar voronoi tessellations , 2000 .

[11]  Bartomiej Baszczyszyn,et al.  On a Coverage Process Ranging from the Boolean Model to the Poisson Voronoi Tessellation , 2000 .

[12]  Adrian Baddeley,et al.  Stereology for Statisticians , 2004 .

[13]  Volker Schmidt,et al.  A unified simulation framework for spatial stochastic models , 2004, Simul. Model. Pract. Theory.

[14]  Pierre Soille,et al.  Morphological Image Analysis: Principles and Applications , 2003 .

[15]  J. Møller.  Random tessellations in ℝ d , 1989, Advances in Applied Probability.

[16]  Jean-Louis Rougier,et al.  Self organizing hierarchical multicast trees and their optimization , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[17]  Kristel Michielsen,et al.  Morphological image analysis , 2000 .

[18]  Central limit theorems for Poisson hyperplane tessellations , 2006, math/0607120.

[19]  V. Schmidt,et al.  Stationary iterated tessellations , 2003, Advances in Applied Probability.

[20]  T. Mattfeldt.  Stochastic Geometry and Its Applications , 1996 .

[21]  Volker Schmidt,et al.  Distributional properties of the typical cell of stationary iterated tessellations , 2004, Math. Methods Oper. Res..