Comparison of Network Trees in Deterministic and Random Settings using Different Connection Rules

We examine the spatial distribution of network trees, i.e., shortest paths between network devices of different hierarchical levels placed randomly along an underlying infrastructure system. In particular, based on a simulation approach, we analyze the distributional behavior of the network trees obtained through two alternative connection rules. Moreover, we validate by visual comparison that the distributions of these network trees can be regarded as rather similar both in the case where the underlying infrastructure system is based on real road data and in the case where this system is based on a random tessellation model fitted to the real road data. Our study demonstrates that modeling telecommunication networks and the associated mobility along the infrastructure by usage of methods and models from stochastic geometry is feasible from the engineering point of view.