Epidemic Routing for Partially-Connected Ad Hoc Networks

By Amin Vahdat. 2009

4,535 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/2f18f645466e229a6ae70465db66a2082e074ebd

How researchers see this paper

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

Citations in the corpus

Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs (2009, methodology): “The goal of the third experiment is to evaluate the delivery performance of SimBetTS Routing protocol compared to two protocols: Epidemic Routing [51] and PRoPHET Routing [36].”
Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case (2008, background): “In these networks, intermittent connectivity might arise due to sparseness [5], [6], nodes powering down to conserve energy [1], high mobility [3], or even for covertness [2].”
Encounter: based routing in DTNs (2009, methodology): “Since there are no guarantees that a route will ever be available, many current DTN routing protocols apply epidemicstyle techniques [ 9 ], leveraging the fact that an increased number of copies of a particular message in the network should improve the probability that the message will reach its int”
DTN routing as a resource allocation problem (2007, unknown): “Proposed protocols attempt to limit replication or otherwise clear useless packets in various ways: (i) using historic meeting information to avoid replication along paths with little chance of reaching the destination [9, 18, 4, 3, 20, 21]; (ii) removing useless packets using acknowledgments of del”
Broadcasting in VANET (2007, background): “…a four-lane highway scenario; and (ii) propose three light-weight broadcast techniques; i.e., weighted p-persistence, slotted 1-persistence, and slotted p-persistence, which can provide 100% reachability in a well-connected network and up to approximately 70% reduction in the broadcast redundancy…”
The ONE simulator for DTN protocol evaluation (2009, background): “[13], Direct Transmission/Delivery [27]), others a fixed number limited by the sender [28] [26] while epidemic [30] and probabilistic [19] routing potentially create an “infinite” number of messages.”
From opportunistic networks to opportunistic computing (2010, background): “Figure 4 qualitatively shows the advantage of context awareness: partially context-aware protocols, such as Prophet [10], which use the history of encounters to calculate the probability that a node can deliver a message to a particular destination , reduce by about one order of magnitude the networ”
DV-CAST: A distributed vehicular broadcast protocol for vehicular ad hoc networks (2010, background): “Epidemic routing relies on mobile nodes to exchange the data they possess whenever they encounter new neighbors [2].”
Human mobility modeling at metropolitan scales (2012, methodology): “To that end, we developed a simulator for epidemic routing [33].”
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility (2007, background): “…a relay; whenever two nodes encounter each other, they exchange their vectors and check which messages they have in common (as in epidemic routing [12]); • if a node (either the source or a relay) carrying a message copy and n > 1 forwarding tokens for this message encounters a node with no copy…”
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.”
Prioritized epidemic routing for opportunistic networks (2007, methodology): “The transmission procedure consists of the usual epidemic exchange of missing bundles (see [18]).”
Routing in Sparse Vehicular Ad Hoc Wireless Networks (2007, background): “…virtual backbone and sensor nodes; Epidemic routing relies on mobile nodes to exchange the data they possess whenever they encounter new neighbors [17]; Rolebased multicast approach is proposed to achieve maximum reachability in a sparsely connected or fragmented network by using the…”
A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects (2013, background): “In opportunity-based schemes [3], [12], [13], nodes forward”
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks (2008, result): “proposed epidemic routing, which is similar to the “oblivio us” flooding scheme we evaluated in this paper [27].”