Dynamic Random Geometric Graphs
Josep Diaz, Dieter Mitsche, Xavier Perez
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.
Create a lesson
Related papers
Integrality gap preserving reductions
Koppány István Encz, Monaldo Mastrolilli, Eleonora Vercesi
Structural Parameterizations for Eternal Vertex Cover
Neeldhara Misra, Sebastian Ordyniak, Giacomo Paesani et al.
Ramsey Obstructions to Disambiguation
Romain Bourneuf, Antonin Kiladjian, Stéphan Thomassé
Two-Machine Flow Shop with a Fixed Non-Availability Interval on the Second Machine
Hao Lu, Yuan Yuan, Xingwu Liu et al.
Tournaments not inducible by five voters
Leonid Chindelevitch, Ararat Harutyunyan
Oblivious Self-Distance Symmetric Rendezvous on the Integer Line
Konstantinos Georgiou, Claude Gravel, Lazar Mandic et al.