Vulnerabilities for Reactive Routing in Mobile Adhoc Networks

Mobile ad hoc network got outstanding success as well as tremendous attention due to its self -maintenance and self-configuration properties or behavior. This paper presents the area of wireless network i.e. work on ad-hoc network. This paper presents protocols of routing and their classification and their comparison. This paper also presents security issues of wireless network. This paper provides an overview of the security issues in MANETs. It classifies the attacks that are possible against the existing routing protocols. An understanding of these attacks and their impacts on the routing mechanism will help researchers in designing secure routing protocols. Keywords: MANET, AODV, DSR, FLOODING

Detection of Route Request Flooding Attack in MANET Using Session Based History Table

Abstract Mobile ad hoc networks are becoming much popular nowadays as a research and network utilities. This network framework is effective but it is surrounded with security related issues. There are a lot of challenges and problems are found like continuously changed topology and changes in resource constrains may form performance and security gaps between MANET arrangement. The data flooding attack causes Denial of Service attacks by flooding of packets. In this paper, an approach is designed and simulated to handle flooding attack and detect the attack by managing the history table and limiting the flooding value

Analytical Model for Improved QoS and Security in Wireless Ad Hoc Networks

QoS and Security are necessary features for wide deployment of wireless ad hoc networks. Existing ad hoc networks provide little support for them. In this paper, we have proposed a mathematical model for improving both QoS and Security. We also present a model that takes into account the number of nodes, the Poisson packet arrival process and service process. Here, wireless ad hoc networks are modeled as M/M/1/Q queuing networks and the expressions for the packet loss rate and packet delivery ratio are evaluated. The mean service time of nodes is evaluated and used to obtain the packet delivery ratio. The analytical results are verified by simulations and numerical computations

FAPRP: A Machine Learning Approach to Flooding Attacks Prevention Routing Protocol in Mobile Ad Hoc Networks

© 2019 Ngoc T. Luong et al. Request route flooding attack is one of the main challenges in the security of Mobile Ad Hoc Networks (MANETs) as it is easy to initiate and difficult to prevent. A malicious node can launch an attack simply by sending an excessively high number of route request (RREQ) packets or useless data packets to nonexistent destinations. As a result, the network is rendered useless as all its resources are used up to serve this storm of RREQ packets and hence unable to perform its normal routing duty. Most existing research efforts on detecting such a flooding attack use the number of RREQs originated by a node per unit time as the threshold to classify an attacker. These algorithms work to some extent; however, they suffer high misdetection rate and reduce network performance. This paper proposes a new flooding attacks detection algorithm (FADA) for MANETs based on a machine learning approach. The algorithm relies on the route discovery history information of each node to capture similar characteristics and behaviors of nodes belonging to the same class to decide if a node is malicious. The paper also proposes a new flooding attacks prevention routing protocol (FAPRP) by extending the original AODV protocol and integrating FADA algorithm. The performance of the proposed solution is evaluated in terms of successful attack detection ratio, packet delivery ratio, and routing load both in normal and under RREQ attack scenarios using NS2 simulation. The simulation results show that the proposed FAPRP can detect over 99% of RREQ flooding attacks for all scenarios using route discovery frequency vector of sizes larger than 35 and performs better in terms of packet delivery ratio and routing load compared to existing solutions for RREQ flooding attacks

Whirlwind: A New Method to Attack Routing Protocol in Mobile Ad Hoc Network

Abstract Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes that dynamically create a network without a fixed infrastructure. However, all the characters make the security problem more serious, denial-of-Service attack is the main challenge in the security of MANET. In this article, we review some routing protocol attacks on Mobile Ad hoc Network. Specially, we propose a new attack method is called Whirlwind which originates one data Whirlwind on network that contain malicious node once the source node discovers a new route. And all data packets are resulted in drop due to over time-life without reaching the desired destination. We have, using the simulation system NS2, evaluated the harms of such attack on AODV protocol

Trust based flooding attack detection and response mechanisms for ad hoc on-demand distance vector routing protocol

Mobile Ad hoc Networks provide a structure-less environment, enabling participants in the coverage mobile nodes to communicate each other without using any centralized authentication agent. Thus, it is compromised in face to various sorts of attacks. Unfortunately, none of the presented secured routing protocols can detect internal Denial of Service (DoS) attacks by itself naturally. One of the most important and effective internal misbehaviors which has dramatic side effects on the network’s throughput is Flooding Attack. This project aims at proposing an alternative solution to detect and respond Flooding Attack in MANET which is based on cooperative trust evaluation mechanisms. Actually, this approach is matched to basic principles of distributed networks in which the participating nodes are responsible for any needed creation, operation and maintenance of the network. Moreover, it seems useful for high mobility networks where the suspicious nodes move around the area repeatedly. Consequently, the gained results of the project prove that the proposed Trust-based Cooperation mechanisms decreases the side effects of Flooding Attack on Ad-hoc On-demand Distance Vector routing protocol

A NOVEL ALGORITHM BASED ON TRUST AUTHENTICATION MECHANISMS TO DETECT AND PREVENT MALICIOUS NODES IN MOBILE AD HOC NETWORK

Ad hoc On-demand Distance Vector (AODV) routing protocol is one of the most popular reactive protocol used for Mobile Ad hoc Network, is target of many attack types. Some research works published related to improve of AODV based on digital signature, typical as SAODV and ARAN. However, they have some weakness, malicious can pass over security wall of SAODV by using fake keys, both of SAODV and ARAN can't detect wormhole nodes in hide mode. In additions, detection solutions based on characteristics of attack types have proposed, they only bring about efficiency for each independent type of attack and malicious nodes can join to the discovered route by deliberately giving fake information concerning. This article proposes a trust authentication mechanisms (TAM) using public-key cryptograms RSA and digital certificates (DC) based on X509 standard. TAM allows a mobile node authenticates preceding nodes by checking control route packets through 3 steps: (1) Digital certificates; (2) actual neighbors; and (3) packet integrity authentications. Analysis results confirm that TAM can detect and prevent almost current routing protocol attack types, such as Blackhole/ Sinkhole, Grayhole, Flooding, Whirlwind and participation mode Wormhole attacks. Specially, the simulation results in NS2 show that TAM can detect and prevent successful to 100\% malicious nodes using fake keys for all scenarios based on the number of UDP connections, 100% hide mode wormhole nodes for immobility scenarios and above 99% (the mistaken rate below 1.0%) for all mobility scenarios with 30m/s of maximum speeds and 1hop minimum tunnel length