MobySpace: Mobility Pattern Space Routing for DTNs - Sorbonne Université Accéder directement au contenu
Poster De Conférence Année : 2005

MobySpace: Mobility Pattern Space Routing for DTNs

Résumé

Problem: • Routing is a challenge in DTNs (Delay Tolerant Networks). Regular ad- hoc routing protocols fail because the topology suffers from connectivity disruptions. Proposition: • We propose to use mobility patterns of nodes, i.e. regularities in nodes contacts or movements, to define their position in a virtual Euclidean space used for routing. This space is called the MobySpace. • Each node’s position in the MobySpace (its MobyPoint) is flooded throughout the network. Other nodes use this information for routing. • To route a bundle, a node chooses among its physical neighbors. It passes the bundle to the neighbor whose MobyPoint is closest to the destination’s. • The MobySpace can be defined in many ways, e.g. type/number of dimensions, distance function. This poster describes preliminary work.
Fichier principal
Vignette du fichier
leguay2005mobyspace0 copy.pdf (111.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01500500 , version 1 (03-04-2017)

Identifiants

  • HAL Id : hal-01500500 , version 1

Citer

Jérémie Leguay, Timur Friedman, Vania Conan. MobySpace: Mobility Pattern Space Routing for DTNs. ACM SIGCOMM Conference, Aug 2005, Philadelphia, United States. ⟨hal-01500500⟩
420 Consultations
90 Téléchargements

Partager

Gmail Facebook X LinkedIn More