Adaptive routing for intermittently connected mobile ad hoc networks

By Mirco Musolesi, S. Hailes, Cecilia Mascolo. Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks, 2005

465 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/16699f9e2ed3964f6fb15a420edcede2b09c962f

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): “[31] have introduced a generic method that uses Kalman filters to combine and evaluate the multiple dimensions of the context in which nodes are in order to take routing decisions.”
HiBOp: a History Based Routing Protocol for Opportunistic Networks (2007, background): “For the sake of space, in this section we only mention Epidemic Routing [11], PROPHET [5], and CAR [7], which are representative of three fundamental approaches to routing in opportunistic networks.”
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks (2008, background): “[32] and PROPHET Routing [5] fall into this category.”
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks (2008, methodology): “However, CAR is a unicast delay tolerant routing protocol and it does not support group communication.”
A community based mobility model for ad hoc network research (2006, background): “These indicators are particularly important in ad hoc networking and, in particular, in opportunistic mobile networks, such as delay tolerant mobile ad hoc networks [26, 20]: inter-contacts times define the”
Practical Routing in Delay-Tolerant Networks (2005, background): “A theoretical analysis of gradient routing can be found in [42], and a discussion about predicting utility function values can be found in [32].”
Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges (2006, methodology): “CAR [ 28 ] Infinite Yes, Kilman filter No Integrate with DSDV Computation 2005”
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks (2006, background): “In the Context-Aware Routing (CAR) protocol [16] each node in the network is in charge of producing its own delivery probabilities towards each known destination host.”
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs (2009, methodology): “[41] introduce a generic method that uses Kalman filters to combine multiple dimensions of a node’s connectivity context in order to make routing decisions.”
Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges (2012, background): “In the case of stochastic DTNs, [49]− [51], [56]− [76], determination of connectivity and even predictability is quite challenging.”
Distributed community detection in delay tolerant networks (2007, background): “There are also many other varied schemes such as the adaptive routing [21] by Musolesi et al, the practical routing scheme by Jones et al and Mobyspace by Leguay et al, these are all examples of how to use system and mobility information to improve the efficiency of routing and forwarding from “obli”
DTN routing in a mobility pattern space (2005, methodology): “The main contribution of this paper is the use, for routing in DTNs, of the formalism of a high-dimensional Euclidean space based on nodes’ mobility patterns.”
Designing mobility models based on social network theory (2007, background): “CM speed=[1-6] m/s CM speed=[1-10] m/s CM speed=[1-20] m/s Intel traces”
A parsimonious model of mobile partitioned networks with clustering (2009, background): “For this reason, many existing DTN routing algorithms exploit only one-hop communication [1], [12], [15], [17], [28], [27], [29], [32], with the exception of [19], [21], [24], [6].”