Potential Security Attacks on Wireless Networks and their Countermeasure

Routing protocols are fundamental in establishing linkages and communication amongst nodes in Mobile Ad-hoc Networks (MANET). Since Ad-hoc On-demand Distance Vector (AODV) protocol shuns loops and minimizes route broadcasts its predominantly utilized in MANET. This systematic review sought to uncover approaches employed in extending AODV for performance improvement in MANET, their limitations, and AODV characteristics that are extendable. Barbara Kitchenham's original guidelines (2007) guided the research, while studies were retrieved from IEEE, Science Direct, Wiley, Semantic Scholar, ACM Digital Library, EBSCOhost, and Google Scholar databases. The common approaches employed are consideration of parameters to improve quality of service, artificial intelligence and machine learning, and use of the signal strength. The limitations of the approaches can be optimized for improved performance in terms of reduced control traffic and packet loss, efficient bandwidth and memory utilization, reduced processing costs, and energy consumption. The AODV characteristics commonly extended are route discovery, selection, and maintenance. Future work could investigate clustering and zoning, and caching mechanisms approaches to enrich the reliability, performance, and efficiency of AODV protocol.

Ad Hoc Routing with Distributed Ordered Sequences

This paper presents a resilient routing algorithm that is more suitable for a Mobile Ad Hoc Network (MANET) with node quick moving or node sparse, than traditional routing algorithms such as Ad-hoc On-demand Distance Vector (AODV) routing. Since AODV routing in MANETs is known for its advantageous properties, the proposed routing algorithm is based on the AODV, and called RAODV (Resilient AODV). In the route discovery phase, it differs from AODV, which only establishes one routing path from a source node to the destination node, whereas RAODV establishes as many routes as possible. Thus, when the primary route breaks, the node can immediately adopt an alternative route without further route research effort. If no possible alternative route exists, the node will transmit the route break information backward to instruct the previous node on the reverse route to select an alternative one, and so on. The proposed RAODV can reduce the number of route rediscovery procedures, and thus improve the packet loss rate and transmission delay, especially in sparse MANETs. Simulator ns2 was used to evaluate the performance of RAODV. In some cases, the proposed RAODV was able to reduce the packet loss rate by 72.61% compared to traditional AODV.

Several research effort in recent years has shown its significant interest in the development of security measure in the routing of Mobile Ad-hoc Network (MANET). Ad-hoc On-demand Distance Vector (AODV) routing protocol has been one of the basic protocol that is modified to cope with security demands. This paper present an analytical model to evaluate the performance of AODV variant that is developed to be secure with malicious node detection and trust mechanism. Since the performance of MANET is tightly depends on the underlying topology of the nodes, route establishment may fail due to node's movement or malicious activity. The analytical model aims to provide the basic performance insight in the form of the route establishment probability of the MANET with and without malicious nodes. The model is important for MANET designer to optimize the connectivity for all nodes.

Mobile ad-hoc network (MANET) is a collection of movable nodes capable of self-routing, constraining energy and decentralized handling of nodes. It faces many challenges due to uncertainty of network topology i.e. security and congestion. In this paper we propose a novel algorithm for intrusion detection against attacks such as probing, Denial-of-service (DoS), vampire and User-To-Root (U2R) in a MANET environment. The attack detection has been carried out using a profile (behavior) analysis and a confusion matrix (True positives, True negatives, False positives, False negatives). The performance of a standard Ad-hoc On-Demand Distance Vector (AODV) routing protocol has been reported for all 4 types of attack in a network simulator-2(ns-2) environment. To the best of authors' knowledge, this is the first paper reporting a novel intrusion detection algorithm using behavior analysis for an AODV protocol in a MANET environment.

