Computer Science – Discrete Mathematics
Scientific paper
2007-02-13
Computer Science
Discrete Mathematics
Scientific paper
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.
Diaz Josep
Mitsche Dieter
Perez Xavier
No associations
LandOfFree
Dynamic Random Geometric Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dynamic Random Geometric Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Random Geometric Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-409497