NDTAODV: Neighbor Defense Technique for Ad Hoc On-Demand Distance Vector(AODV) to mitigate flood attack in MANETS
Akshai Aggarwal, Savita Gandhi, Nirbhay Chaubey, Naren Tada, Srushti, Trivedi

TL;DR
This paper introduces NDTAODV, a neighbor defense technique that enhances the security of AODV routing in MANETs by mitigating flood attacks through timers, peak values, and alarm mechanisms, validated via NS-2 simulations.
Contribution
The paper proposes a novel neighbor-based defense mechanism, NDTAODV, to secure AODV against flood attacks, improving robustness in MANET routing protocols.
Findings
NDTAODV reduces packet loss during flood attacks.
The proposed method improves throughput under attack conditions.
NDTAODV maintains higher packet delivery ratios than standard AODV.
Abstract
Mobile Ad Hoc Networks (MANETs) are collections of mobile nodes that can communicate with one another using multihop wireless links. MANETs are often deployed in the environments, where there is no fixed infrastructure and centralized management. The nodes of mobile ad hoc networks are susceptible to compromise. In such a scenario, designing an efficient, reliable and secure routing protocol has been a major challengesue over the last many years. The routing protocol Ad hoc On-demand Distance Vector (AODV) has no security measures in-built in it. It is vulnerable to many types of routing attacks. The flood attack is one of them. In this paper, we propose a simple and effective technique to secure Ad hoc Ondemand Distance Vector (AODV) routing protocol against flood attacks. To deal with a flood attack, we have proposed Neighbor Defense Technique for Ad hoc On-demand Distance Vector…
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.
