Evaluating MobySpace Based Routing Strategies in Delay Tolerant Networks

Jérémie Leguay 1 Timur Friedman 1 Vania Conan
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Because a delay-tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and a large-scale evaluation of routing schemes using MobySpace by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visits of nodes to each possible location. We present simulation results for single-copy and multi-copy routing strategies that use MobySpace as a means to route bundles or to control flooding. We show that routing based on MobySpace can achieve good performance compared to a number of common algorithms.
Document type :
Journal articles
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-01151813
Contributor : Lip6 Publications <>
Submitted on : Wednesday, May 13, 2015 - 4:11:10 PM
Last modification on : Thursday, August 22, 2019 - 11:00:06 AM

Links full text

istex

Identifiers

Collections

CNRS | UPMC | LIP6 | SORBONNE-UNIVERSITE | SU-SCIENCES

Citation

Jérémie Leguay, Timur Friedman, Vania Conan. Evaluating MobySpace Based Routing Strategies in Delay Tolerant Networks. Wireless Communications and Mobile Computing, Hindawi Publishing Corporation, 2007, 7 (10), pp.1171-1182. ⟨10.1002/wcm.520⟩. ⟨hal-01151813⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

126

Contact

CCSD