Probabilistic routing in intermittently connected networks

By Anders Lindgren, Avri Doria, Olov Schelén. MOCO, 2003

3,471 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/f69ce4f9703793bf2fd2bc54192aff697c606cb5

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

CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks (2009, background): “Other solutions have been proposed to tackle the problem of routing in (possibly mobile) delay-tolerant networks, based on the previous knowledge of the routes of the potential carriers [4], [5], [6] or on probabilistic approaches [7], [8].”
Survey of Important Issues in UAV Communication Networks (2016, methodology): “PROPHET, (Probabilistic Routing Protocol using History of Encounters and Transitivity), in [141] is such a protocol.”
Hybrid Satellite-Terrestrial Communication Networks for the Maritime Internet of Things: Key Technologies, Opportunities, and Challenges (2019, neutral): “Various routing methods and protocols have been proposed for terrestrial delay-tolerant ad hoc networks [148], [149], such as epidemic routing [150], probabilistic routing [151], spray”
Routing in Internet of Vehicles: A Review (2015, methodology): “It is shown that GeoSpray improves significantly the delivery probability and reduces the delivery delay, compared to other DTN routing protocols like the epidemic, Spray and Wait [42], and Probabilistic Routing Protocol using History of Encounters and Transitivity [43].”
Adaptive routing for intermittently connected mobile ad hoc networks (2005, methodology): “However, it is worth noting that, using this approach, we can dynamically incorporate new attribute values, simply by assuming that they were always there, but had zero weight for a availabilityi .”
Distributed community detection in delay tolerant networks (2007, background): “Lindgren et al. proposed PROPHET [17], which is a probability routing scheme based on the very early belief that community will help with routing decisions.”
Impact of Human Mobility on Opportunistic Forwarding Algorithms (2007, background): “It also necessitates the design of a forwarding algorithm that differentiates between nodes; some schemes of that type have been only recently proposed [17], [18], [19].”
Multicasting in delay tolerant networks: a social network perspective (2009, methodology): “Nevertheless, under various time constraints, our SDM scheme shows only 5% degradation in delivery ratio and delay, compared with Epidemic, and outperforms PROPHET by 20%.”
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].”
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case (2008, methodology): “scarce, the performance of flooding degrades significantly due to congestion [14], [23], [24].”
SLAW: A New Mobility Model for Human Walks (2009, background): “Thus, it lacks the regular patterns present in daily human walks.”
Performance modeling of epidemic routing (2006, background): “Early efforts evaluating the performance of epidemic routing schemes used simulation [13, 5, 8].”
Performance analysis of mobility-assisted routing (2006, background): “The work closest to ours in terms of mobility modelling is probably that of [24].”
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks (2008, methodology): “The patternbased Mobyspace Routing by Leguay et al. [17], location-based routing by Lebrun et al. [16], context-based forwarding by Musolesi et al. [22] and PROPHET Routing [19] fall into this category.”
Data Offloading Techniques in Cellular Networks: A Survey (2015, neutral): “[122], and Burgess et al.”
SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks (2009, background): “[13] potentially create an “infinite” number of messages.”