An Approach for Rushing Attack Resolution in AOMDV Using Arbitrary Id in Manet

Abstract

Mobile ad-hoc network (MANET) is a collection of mobile nodes connected by wireless links and that forward information from one node to other node without a wired connection. Since there is no central authority responsible for routing packets, the security of communication is dependent only on mutual trust between nodes. This leads MANET to be vulnerable to different attacks. Rushing Attack is among one of the existing MANET attacks that results in denial-of-service (DoS) against all on-demand ad hoc network routing protocols. It uses the duplicate suppression mechanism thus the response time of the malicious node is extremely fast and can send a route discovery to the sender, and gain access on the forwarding data. The attackers can rush the route request packets in many ways such as removing MAC (media access control) and network delays in packet transmission. In this research, we propose Multipath-AODV (AOMDV) protocol, and deploy rushing attack prevention method in route discovery phase.  It enhances the security features of AOMDV protocol. This research provides solution for rushing attack using Rushing Attack prevention (RAP) method for AOMDV protocol.

 RAP uses the concept of average delay value, collects a number of RREQs then selects a request at random message forwarding to mitigate the attack. Trust evaluating node takes the decision based on request arrival time, then it decides whether a node is trustable or malicious, by using  threshold concept in every pre-request in routing path.

 We have used NS2 simulator for simulating the proposed method. The simulation results show that the proposed security solution is effective in detected and preventing rushing node attack in the mobile ad-hoc networks. After incorporating mitigation method is to detect and prevent the rushing attack, this research achieves significant improvement in the PDR (performance metric –Packet Delivery ratio) up to in average is 93.9%..

1. Introduction