Title
Large Connectivity for Dynamic Random Geometric Graphs
Abstract
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.
Year
DOI
Venue
2009
10.1109/TMC.2009.42
IEEE Trans. Mob. Comput.
Keywords
Field
DocType
mobile wireless network,realistic model,random direction,formal tool,connectivity threshold,expected length,concrete setting,disconnectivity period,dynamic random geometric graphs,dynamic random geometric graph,large connectivity,static random geometric graph,random processes,ad hoc networks,random geometric graph,communication systems,mobile ad hoc networks,graph theory,mobile communication,euclidean distance,concrete,wireless networks,ad hoc network,algorithm design and analysis,solid modeling,computational geometry
Mobile ad hoc network,Graph theory,Wireless network,Random graph,Computer science,Computational geometry,Computer network,Stochastic process,Solid modeling,Wireless ad hoc network,Distributed computing
Journal
Volume
Issue
ISSN
8
6
1536-1233
Citations 
PageRank 
References 
15
1.01
9
Authors
4
Name
Order
Citations
PageRank
Josep Díaz1489204.59
Dieter Mitsche214126.08
Xavier Pérez-Giménez3314.75
Perez-Gimenez, X.4151.01