Subtopic Deep Dive
Opportunistic Routing Protocols
Research Guide
What is Opportunistic Routing Protocols?
Opportunistic routing protocols forward messages via transient node contacts in intermittently connected networks lacking end-to-end paths.
These protocols exploit mobility in delay-tolerant networks (DTNs) using algorithms like spray-and-wait (Spyropoulos et al., 2005, 2578 citations). Key works include epidemic routing formulations (Jain et al., 2004, 1759 citations) and social network-based forwarding (Daly and Haahr, 2007, 1148 citations). Evaluations rely on simulators like ONE (Keränen et al., 2009, 2285 citations).
Why It Matters
Opportunistic routing enables data delivery in challenged environments like mobile ad hoc networks and pocket-switched networks (Fall, 2003, 3059 citations; Hui et al., 2005, 946 citations). Spray-and-wait improves throughput by controlled message replication (Spyropoulos et al., 2005). Erasure-coding variants enhance efficiency under buffer constraints (Wang et al., 2005, 417 citations). Applications include satellite swarms (Kodheli et al., 2020, 1174 citations) and Internet of Vehicles (Ang et al., 2018, 248 citations).
Key Research Challenges
Buffer Management
Finite node buffers limit replication in opportunistic forwarding (Jain et al., 2004). Spray-and-wait addresses this by spraying fixed copies then waiting (Spyropoulos et al., 2005). Balancing copies against overflow remains critical.
Contact Prediction Accuracy
Unpredictable mobility hinders forwarding decisions (Fall, 2003). Social network analysis uses centrality for better paths (Daly and Haahr, 2007). Trace-based evaluation exposes prediction limits (Keränen et al., 2009).
Throughput Optimization
Replication floods increase overhead in sparse networks (Spyropoulos et al., 2005). Erasure-coding reduces copies while maintaining delivery (Wang et al., 2005). Simulator traces quantify trade-offs (Keränen et al., 2009).
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...
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...
Satellite Communications in the New Space Era: A Survey and Future Challenges
Oltjon Kodheli, Eva Lagunas, Nicola Maturo et al. · 2020 · IEEE Communications Surveys & Tutorials · 1.2K citations
peer reviewed
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...
Pocket switched networks and human mobility in conference environments
Pan Hui, Augustin Chaintreau, James Scott et al. · 2005 · 946 citations
Pocket Switched Networks (PSN) make use of both human mobility and local/global connectivity in order to transfer data between mobile users' devices. This falls under the Delay Tolerant Networking ...
Reading Guide
Foundational Papers
Fall (2003) for DTN architecture; Spyropoulos et al. (2005) for spray-and-wait; Jain et al. (2004) for routing formulation; Keränen et al. (2009) for ONE evaluation.
Recent Advances
Kodheli et al. (2020) for satellite applications; Ang et al. (2018) for IoV deployment challenges.
Core Methods
Spray-and-wait replication; erasure-coding forwarding (Wang et al., 2005); social graph centrality (Daly and Haahr, 2007); trace-driven simulation (Keränen et al., 2009).
How PapersFlow Helps You Research Opportunistic Routing Protocols
Discover & Search
Research Agent uses citationGraph on 'Spray and wait' (Spyropoulos et al., 2005) to map 2500+ citing works, then exaSearch for 'opportunistic routing variants' across 250M+ OpenAlex papers, and findSimilarPapers to uncover erasure-coding extensions (Wang et al., 2005).
Analyze & Verify
Analysis Agent runs readPaperContent on ONE simulator paper (Keränen et al., 2009) for protocol traces, verifies throughput claims via verifyResponse (CoVe) against cited metrics, and uses runPythonAnalysis to replot delivery ratios from extracted data with GRADE scoring for statistical significance.
Synthesize & Write
Synthesis Agent detects gaps in social routing (Daly and Haahr, 2007) vs. spray-and-wait, flags contradictions in buffer models, then Writing Agent applies latexEditText for protocol comparisons, latexSyncCitations for 10+ references, and latexCompile for camera-ready survey sections with exportMermaid for contact graphs.
Use Cases
"Reproduce ONE simulator results for spray-and-wait throughput"
Research Agent → searchPapers 'ONE simulator' → Analysis Agent → readPaperContent + runPythonAnalysis (pandas/matplotlib on trace data) → matplotlib plot of delivery ratio vs. buffer size.
"Compare opportunistic protocols in LaTeX survey"
Synthesis Agent → gap detection across Spyropoulos (2005), Jain (2004) → Writing Agent → latexEditText (table of protocols) → latexSyncCitations → latexCompile → PDF with throughput benchmarks.
"Find GitHub code for DTN routing simulators"
Research Agent → paperExtractUrls (Keränen 2009) → Code Discovery → paperFindGithubRepo → githubRepoInspect → verified ONE simulator fork with spray-and-wait implementation.
Automated Workflows
Deep Research workflow scans 50+ papers from Fall (2003) citations, structures report on routing evolution via 7-step DeepScan with CoVe checkpoints on delivery metrics. Theorizer generates hypotheses on hybrid social-spray protocols from Daly (2007) and Spyropoulos (2005), validated via runPythonAnalysis on traces.
Frequently Asked Questions
What defines opportunistic routing protocols?
Protocols that forward via transient contacts without end-to-end paths, using replication like spray-and-wait (Spyropoulos et al., 2005).
What are main methods?
Epidemic flooding (Jain et al., 2004), controlled spraying (Spyropoulos et al., 2005), social centrality (Daly and Haahr, 2007), erasure-coding (Wang et al., 2005).
What are key papers?
Fall (2003, 3059 citations) for architecture; Spyropoulos et al. (2005, 2578 citations) for spray-and-wait; Keränen et al. (2009, 2285 citations) for ONE simulator.
What open problems exist?
Predicting contacts under mobility (Fall, 2003); optimizing buffers vs. replication (Jain et al., 2004); scaling to IoV/satellites (Ang et al., 2018; Kodheli et al., 2020).
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 Opportunistic Routing Protocols 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