Subtopic Deep Dive
Epidemic Routing Algorithms
Research Guide
What is Epidemic Routing Algorithms?
Epidemic routing algorithms use probabilistic flooding to disseminate messages in opportunistic and delay-tolerant networks where end-to-end paths are absent.
Epidemic routing replicates messages to all contacts until delivery or TTL expiry, serving as a baseline for DTN protocols (Fall, 2003; 3059 citations). Binary variants flood copies unchecked, while controlled schemes like Spray and Wait limit replicas for efficiency (Spyropoulos et al., 2005; 2578 citations). Over 10 key papers analyze scalability in sparse mobile networks.
Why It Matters
Epidemic routing provides delivery ratio and latency benchmarks for DTN protocols in challenged environments like rural mobile networks and space communications (Fall, 2003). Spray and Wait reduces overhead by 50-70% over pure flooding while maintaining high delivery, enabling practical deployment in intermittently connected MANETs (Spyropoulos et al., 2005). The ONE simulator standardizes evaluations, with 2285 citations across routing studies (Keränen et al., 2009). Controlled epidemic variants underpin social routing and multicasting advances (Daly and Haahr, 2007; Gao et al., 2009).
Key Research Challenges
Buffer Overflow Management
Finite node buffers cause message drops during uncontrolled flooding, degrading delivery ratios (Jain et al., 2004). Spray and Wait addresses this by pre-allocating L copies per message, but optimal L selection remains environment-dependent (Spyropoulos et al., 2005). Analysis shows 20-40% drop reductions with quota controls.
Scalability Under Density Variation
Replication storms exhaust bandwidth in high-density scenarios, while sparse networks suffer low delivery (Zhang, 2006). Adaptive dissemination tunes flood rates based on contact history, yet requires accurate mobility models (Heinzelman et al., 1999). ONE simulations reveal 2-5x latency variance across traces (Keränen et al., 2009).
Energy Consumption Control
Continuous broadcasting drains batteries in sensor and mobile DTNs, limiting lifetime to hours (Heinzelman et al., 1999). Erasure coding trades storage for 30% energy savings by chunking messages (Wang et al., 2005). Balancing replication with power constraints needs dynamic thresholding.
Essential Papers
A delay-tolerant network architecture for challenged internets
Kevin Fall · 2003 · 3.1K citations
The highly successful architecture and protocols of today's Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are ex...
Spray and wait
Thrasyvoulos Spyropoulos, Konstantinos Psounis, C.S. Raghavendra · 2005 · 2.6K citations
Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the ge...
Adaptive protocols for information dissemination in wireless sensor networks
Wendi Heinzelman, Joanna Kulik, Hari Balakrishnan · 1999 · 2.3K citations
Article Free Access Share on Adaptive protocols for information dissemination in wireless sensor networks Authors: Wendi Rabiner Heinzelman Massachusetts Institute of Technology, Cambridge, MA Mass...
The ONE simulator for DTN protocol evaluation
Ari Keränen, Jörg Ott, Teemu Kärkkäinen · 2009 · 2.3K citations
Delay-tolerant Networking (DTN) enables communication in sparse mobile ad-hoc networks and other challenged environments where traditional networking fails and new routing and application protocols...
Routing in a delay tolerant network
Sushant Jain, Kevin Fall, Rabin Patra · 2004 · 1.8K citations
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. Th...
Social network analysis for routing in disconnected delay-tolerant MANETs
Elizabeth Daly, Mads Haahr · 2007 · 1.1K citations
Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide goo...
Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges
Zhensheng Zhang · 2006 · IEEE Communications Surveys & Tutorials · 814 citations
Recently there has been much research activity in the emerging area of intermittently connected ad hoc networks and delay/disruption tolerant networks (DTN). There are different types of DTNs, depe...
Reading Guide
Foundational Papers
Start with Fall (2003) for DTN architecture and epidemic baseline (3059 citations), then Spyropoulos et al. (2005) for controlled Spray and Wait (2578 citations), and Keränen et al. (2009) for ONE simulator validation (2285 citations).
Recent Advances
Study Daly and Haahr (2007, 1148 citations) for social enhancements to epidemic routing; Gao et al. (2009, 544 citations) extends to multicasting; Wang et al. (2005, 417 citations) adds erasure coding.
Core Methods
Probabilistic flooding (binary/controlled), replica quotas (Spray and Wait), TTL expiry, evaluated via ONE simulator traces and contact graphs (Fall 2003; Spyropoulos 2005; Keränen 2009).
How PapersFlow Helps You Research Epidemic Routing Algorithms
Discover & Search
Research Agent uses citationGraph on Fall (2003) to map 3059-cited DTN foundations, then findSimilarPapers for epidemic variants like Spray and Wait (Spyropoulos et al., 2005). exaSearch queries 'epidemic routing buffer optimization DTN' retrieves Zhang (2006) overview with 814 citations. searchPapers('controlled epidemic routing') surfaces 10+ controlled flooding papers.
Analyze & Verify
Analysis Agent runs readPaperContent on Spyropoulos et al. (2005) to extract Spray and Wait pseudocode, then verifyResponse with CoVe against ONE simulator claims (Keränen et al., 2009). runPythonAnalysis replays delivery ratio plots from Jain et al. (2004) using NumPy/pandas on extracted data, earning GRADE A for statistical match. Verifies 2578-citation impact metrics.
Synthesize & Write
Synthesis Agent detects gaps in buffer management across Fall (2003) and Spyropoulos et al. (2005), flagging adaptive quota needs. Writing Agent uses latexEditText to draft epidemic comparison tables, latexSyncCitations for 10-paper bibliography, and latexCompile for camera-ready review. exportMermaid generates DTN routing state diagrams.
Use Cases
"Compare delivery ratios of epidemic vs Spray and Wait in ONE simulator traces"
Research Agent → searchPapers + citationGraph (Fall 2003, Spyropoulos 2005, Keränen 2009) → Analysis Agent → runPythonAnalysis (pandas plot of ratios from 3 papers) → matplotlib delivery curve graph with 95% CI.
"Write LaTeX section on epidemic routing challenges with citations"
Synthesis Agent → gap detection (buffer/energy from Jain 2004, Heinzelman 1999) → Writing Agent → latexEditText + latexSyncCitations (10 papers) → latexCompile → PDF with tables and Fall (2003) intro quote.
"Find GitHub code for epidemic routing simulators"
Research Agent → searchPapers('epidemic routing ONE') → Code Discovery → paperExtractUrls (Keränen 2009) → paperFindGithubRepo → githubRepoInspect → working ONE v1.9.2 fork with epidemic module.
Automated Workflows
Deep Research scans 50+ DTN papers via citationGraph from Fall (2003), structures epidemic baseline report with delivery/latency tables. DeepScan applies 7-step CoVe to verify Spyropoulos et al. (2005) claims against ONE traces (Keränen et al., 2009), checkpointing stats. Theorizer generates buffer quota theory from Jain et al. (2004) constraints.
Frequently Asked Questions
What defines epidemic routing?
Epidemic routing floods message copies to all contacts in DTNs, mimicking disease spread for eventual delivery (Fall, 2003).
What are main epidemic variants?
Binary floods unchecked; Spray and Wait sprays L copies then waits, cutting overhead 50-70% (Spyropoulos et al., 2005).
Name key papers on epidemic routing.
Fall (2003, 3059 citations) introduces DTN architecture; Spyropoulos et al. (2005, 2578 citations) proposes Spray and Wait; Keränen et al. (2009, 2285 citations) provides ONE simulator.
What are open problems in epidemic routing?
Optimal replica quotas under varying density, energy-adaptive flooding, and integration with social metrics remain unsolved (Zhang, 2006; Daly and Haahr, 2007).
Research Opportunistic and Delay-Tolerant Networks with AI
PapersFlow provides specialized AI tools for Computer Science researchers. Here are the most relevant for this topic:
AI Literature Review
Automate paper discovery and synthesis across 474M+ papers
Code & Data Discovery
Find datasets, code repositories, and computational tools
Deep Research Reports
Multi-source evidence synthesis with counter-evidence
AI Academic Writing
Write research papers with AI assistance and LaTeX support
See how researchers in Computer Science & AI use PapersFlow
Field-specific workflows, example queries, and use cases.
Start Researching Epidemic Routing Algorithms with AI
Search 474M+ papers, run AI-powered literature reviews, and write with integrated citations — all in one workspace.
See how PapersFlow works for Computer Science researchers