Professional Documents
Culture Documents
Ijettcs 2013 07 29 055
Ijettcs 2013 07 29 055
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856
An Implementation and Performance Evaluation of Passive DoS Attack on AODV Routing Protocol in Mobile Ad hoc Networks
E.Suresh Babu1, C.Nagaraju2, MHM Krishna Prasad3
1
Associate Professor& Research Scholar, PACE Institute of Technology & Sciences Ongole. 2 Associate Professor YSR College of Engineering of YV University, Kadapa. 3 Associate Professor JNTU College of Engineering, Kakinada
quickly through intermediate nodes, which the packet must traverse from a source to the destination. Malicious routing attacks can target the routing discovery or maintenance phase by not following the specifications of the routing protocols. There are also attacks that target some particular routing protocols, such as DSR [3] or AODV [2].
2. OVERVIEW PROTOCOL
OF
AODV
ROUTING
1. INTRODUCTION:
In [3] a MANET, a collection of mobile hosts with wireless network interfaces form a temporary network without the aid of any fixed infrastructure or centralized administration. A MANET is an autonomous system of mobile nodes. The system may operate in isolation, or may have gateways and interface with a fixed network. Its nodes are equipped with wireless transmitters/receivers using antennas which may be omni-directional (broadcast), highly-directional (point-to-point), or some combination thereof. At a given time, the system can be viewed as a random graph due to the movement of the nodes, their transmitter/receiver coverage patterns, the transmission power levels, and the co-channel interference levels. The network topology may change with time as the nodes move or adjust their transmission and reception parameters. Thus, a MANET has several salient characteristics described in [10] such as dynamic topologies, resource constraints, limited physical security, and no infrastructure. There are a wide variety of attacks that target the weakness of MANET. For example, routing messages are an essential component of mobile network communications, as each packet needs to be passed Volume 2, Issue 4 July August 2013
In[2] EM. Belding-Royer Charles E. Perkins presented an description of the ad hoc on-demand distance-vector (AODV) routing protocol, which is anon-demand routing protocol; all routes are discovered only when needed, and are maintained only as long as they are being used. Routes are discovered through a route discovery cycle, whereby the network nodes are queried in search of a route to the destination node. When a node with a route to the destination is discovered, that route is reported back to the source node that requested the route. AODV was designed to meet the following goals: Minimal control overhead, Minimal processing overhead, Multi-hop path routing capability, Dynamic topology maintenance, Loop prevention.Because resources are scarce in mobile ad hoc networks, AODV attempts to minimize control overhead by eliminating periodic routing updates and utilizing only on-demand messaging. To minimize processing overhead, AODV messages are simple and require little computation. In an ad hoc network, sources and destinations may be out of direct communication range with each other due to the limited transmission range of the wireless medium. Hence, AODV provides nodes with the ability to discover multi-hop paths to destinations and to maintain these paths even when the network topology is continually changing. Routing loops are stringently guarded against; they are expensive in any network, but they are particularly detrimental in a wireless network where signaling capacity and node processing power are limited. AODV utilizes per node sequence numbers to prevent routing loops. The following sections describe the features of AODV that allow it to discover and maintain loop free routes. 2.1 Route Discovery When a source node has data packets to send to some destination, it checks its routing table to determine Page 124
Fig.-2 RREQ Broadcast In the event that the source receives multiple RREPs along different paths, it selects the route with the greatest destination sequence number and the smallest hop count for communication with the destination. Route discovery operations often require processing and communications capacity at every node in the ad hoc network. For this reason, we often describe the discovery operation as flooding even though the RREQs are only locally broadcast messages. Since the messages are changed at each hop by AODV processing, we could not use any system-wide broadcast or multicast address. Nevertheless, it is of great importance to use careful broadcast techniques to minimize any spurious retransmission of RREQ packets.
Fig.3 RREP Propagation. 2.2 Route Maintenance In an ad hoc network, links are likely to break due to the mobility of the nodes and the ephemeral nature of the wireless channel. Hence, there must be a mechanism in place to repair routes when links within active routes break. An active route is defined to be a route that has recently been utilized for the transmission of data packets. When such a link break occurs, the node upstream of the break (i.e., the node closer to the source node), invalidates in its routing table all destinations that become unreachable due to the loss of the link. It then creates a ROUTE ERROR (RERR) message, in which it lists each of these lost destinations. The node sends the RERR upstream towards the source node. If there are multiple previous hops (so-called precursors) that were utilizing this link, the node broadcasts the RERR; otherwise, it is Page 125
When the next hop receives the RREP, it first increments the hop count value in the RREP and then creates a forward route entry to both the destination node and the node from which it received the reply as shown in fig1(b). This ensures that all nodes along the path will know the route to the destination in the event that the source selects this route for data packet transmission. The node Volume 2, Issue 4 July August 2013
Fig.5. Dos Attack in AODV Protocol But In this paper we focus on DoS attacks in wireless ad hoc networks. More specifically, we investigate attacks at the routing layer. For instance, In AODV, a malicious node that receives a RREQ could return a RREP to the source node with a destination sequence number that is far greater than that in the RREQ to ensure that it is on the selected path. In this an attacker may damage the other nodes just by dropping the Packets. This can cause a severe degradation of network performance in terms of the achieved throughput and latency. In wireless networks, DoS attacks are difficult to prevent and protect against. Attacks at the routing layer could consist of the following: a) The malicious node participates in a route but simply drops a certain number of the data packets. This causes the quality of the connections to deteriorate and further ramifications on the performance if TCP is the transport layer protocol that is used. b) The malicious node transmits falsified route updates. The effects could lead to frequent route failures thereby deteriorating performance. c) The malicious node could potentially replay stale updates. This might again lead to false routes and degradation in performance. d) Reduce the TTL (time-to-live) field in the IP header so that the packet never reaches the destination. Notice that all of the above could lead to congestion due to data that is either retransmitted or transmitted on erroneous routes only to be dropped at a later time.
6. PERFORMANCE EVALUATION
In this paper, we apply simulation technology to assess the impact that different attacks can produce on specific metrics of network performance. First, we consider the effect of an attack scenario on the networks packet delivery ratio (PDR), that is the ratio of the number of packets received to the number of packets sent. Second, we consider also the effect on the networks average endto-end delay (E2ED) defined, for all the packets that arrive at their final destinations, as the positive difference between the time of packet reception and the time of transmission. Third, we consider Routing Load (RL) which is ratio of the routing packets generated to the data packets delivered at the destination. Sometime it also renamed as throughput. The attack scenarios we study in this project do not exploit characteristics of the constructs of wireless ad hoc networking protocols (i.e., packets or radio frames) or their handshake sequences. We demonstrate that these attacks can be effective because the protocols adaptation mechanisms respond to changes in the availability of the radio links in the network. Our results shows in Table-1& Table-2 that the extent to which the performance of a wireless network or a service degrades on DoS depends on many factors such as Page 127
5. SIMULATION FRAMEWORK
Our experimental exploration in attacks on wireless networks aims for a good measure of realism. In order maximize the relevance of our simulation study, we have chosen to assign each network node the model of a complete protocol stack, which is implemented in the NS2[12, 13, 14]. Communication between network nodes is achieved via the Propagation Model, which in our simulations is represented by the Two-Ray Ground Model. Layers 1 and 2, roughly speaking PHY and MAC, conform to the specifications of the IEEE 802.11b standard and use 11 Mb/s. unless otherwise stated; in our Volume 2, Issue 4 July August 2013
Fig 8 Throughput with varying number of Nodes with AODV Vs AODV with DoS attack 6.1 PERFORMANCE ANALYSIS Fig-6 also shows the behavior of E2ED with increasing values of the attack. we must point out that the results for E2ED are somewhat different across other Normal AODV scenarios, the E2ED tends to increase, When attacked nodes spend the majority of time powered down, they are most often unavailable to forward packets and generate little network traffic.
Fig 6: End-To-End Delay with Varying No of Nodes with AODV Vs AODV with DoS attack The immediate consequence is that in this artificially constructed topology node density is high enough for other nodes to pick up the role of forwarding. Since the load offered to the network is smaller, however, packets tend to experience less delay.
8. REFERENCE
[1] Elizabeth M. Belding-Royer, Charles E. Perkins Evolution and future directions of the ad hoc ondemand distance-vector routing protocol-Elsevier 2003 [2] D. B. Johnson, D. A. Maltz, Y. Hu, and J. G. Jetcheva. The dynamic source routing protocol for Page 128
Fig-7 Packet Delivery Fraction with varying number of Nodes with AODV Vs AODV with DoS attack Volume 2, Issue 4 July August 2013
Page 129