No abstract

One way to model telecommunication networks are static Boolean models. However, dynamics such as node mobility have a significant impact on the performance evaluation of such networks. Consider a Boolean model in $\mathbb {R}^d$ and a random direction movement scheme. Given a fixed time horizon $T>0$ , we model these movements via cylinders in $\mathbb {R}^d \times [0,T]$ . In this work, we derive central limit theorems for functionals of the union of these cylinders. The volume and the number of isolated cylinders and the Euler characteristic of the random set are considered and give an answer to the achievable throughput, the availability of nodes, and the topological structure of the network.

One way to model telecommunication networks are static Boolean models. However, dynamics such as node mobility have a significant impact on the performance evaluation of such networks. Consider a Boolean model in R d and a random direction movement scheme. Given a fixed time horizon T > 0, we model these movements via cylinders in R d × [0, T ]. In this work, we derive central limit theorems for functionals of the union of these cylinders. The volume and the number of isolated cylinders and the Euler characteristic of the random set are considered and give an answer to the achievable throughput, the availability of nodes, and the topological structure of the network.

No abstract