Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks

Abstract : We define a family of random trees in the plane. Their nodes of level $k, k=0\thru m$ are the points of a homogeneous Poisson point process $\Pi_k$, whereas their arcs connect nodes of level $k$ and $k+1$, according to the least distance principle: if $V$ denotes the Voronoi cell w.r.t. $\Pi_k+1$ with nucleus $x$, where $x$ is a point of $\Pi_k+1$, then there is an arc connecting $x$ to all the points of $\Pi_k$ which belong to $V$. This creates a family of stationary random trees rooted in the points of $\Pi_m$. These random trees are useful to model the spatial organization of several types of hierarchical communication networks. In relation with these communication networks, it is natural to associate various cost functions with such random trees. Using point process techniques, like the exchange formula between two Palm measures, and integral geometry techniques, we show how to compute the average cost in function of the intensity parameters of the Poisson processes. The formulas which are derived for the average value of the cost function are then exploited for parametric optimization purposes.
Type de document :
Rapport
RR-3040, INRIA. 1996
Liste complète des métadonnées

https://hal.inria.fr/inria-00073653
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:25:10
Dernière modification le : samedi 27 janvier 2018 - 01:31:29
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:53:43

Fichiers

Identifiants

  • HAL Id : inria-00073653, version 1

Collections

Citation

François Baccelli, Sergei Zuyev. Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks. RR-3040, INRIA. 1996. 〈inria-00073653〉

Partager

Métriques

Consultations de la notice

213

Téléchargements de fichiers

378