Vicinity-based DTN Characterization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Vicinity-based DTN Characterization

Résumé

We relax the traditional definition of contact and intercontact times by bringing the notion of vicinity into the game. We propose to analyze disruption-tolerant networks (DTN) under the assumption that nodes are in k-contact when they remain within a few hops from each other and in k-intercontact otherwise (where k is the maximum number of hops characterizing the vicinity). We make interesting observations when analyzing several real-world and synthetic mobility traces. We detect a number of unexpected behaviors when analyzing k-contact distributions; in particular, we observe that in some datasets the average k-contact time decreases as we increase k. In fact, we observe that many nodes spend a non-negligible amount of time in each other's vicinity without coming into direct contact. We also show that a small k (typically between 3 and 4) is sufficient to capture most communication opportunities.
Fichier principal
Vignette du fichier
pheneau.mobiopp12.pdf (628.69 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00782636 , version 1 (30-01-2013)

Identifiants

Citer

Tiphaine Phe-Neau, Marcelo Dias de Amorim, Vania Conan. Vicinity-based DTN Characterization. The Third International Workshop on Mobile Opportunistic Networks (MobiOpp '12), Mar 2012, Zurich, Switzerland. pp.37-44, ⟨10.1145/2159576.2159586⟩. ⟨hal-00782636⟩
458 Consultations
186 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More