Dynamic Random Geometric Graphs

Simple item page
dc.creatorDiaz, Josep
dc.creatorMitsche, Dieter
dc.creatorPerez, Xavier
dc.date2007-02-13
dc.date2007-04-20
dc.date.accessioned2026-07-07T07:57:24Z
dc.date.available2026-07-07T07:57:24Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0702074
dc.identifierhttp://arxiv.org/abs/cs/0702074
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127635
dc.subjectDiscrete Mathematics
dc.titleDynamic Random Geometric Graphs
dc.typetext

Files

Collections

arXiv