A Mobile Ad Hoc Network (MANET) protocol requires proper settings to perform data transmission optimally. To overcome this problem, it is necessary to select the correct routing protocol and use the routing protocol’s default parameter values. This study examined the effect of route request parameters, such as RREQ_RETRIES and MAX_RREQ_TIMOUT, on the Ad Hoc On-demand Distance Vector (AODV) protocol, which was then compared with the default AODV performance Optimized Link State Routing (OLSR) protocols. The performance metrics used for measuring performance were Packet Delivery Ratio (PDR), throughput, delay, packet loss, energy consumption, and routing overhead. The results show that the OLSR protocol has a smaller delay than the AODV protocol, while in other measurements, the AODV protocol is better than OLSR. By reducing the combination value of RREQ_RETRIES, MAX_RREQ_TIMEOUT in AODV routing to (2, 10 s) and (3, 5 s), the protocol’s performance can be improved. The two combinations result in an average increase in throughput performance of 3.09%, a decrease in delay of 17.7%, a decrease in packet loss of 27.15%, and an increase in PDR of 4.8%. For variations in the speed of movement of nodes, 20 m/s has the best performance, while 5 m/s has the worst performance.

The Ad Hoc On-Demand Distance Vector (AODV) protocol is an on-demand protocol specialized for mobile ad hoc network. Because of node's mobility and limited transmission range, the routes created by original AODV become invalid frequently leading to larger control overhead. In this paper, we propose a new scheme to improve AODV protocol by the concept of reliable distance. The reliable distance, which is always smaller than transmission range, is depended on the node's velocity and direction information attained from Global Positioning System (GPS). By the new mechanism, the routes are more reliable. Performance comparison of optimized AODV with conventional AODV by NS-2 simulator in various conditions shows the performance improvement.

Mobile Ad-hoc Networks (MANETs) features such as open medium, dynamic topology, lack of centralised management and lack of infrastructure expose them to a number of security attacks. Black hole attack is one type of attack that is more common in MANET reactive routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). Black hole attack takes advantage of route discovery process in reactive routing protocols. In this type of attack, a malicious node misleads other nodes in the network by pretending to have the shortest and updated route to a target node whose packets it wants to interrupt. It then redirects all packets destined to a target node to itself and discards them instead of forwarding. This paper analyses the performance of AODV and DSR when attacked by black hole, by varying the mobility of the nodes in the network. The analysis is carried out by simulating scenarios of AODV based MANET and DSR based MANET using Network Simulator 2 (NS-2) and introducing the black hole attack in each of the scenarios. The different scenarios are generated by changing the mobility of the nodes. The performance metrics that are used to do the analysis are throughput, packet delivery ratio and end-to-end delay. The simulation results show that the performance of both AODV and DSR degrades in the presence of black hole attack. Throughput and packet delivery ratio decrease when the network is attacked by black hole because the malicious node absorbs or discards some of the packets. End-to-end delay is also reduced in the presence of a black hole attack because a malicious node pretends to have a valid route to destination without checking the routing table, and therefore shortens the route discovery process. The results also show that throughput decreases slightly when mobility of the nodes is increased in the network. The increase in the speed of the nodes decreases both end-to-end delay and packet delivery ratio.

Hybrid Wireless Mesh Networks (HWMNs) based on the IEEE 802.11 are being increasingly deployed as a varied network of Mobile Ad-hoc Network (MANET) to provide users with extended coverage for wireless Internet access. HWAN, however, has a problem of too wide broadcasting of the Route Request (RREQ) in the route discovery of the Ad hoc Ondemand Distance Vector (AODV) protocol. In this paper, to enhance the performance of the AODV protocol, we have transformed it into a multipath protocol and proposed a new protocol that overcomes disadvantage of AODV by composing the neighbor table for overloaded RREQ. The neighbor table is provided in the form of metric using several items including the bandwidth. This can bring the localization effect of the nodes and we can expect a performance improvement by preventing an overloaded RREQ. Through the simulation, we could confirm better performance in packet loss rate, throughput, packet delivery ratio and routing overhead than the DSR protocol and AODV protocol.

Recently mobile ad-hoc networks (MANET) have found widespread applications. In this infrastructure-less networks the routes have to be refreshed often due to mobility of nodes which also acting as routers. Many ad-hoc routing protocols have been proposed, of which on-demand routing protocols are very popular. To meet the scarce of network resources, the need of the time is to develop a protocol which makes efficient use of resources. In this paper we propose a mobility adaptive cross layer design to enhance the performance of ad-hoc on-demand distance vector (AODV) routing protocol by establishing stable routes. The adaptive decision making according to the speed of mobile nodes on route request (RREQ) packet forwarding results in stable routes. Comparing with the basic AODV protocol, the new cross layer algorithm has better performance as shown with the simulation results obtained using the network simulator, GloMoSim.

