Title
Distributional properties of euclidean distances in wireless networks involving road systems
Abstract
Stochastic models for hierarchical telecommunication networks are considered, which can be applied to the analysis and planning of large wireless networks. The network geometry is modelled by random geometric graphs, and the locations of network nodes by point processes on the edges of these graphs. In particular, the locations of high-level components (HLC) are modeled by Cox processes concentrated on the edge sets of random graphs, where their serving zones are the cells of Voronoi tessellations induced by these Cox processes. The locations of low-level components (LLC) are either modeled by planar Poisson processes or by Cox processes concentrated on the same edge sets as the HLC. Distributional properties of distances between the locations of network nodes are closely related with the interference geometry and, consequently, the performance of wireless networks. Representation formulas are derived for the distribution function and density of the typical Euclidean connection distance between LLC and HLC. They lead to suitable estimators of these characteristics, which can be computed by Monte Carlo simulation of the typical serving zone and the typical segment system in it, respectively.
Year
DOI
Venue
2009
10.1109/JSAC.2009.090903
IEEE Journal on Selected Areas in Communications
Keywords
Field
DocType
Monte Carlo methods,computational geometry,geometry,graph theory,mobile radio,radio direction-finding,stochastic processes,telecommunication network planning,Cox processes,Euclidean distance,Monte Carlo simulation,Voronoi tessellation cell,distributional property,hierarchical telecommunication network,high-level component,interference geometry,mobile communication,network location,planar Poisson processes,random geometric graph,road system,stochastic models,wireless network planning,Point processes,Geometric modeling,Poisson processes,Monte Carlo methods,Estimation,Interference,Mobile communication,Networks
Graph theory,Wireless network,Topology,Mathematical optimization,Random graph,Computer science,Computational geometry,Point process,Euclidean distance,Real-time computing,Voronoi diagram,Random geometric graph
Journal
Volume
Issue
ISSN
27
7
0733-8716
Citations 
PageRank 
References 
10
1.22
10
Authors
4
Name
Order
Citations
PageRank
Florian Voss1193.58
Catherine Gloaguen2225.43
Frank Fleischer3141.68
Volker Schmidt4305.28