Skip to main content
Log in

Approximations of functionals of some modulated-Poisson Voronoi tessellations with applications to modeling of communication networks

  • Published:
Japan Journal of Industrial and Applied Mathematics Aims and scope Submit manuscript

Abstract

We consider the Voronoi tessellation of Euclidian plane that is generated by an inhomogeneous Poisson point process whose intensity takes different constant values on sets of some finite partition of the plane. We show that mean functionals of a cell with the nucleus located in a given set of the partition can be approximated by the mean functionals of the typical cell of the homogeneous Poisson Voronoi tessellation with intensity appropriate to this partitioning set. We give bounds for the approximation errors, which depend on the distance of the nucleus to the boundary of the element of the partition it belongs to. In the case of a stationary random partition, we show that mean functionals of the typical cell of the respective double-stochastic Poisson-Voronoi tessellation admit an approximate decomposition formula. The true value is approximated by a mixture of respective mean functionals for homogeneous models, while the explicit upper bound for the remaining term, which depends on the covariance functions of the random partitioning elements, can be computed numerically for a large class of practical examples. This paper complements the previous studies in [9], where the distribution of the typical cell is approximated. One of the motivations for the study in question is modeling of modern communication networks, where application of the Poisson Voronoi tessellation has already proven to give some interesting results and where the assumption of the homogeneity is often non-adequate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. Baccelli and B. Blaszczyszyn, On a coverage process ranging from the Boolean model to the Poisson—Voronoi tessellation, with applications to wireless communications. Adv. in Appl. Probab.,33 (2001), 293–323.

    MATH  MathSciNet  Google Scholar 

  2. F. Baccelli, B. Blaszczyszyn and P. Mühlethaler, An Aloha protocol for multihop mobile wireless networks. Proc. of ITC Specialist Seminar on Performance Evaluation of Wireless and Mobile Systems, Antwerp, Belgium, 2004.

    Google Scholar 

  3. F. Baccelli, B. Blaszczyszyn and F. Tournois, Spatial averages of coverage characteristics in large CDMA networks. Wireless Networks,8 (2002), 569–586.

    Article  MATH  Google Scholar 

  4. F. Baccelli, B. Blaszczyszyn and F. Tournois, Downlink capacity and admission/congestion control in CDMA networks. Proc. of IEEE INFOCOM, San Francisco, 2003.

  5. F. Baccelli, M. Klein, M. Lebourges and S. Zuyev, Géométrie aléatoire et architecture de réseaux de communication. Annales des Télécommunications,51 (1996), 158–179. (In French).

    Google Scholar 

  6. F. Baccelli, M. Klein, M. Lebourges and S. Zuyev, Stochastic geometry and architecture of communication networks. Telecommunications Systems,7 (1997), 209–227.

    Article  Google Scholar 

  7. F. Baccelli, D. Kofman and J.L. Rougier, Self organizing hierarchical multicast trees and their optimization. Proceedings of IEEE INFOCOM, New York (USA), 1999.

  8. F. Baccelli and S. Zuyev, Stochastic geometry models of mobile communication networks. Frontiers in Queueing. Models and Applications in Science and Engineering (ed. J.H. Dsha-lalow), CRC Press, Boca Raton, 1997, 227–244.

    Google Scholar 

  9. J. B. Błaszczyszyn and R. Schott, Approximate decomposition of some modulated-Poisson Voronoi tessellations. Adv. in Appl. Probab.,35 (2003), 847–862.

    Article  MATH  MathSciNet  Google Scholar 

  10. P.J. Courtois, Decomposability, Queueing and Computer System Applications. Academic Press, New York, 1977.

    MATH  Google Scholar 

  11. R. Cowan, Properties of ergodic random mosaic processes. Math. Nachr.,97 (1980), 89–102.

    Article  MATH  MathSciNet  Google Scholar 

  12. S. Farinetto and S. Zuyev, Stochastic geometry modeling of hybrid optical networks. Performance Evaluations, 2004, to appear.

  13. G. Matheron, Random Sets and Integral Geometry. John Wiley & Sons, London, 1975.

    MATH  Google Scholar 

  14. J. Mecke, Palm methods for stationary random mosaics. Combinatorial Principles in Stochastic Geometry (ed. R.V. Ambartzumian), Armenian Academy of Sciences Publ., 1980, 124–132.

  15. J. Møller, Lectures on Random Voronoi Tessellations. Lecture Notes in Statistics,87, Springer-Verlag, New York, 1989.

    Google Scholar 

  16. A. Okabe, B. Boots and K. Sugihara, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, 2000.

    MATH  Google Scholar 

  17. D. Stoyan, W. Kendall and J. Mecke, Stochastic Geometry and its Applications. Wiley, Chichester, 1995.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Bartlomiej Błaszczyszyn or René Schott.

Additional information

The work partly supported by KBN grant 2 P03A 020 23.

About this article

Cite this article

Błaszczyszyn, B., Schott, R. Approximations of functionals of some modulated-Poisson Voronoi tessellations with applications to modeling of communication networks. Japan J. Indust. Appl. Math. 22, 179–204 (2005). https://doi.org/10.1007/BF03167437

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03167437

Key words

Navigation