Evaluating Mobility Pattern Space Routing for DTNs

By Jérémie Leguay, Timur Friedman, Vania Conan. Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, 2005

374 citations recorded by the source corpus.

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 this routing scheme in the context of ambient networking by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visits of nodes to each possible location. We show that routing based on MobySpace can achieve good performance compared to that of a number of standard algorithms, especially for nodes that are present in the network a large portion of the time. We determine that the degree of homogeneity of node mobility patterns has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/7c33de0d33f961816b1e6f5e14572174f896a945

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Impact of Human Mobility on Opportunistic Forwarding Algorithms (2007, background): “It also necessitates t o design a forwarding algorithm that differentiate between nodes; some schemes of that type have been only recently proposed [17], [18], [19].”
Social network analysis for routing in disconnected delay-tolerant MANETs (2007, background): “[21] present a virtual coordinate system where the node coordinates are composed of a set of probabilities, each representing the chance that a node will be found in a specific location.”
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks (2008, neutral): “[30], location-based routing by Lebrun et al.”
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications (2008, background): “And, we are all familiar with detecting zebra-tozebra encounters [14], tracking networking researcher interactions [12], and logging hiker sightings after their trail-side encounters with other hikers [10].”
Distributed community detection in delay tolerant networks (2007, background): “…many other varied schemes such as the adaptive routing [20] by Musolesi et al. , the practical routing scheme [14] by Jones et al. and Mobyspace [15] by Leguay et al. , these are all examples of how to use system and mobility information to improve the efﬁciency of routing and forwarding from…”
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks (2006, background): “In MobySpace Routing [17] the nodes' mobility pattern is the context information used for routing.”
A parsimonious model of mobile partitioned networks with clustering (2009, background): “, preferred locations for particular nodes, or encounter frequencies between specific pairs of nodes), which appears to be an implicit or explicit assumption built into many routing protocols [15], [31].”
CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks (2009, methodology): “CAR has inspired the design of other protocols based on the study of mobility patterns, such as [32], where different metrics for the evaluation of host colocation are taken into the consideration for the selection of the best carriers, and [33], where machine learning techniques are applied to extr”
Practical Routing in Delay-Tolerant Networks (2005, background): “presented a strategy that uses a virtual coordinate system [25], so the measure of “closeness” represents the probability that the nodes will come into contact with each other.”
The ONE simulator for DTN protocol evaluation (2009, background): “Predictive protocols such as PRoPHET [19] use past encounters of nodes to predict their future suitability to deliver messages to a certain target whereas other protocols also exploit further (explicitly configured) schedule and context information per node [18].”
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs (2009, background): “[31] present a virtual coordinate system where the node coordinates are composed of a set of probabilities, eac h representing the chance that a node will be found in a specific location.”