Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling
DOI10.1007/BF03168553zbMath1166.90005OpenAlexW2011270663MaRDI QIDQ1002494
Volker Schmidt, Hendrik Schmidt, F. Schweiggert, C. Gloaguen, Frank Fleischer
Publication date: 26 February 2009
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03168553
stochastic geometrygraph algorithmsnetwork models, stochasticprogramming involving graphs in networks
Programming involving graphs or networks (90C35) Geometric probability and stochastic geometry (60D05) Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Cites Work
- Unnamed Item
- Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
- An introduction to the theory of point processes
- Distributional properties of the typical cell of stationary iterated tessellations
- Analysis of shortest paths and subscriber line lengths in telecommunication access networks
- Approximations of functionals of some modulated-Poisson Voronoi tessellations with applications to modeling of communication networks
- On a coverage process ranging from the Boolean model to the Poisson–Voronoi tessellation with applications to wireless communications
- Radial generation of n-dimensional poisson processes
- A Problem in Geometric Probability.
- Approximate decomposition of some modulated-Poisson Voronoi tessellations
- Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks
- Superposition of planar voronoi tessellations
This page was built for publication: Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling
