DTN routing in a mobility pattern space

By Jérémie Leguay, Timur Friedman, Vania Conan. WDTN '05, 2005

360 citations recorded by the source corpus.

Routing in delay tolerant networks (DTNs) benefits considerably if one can take advantage of knowledge concerning node mobility. The main contribution of this paper is the definition of a generic routing scheme for DTNs using a high-dimensional Euclidean space constructed upon nodes' mobility patterns. We call this the MobySpace. One way of representing nodes in this space is to give them coordinates that correspond to their probability of being found in each possible location. We present simulation results indicating that such a scheme can be beneficial in a scenario inspired by studies done on real mobility traces. This work should open the way to further use of the virtual space formalism in DTN routing.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/32a88edabe4b7a9226c79d02b6be09dc81b61d8e

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

Evaluating Mobility Pattern Space Routing for DTNs (2005, methodology): “Meaning that they do not need to be retransmitted by nodes in the network if we assume that there are always nodes present in the network to make the information remain available to new nodes, and if we assume that the mobility patterns of nodes are stable.”
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility (2007, background): “…such situations, the performance of simple spraying schemes can suffer, as they don't take advantage of existing transmission opportunities that could potentially forward the message closer to the destination over a partial path, or to a node more " socially " related to the destination [23], [24].”
A survey of practical issues in underwater networks (2006, background): “Many approaches to discovering non-contemporaneous paths to destinations use historic information about which nodes meet regularly [51, 52, 53, 54, 55, 56].”
DTN routing as a resource allocation problem (2007, background): “Previous studies [9, 22] have suggested that DTNs among people have a skewed, power law inter-meeting time distribution.”
Delay-Tolerant Networking Architecture (2007, background): “This is an active research area, and a few approaches having been proposed [LFC05].”
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case (2008, background): “The concept of history-based or utility-based routing is further elaborated in [14], [26] and has also been studied for regular, connected networks [27].”
Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges (2013, methodology): “MobiSpace [33] constructs a high dimensional Euclidean space based on the pre-known mobility model.”
Message ferry route design for sparse ad hoc networks with mobile nodes (2006, background): “A number of routing schemes exist for DTNs [1, 3, 5, 10, 11, 14, 16, 26, 21, 23, 24, 29].”
Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case (2008, background): “Conventional Internet routing protocols (e.g., RIP, OSPF) as well as ad hoc network routing schemes, such as DSR, AODV, etc. [8], assume that a complete path exists between a source and a destination, and try to discover minimum cost paths before any useful data is sent.”
A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects (2013, background): “One step further, combining these social-based metrics with traditional opportunity-based metrics [107], [108] or other factors (such as location profile [92], [109] or mobility pattern [110], [111]) may also improve the performance in different settings.”