Vicinity-based DTN Characterization

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download
Contributor : Tiphaine Phe-Neau <>
Submitted on : Wednesday, January 30, 2013 - 12:04:21 PM
Last modification on : Wednesday, December 18, 2019 - 5:24:34 PM
Long-term archiving on: Monday, June 17, 2013 - 5:27:38 PM


Files produced by the author(s)



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⟩



Record views


Files downloads