.png){kind=icon}
Return
Large Connectivity for Dynamic Random Geometric Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/TMC.2009.42.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We provide the first rigorous analytical results for the connectivity of dynamic random geometric graphs-a model for mobile wireless networks in which vertices move in random directions in the unit torus. The model presented here follows the one described in [11]. We provide precise asymptotic results for the expected length of the connectivity and disconnectivity periods of the network. We believe that the formal tools developed in this work could be extended to be used in more concrete settings and in more realistic models, in the same manner as the development of the connectivity threshold for static random geometric graphs has affected a lot of research done on ad hoc networks.
Keywords:
Mobile communication systems
dynamic random geometric graphs
connectivity period
Journal
IF:
9.2
Papers:
5.8K
Citations:
1.8W
Organization
Cited Papers
Canonical and Lie-algebraic twist deformations of Carroll, para-Galilei and Static Hopf algebras
.png){kind=icon}
PREAI
ShareSaveShareSave
ShareSave
View more