The Ad-hoc On-Demand Distance Vector (AODV) routing protocol have being invent into be used current ad-hoc portable structures. Mobile ad hoc network (MANETs)) speak to complex disseminated frameworks that contain remote versatile hubs which can powerfully self-sort out into subjective and impermanent. This permits individuals and gadgets to flawlessly internetwork in regions with no prior correspondence framework. A portable hub is an assortment point in the organization which utilizes a specific convention to advance information from source to objective. The hubs are allowed to move about and sort out themselves into an organization. Productive course foundation between couples of hubs is the essential objective of directing convention. This paper is a recreation put together investigation of Ad hoc with respect to request Distance Vector (AODV). The versatility models utilized in this work is Random Waypoint utilizing network recreation apparatus NS2. The outcomes introduced in this work outline the exhibition of AODV routing protocols in an ad hoc climate.

Vehicular Ad Hoc Networks (VANET) are key to realizing Intelligent Transportation Systems (ITS). Although VANETs belong to the class of Mobile Ad Hoc Networks (MANET), and there are numerous routing protocols for MANETs, none of these protocols are applicable for VANETs. In particular, VANETs are highly dynamic due to high speed mobility of vehicles and traditional routing algorithms for MANETs cannot deal with such dynamicity of network nodes. Several comparative studies have suggested AODV (Ad hoc On-Demand Distance Vector), a well known MANET protocol that is adaptive to dynamic changes in network and makes efficient utilization of network resources, to be the best candidate for dealing with VANETs. However, verbatim adoption of AODV is not an efficient routing solution for VANETs. Recent works therefore proposed various modifications and/or additions to AODV to make it suitable for VANETs. It is particularly important to control congestion in VANETs by efficiently dealing with the AODV "Route Request" (RREQ) packets. In this paper, we propose Pro-AODV (Proactive AODV), a protocol that uses information from the AODV routing table to minimize congestion in VANETs, yet sustains other performance metrics at acceptable levels. The novelty and elegance in Pro-AODV comes from the fact that it does not require the execution of any additional logic, it is sufficient to know only the size of the routing table at each node.

Mobile ad hoc network (MANET) is lacking infrastructure support, so nodes of MANET are vulnerable to attacks. Denial of Service attacks (DOS) makes network inaccessible to users. Black hole attack is a type of DOS attack, in which mischievous node claims that it has a route towards the destination node. Ad Hoc on Demand Distance Vector (AODV) routing protocol is affected by Black hole attack. The proposed solution is based on first Route Reply (RREP) caching mechanism in AODV protocol. Simulation results show performance improvement in routing protocol.

A black-hole attack in the Mobile Ad-hoc NETwork (MANET) is an attack occurs due to malicious nodes, which attracts the data packets by falsely advertising a fresh route to the destination. In this paper, we present a clustering approach in Ad-hoc On-demand Distance Vector (AODV) routing protocol for the detection and prevention of black-hole attack in MANETs. In this approach every member of the cluster will ping once to the cluster head, to detect the peculiar difference between the number of data packets received and forwarded by the node. If anomalousness is perceived, all the nodes will obscure the malicious nodes from the network.

<p>In the scenario of node failure in mobile multi-agent, Ad hoc On-demand Distance Vector (AODV) rout-ing protocol fails in network information transmission due to the damage of communication link. In addi-tion, the existing AODV multipath routing protocol node load balancing mechanism is imperfect. In order to solve the low network survivability caused by the above problems, an improved responsive multipath routing protocol MD_AODV (Multipath Destroy-resistance AODV) is proposed. The protocol is opti-mized in three aspects: multi-channel concurrency mechanism, node load balancing mechanism and shortest path maintenance mechanism. The simulation analysis of the modified AODV multipath routing protocol is realized on OPNENT simulation platform. The simulation results show that compared with AODV protocol, the improved multipath routing protocol can enhance the utilization of network re-sources and has better link redundancy. Moreover, the modified routing protocol not only enhances the reliability and fault tolerance of the path, but also increases the network aggregation bandwidth. </p> <p> </p>