Dynamic Random Geometric Graphs
read the original abstract
In this work we introduce Dynamic Random Geometric Graphs as a basic rough model for mobile wireless sensor networks, where communication distances are set to the known threshold for connectivity of static random geometric graphs. We provide precise asymptotic results for the expected length of the connectivity and disconnectivity periods of the network. We believe the formal tools developed in this work could be of use in future studies in more concrete settings. In addition, for static random geometric graphs at the threshold for connectivity, we provide asymptotic expressions on the probability of existence of components according to their sizes.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Seasonal Statistics of Shannon Capacity in a Dynamical Poisson-Voronoi Cellular Network
Analysis of Shannon capacity statistics at handover, proximity, and interference epochs in a dynamical Poisson-Voronoi network with an analogy to seasonal fluctuations in signal quality.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.