ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests
Jayesh Kataria, P.S. Dhekne, Sugata Sanyal

TL;DR
This paper proposes a non-cryptographic method to control route request flooding in reactive ad hoc routing protocols, improving network reliability and efficiency in MANETs.
Contribution
It introduces a novel approach to limit fake control packet flooding in AODV and DSR, enhancing security without cryptography.
Findings
Simulation shows improved route discovery success rate
Reduced bandwidth consumption from fake packets
Enhanced network stability and performance
Abstract
Reactive routing protocols like Ad Hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR)in Ad-Hoc Wireless Networks which are used in Mobile and Ad Hoc Networks (MANETs) work by flooding the network with control packets. There is generally a limit on the number of these packets that can be generated or forwarded. But a malicious node can disregard this limit and flood the network with fake control packets. These packets hog the limited bandwidth and processing power of genuine nodes in the network while being forwarded. Due to this, genuine route requests suffer and many routes either do not get a chance to materialize or they end up being longer than otherwise. In this paper we propose a non cryptographic solution to the above problem and prove its efficiency by means of simulation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Vehicular Ad Hoc Networks (VANETs) · Opportunistic and Delay-Tolerant Networks
