Subtopic Deep Dive
Routing Protocols in MANETs
Research Guide
What is Routing Protocols in MANETs?
Routing protocols in MANETs are algorithms for discovering and maintaining multi-hop paths between mobile nodes in self-organizing networks without fixed infrastructure.
These protocols classify into reactive types like AODV and DSR that discover routes on-demand (Perkins et al., 2001; Johnson et al., 2007), proactive types like DSDV that maintain routing tables continuously, and hybrid approaches. Key metrics include packet delivery ratio, routing overhead, and scalability in dynamic topologies. Over 10 highly cited papers from 2000-2007 analyze performance via simulations.
Why It Matters
Efficient routing ensures reliable communication in MANETs for disaster response where infrastructure fails and military operations requiring rapid deployment. Perkins et al. (2001) showed AODV outperforms DSR in high-mobility scenarios with 20-30% better delivery ratios. Marti et al. (2000) demonstrated watchdog and pathrater techniques increase throughput by 60% against selfish nodes, enabling secure tactical networks. De Couto et al. (2003) ETX metric improves multi-hop throughput by 30-200% over minimum-hop counts in real testbeds.
Key Research Challenges
High Routing Overhead
Reactive protocols flood route requests, consuming 40-50% bandwidth in dense networks (Perkins et al., 2001). Proactive protocols generate control traffic every few seconds regardless of traffic load. Hybrid protocols balance this but increase state complexity.
Mobility-Induced Instability
Frequent topology changes cause route breaks every 10-30 seconds at 20m/s speeds (Johnson et al., 2007). Link breakage detection lags by multiple hops in DSR. Geographic protocols like GLS mitigate via location services but fail without GPS (Li et al., 2000).
Selfish Node Misbehavior
Nodes drop packets to conserve energy, reducing network throughput by 30-70% (Marti et al., 2000). Reputation systems like CORE detect via observation but incur 15% overhead (Michiardi and Molva, 2002). CONFIDANT protocol isolates misbehaving nodes but requires trusted friends lists (Buchegger and Le Boudec, 2002).
Essential Papers
Mitigating routing misbehavior in mobile ad hoc networks
Sergio Marti, TJ Giuli, Kevin Lai et al. · 2000 · 3.4K citations
This paper describes two techniques that improve throughput in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so. To mitigate this problem, we propose categ...
A high-throughput path metric for multi-hop wireless routing
Douglas S. J. De Couto, Daniel Aguayo, John Bicket et al. · 2003 · 3.4K citations
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX mini-mizes the expected total number of packet transmissions ...
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...
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...
A scalable location service for geographic ad hoc routing
Jinyang Li, John Jannotti, Douglas S. J. De Couto et al. · 2000 · 1.6K citations
GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number...
Core: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks
Pietro Michiardi, Refik Molva · 2002 · IFIP advances in information and communication technology · 1.6K citations
The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4
David B. Johnson, Y. Charlie Hu, David A. Maltz · 2007 · 1.5K citations
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes.DSR allows the network to be...
Reading Guide
Foundational Papers
Start with Perkins et al. (2001) for AODV-DSR baseline comparison (1497 citations), then Marti et al. (2000) for security (3428 citations), and Johnson et al. (2007) DSR spec (1508 citations) to understand protocol mechanics.
Recent Advances
Study De Couto et al. (2003) ETX metric (3354 citations) for throughput optimization, Spyropoulos et al. (2005) Spray and Wait (2578 citations) for DTN extensions, and Li et al. (2000) GLS (1631 citations) for geographic routing.
Core Methods
Route discovery via RREQ/RREP flooding (AODV), source routing caches (DSR), ETX expected transmission count minimization, geographic hashing (GLS), watchdog monitoring for misbehavior, epidemic spraying for disconnection tolerance.
How PapersFlow Helps You Research Routing Protocols in MANETs
Discover & Search
Research Agent uses searchPapers('routing protocols MANET AODV DSDV performance') to retrieve Perkins et al. (2001) with 1497 citations, then citationGraph reveals Marti et al. (2000) as most-cited security paper with 3428 citations, and findSimilarPapers expands to ETX variants by De Couto et al. (2003). exaSearch handles sparse DTN routing like Spray and Wait (Spyropoulos et al., 2005).
Analyze & Verify
Analysis Agent runs readPaperContent on Perkins et al. (2001) to extract AODV simulation parameters, verifyResponse with CoVe cross-checks claims against Johnson et al. (2007) DSR metrics, and runPythonAnalysis replots delivery ratio curves using NumPy for 10-50 node scenarios. GRADE grading scores ETX improvements in De Couto et al. (2003) as A-grade with 3354 citations.
Synthesize & Write
Synthesis Agent detects gaps in selfish node handling beyond Marti et al. (2000), flags contradictions between proactive overhead claims, and uses exportMermaid for AODV-DSR comparison flowcharts. Writing Agent applies latexEditText to format protocol tables, latexSyncCitations links 10 papers, and latexCompile generates IEEE-formatted reviews.
Use Cases
"Compare AODV vs DSR packet delivery ratio vs mobility speed from simulations"
Research Agent → searchPapers + citationGraph → Analysis Agent → readPaperContent(Perkins 2001) + runPythonAnalysis(replot ns-2 data with pandas/matplotlib) → researcher gets CSV curves showing AODV superior above 10m/s.
"Write LaTeX survey section on MANET routing protocol taxonomy with citations"
Synthesis Agent → gap detection on 3428-cite Marti et al. → Writing Agent → latexEditText(structure reactive/proactive/hybrid) → latexSyncCitations(10 papers) → latexCompile → researcher gets PDF-ready section with ETX diagram.
"Find GitHub repos implementing AODV or ETX for MANET simulators"
Research Agent → paperExtractUrls(Johnson 2007 DSR) → Code Discovery → paperFindGithubRepo → githubRepoInspect → researcher gets ns-3 AODV fork with 500+ stars and setup instructions.
Automated Workflows
Deep Research workflow scans 50+ MANET papers via searchPapers, structures comparison tables of AODV/DSR/DSDV metrics from Perkins et al. (2001), and outputs GRADE-verified report. DeepScan applies 7-step CoVe to validate ETX throughput claims (De Couto et al., 2003) against real-world testbeds. Theorizer generates hybrid protocol hypotheses combining Spray-and-Wait replication with GLS location services.
Frequently Asked Questions
What defines reactive vs proactive MANET routing protocols?
Reactive protocols like AODV and DSR discover routes on-demand via flooding (Perkins et al., 2001; Johnson et al., 2007). Proactive protocols like DSDV maintain full tables via periodic updates. Reactives save overhead in low-traffic but suffer latency.
What are key methods in MANET routing?
On-demand flooding (AODV/DSR), table-driven updates (DSDV), geographic forwarding (GLS by Li et al., 2000), path metrics (ETX by De Couto et al., 2003), and epidemic routing (Spray and Wait by Spyropoulos et al., 2005). Evaluations use ns-2/ns-3 simulators.
What are the most cited papers on MANET routing?
Marti et al. (2000) on misbehavior mitigation (3428 citations), De Couto et al. (2003) ETX metric (3354 citations), Spyropoulos et al. (2005) Spray and Wait (2578 citations), Perkins et al. (2001) AODV-DSR comparison (1497 citations).
What open problems remain in MANET routing?
Scalability beyond 100 nodes, energy-efficient routing under 10% duty cycles, quantum-resistant security against selfish coalitions, and AI-optimized paths incorporating ETX with ML predictions. Reputation overhead exceeds 20% in CORE/CONFIDANT (Michiardi 2002; Buchegger 2002).
Research Mobile Ad Hoc 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 Routing Protocols in MANETs 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
Part of the Mobile Ad Hoc Networks Research Guide