Evaluating MobySpace Based Routing Strategies in Delay Tolerant Networks - Université Pierre et Marie Curie Accéder directement au contenu
Article Dans Une Revue Wireless Communications and Mobile Computing Année : 2007

Evaluating MobySpace Based Routing Strategies in Delay Tolerant Networks

Jérémie Leguay
  • Fonction : Auteur
  • PersonId : 966430
Timur Friedman
Vania Conan
  • Fonction : Auteur

Résumé

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.

Dates et versions

hal-01151813 , version 1 (13-05-2015)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More