Aodv Protocol And Its Solution Computer Science Essay

Security is an indispensable demand in nomadic ad hoc webs to supply protected communicating between nomadic nodes. MANETs are vulnerable to assorted onslaughts ; black hole is one of the possible onslaughts. Black hole is a type of routing onslaught where a malicious node publicize itself as holding the shortest way to all nodes in the environment by directing bogus path answer.

We attempt to concentrate on analyzing and bettering the security of one of the popular routing protocol for MANETS viz. the Ad hoc On Demand Distance Vector ( AODV ) routing protocol. Our focal point specifically, is on guaranting the security against the Black hole Attacks. We propose alterations to the AODV protocol and warrant the solution with appropriate execution

Keywords – MANETs, AODV, Black Hole Attack, RREQ, RREP.

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!

order now


A nomadic ad hoc web ( MANET ) is formed by a set of nomadic radio devices with no fixed topology. The nodes can travel freely, leave and enter the web at any clip. Typically, nodes communicate in a peer-to-peer manner by utilizing the radio wireless medium. In a MANET, there is no differentiation between a host and a router, since all nodes can be beginnings every bit good as traffic forwarders. Some illustrations of the possible utilizations of ad hoc networking include pupils utilizing laptop computing machines to take part in an synergistic talk, concern associates sharing information during a meeting, soldiers relaying information for situational consciousness on the battleground, and exigency catastrophe alleviation forces organizing attempts after a hurricane or temblor. We have different routing protocols for path find and package forwarding.

The paper is organised as follows. In Section 2 we briefly depict the AODV routing protocol. Section 3 discusses about black hole onslaught, Section 4 we discuss our solution to AODV algorithm. Finally, we conclude in Section 5 with future range.

Overview on AODV

AODV is a reactive routing protocol [ 1 ] in which the web generates paths at the start of communicating. Each node has its ain sequence figure and this figure increases when links change. Each node Judgess whether the channel information is new harmonizing to sequence Numberss. Figure 1 illustrates the path find procedure in AODV. In this figure, node S is seeking to set up a connexion to finish D. First, the beginning node S refers to the path map at the start of communicating. In instance where there is no path to destination node D, it sends a Route Request ( RREQ ) message utilizing broadcast medium. RREQ ID increases one every clip node S sends a RREQ. Node A and B which have received RREQ generate and regenerate the path to its old hop. They besides judge if this is a perennial RREQ. If such RREQ is received, it will be discarded. If A and B has a valid path to the finish D, they send a RREP message to node S. By contrast, in instance where the node has no valid path, they send a RREQ utilizing broadcast medium. The exchange of path information will be repeated until a RREQ reaches at node D. When node D receives the RREQ, it sends a RREP to node S. When node S receives the RREP, so a path is established. In instance a node receives multiple RREPs, it will choose a RREP who ‘s the finish sequence figure ( Dst Seq ) is the largest amongst all antecedently received RREPs. But if Dst Seq were same, it will choose the RREP whose hop count is the smallest.

Figure 1: Route find procedure

In Figure 2, when node B detects disjunction of path, it generates Route Error ( RERR ) messages and puts the nullified reference of node D into list, so sends it to the node A. When node A receives the RERR, it refers to its path map and the current list of RERR messages. If there was a path to finish for node D included in its map, and the following hop in the routing tabular array is a neighbouring node B, it invalidates the path and sends a RERR message to node S. In this manner, the RERR message can be eventually sent to the beginning node S.

Figure 2: Transfering path mistake messages

Advantages of AODV

1. AODV protocol is a level routing protocol it does non necessitate any cardinal administrative system to manage the routing procedure.

2. AODV tries to maintain the operating expense of the messages little. If host has the path information in the Routing Table about active paths in the web, so the operating expense of the routing procedure will be minimum. The AODV has great advantage in operating expense over simple protocols which need to maintain the full path from the beginning host to the finish host in their messages. The RREQ and RREP messages, which are responsible for the path find, do non increase significantly the operating expense from these control messages. AODV reacts comparatively rapidly to the topological alterations in the web and updating merely the hosts that may be affected by the alteration, utilizing the RRER message. The Hello messages, which are responsible for the path care, are besides limited so that they do non make unneeded operating expense in the web.

3. The AODV protocol is a loop free and avoids the numeration to eternity job, which were typical to the classical distance vector routing protocols, by the use of the sequence Numberss.

4. The AODV protocol will execute better in the webs with inactive traffic with the figure of beginning and finish braces is comparatively little for each host.

Disadvantages of AODV

1. Intermediate nodes can take to inconsistent paths if the beginning sequence figure is really old and the intermediate nodes have a higher but non the latest finish sequence figure, thereby holding stale entries.

2. Multiple Route Reply packages in response to a individual Route Request package can take to heavy control operating expense.

3. The periodic beaconing leads to unneeded bandwidth ingestion.

Description of Blackhole Attack

Routing protocols are exposed to a assortment of onslaughts. Black hole onslaught is one such onslaught and a sort of Denial Of Service ( DoS ) in which a malicious node makes usage of the exposures of the path find packages of the routing protocol to publicize itself as holding the shortest way to the node whose packages it wants to stop [ 2 ] . This onslaught aims at modifying the routing protocol so that traffic flows through a specific node controlled by the aggressor. During the Route Discovery procedure, the beginning node sends RREQ packages to the intermediate nodes to happen fresh way to the intended finish. Malicious nodes respond instantly to the beginning node as these nodes do non mention the routing tabular array. The beginning node assumes that the path find procedure is complete, ignores other RREP messages from other nodes and selects the way through the malicious node to route the informations packages. The malicious node does this by delegating a high sequence figure to the answer package. The tracker now drops the standard messages alternatively of relaying them as the protocol requires.

In AODV, Dst Seq is used to find the freshness of routing information contained in the message from arising node. When bring forthing a RREP message, a finish node compares its current sequence figure, and Dst Seq in the RREQ package plus one, and so selects the larger one as RREP ‘s Dst Seq. Upon having a figure of RREP, a beginning node selects the 1 with greatest Dst Seq in order to build a path. To win in the blackhole onslaught the aggressor must bring forth its RREP with Dst Seq greater than the Dst Seq of the finish node. It is possible for the aggressor to happen out Dst Seq of the finish node from the RREQ package. In general, the aggressor can put the value of its RREP ‘s Dst Seq base on the received RREQ ‘s Dst Seq. However, this RREQ ‘s Dst Seq may non show the current Dst Seq of the finish node. Figure 3 shows an illustration of the blackhole onslaught.

As an illustration, see the following scenario in fig. 3. We illustrate a typical scenario of the protocol package exchanges, picturing the coevals and traverse of RREQ and RREP control messages.

Figure 3: Blackhole onslaught

The node S is assumed to be the beginning node wanting to pass on with node D. Thus, as per the account earlier, node S would bring forth the RREQ control message and broadcast it. The broadcasted RREQ control message is expected to be received by the nodes N1, N2 and N3. Assuming that the node N3 has a path to node D in its path tabular array, the node N3 would bring forth a RREP control message and update its routing tabular array with the accrued hop count and the finish sequence figure of the finish node.

Destination Sequence Number is a 32-bit whole number associated with every path and is used to make up one’s mind the freshness of a peculiar path. The larger the sequence figure, the freshman is the path [ 3 ] . Node N3 will now direct it to node. Since node N1 and node N2 do non hold a path to node D, they would once more air the RREQ control message. RREQ control message broadcasted by node N3 is besides expected to be received by node M ( assumed to be a malicious node ) . Therefore, node M being malicious node, would bring forth a false RREP control message and direct it to node N3 with a really high finish sequence figure, that later would be sent to the node S. However, since, the finish sequence figure is high, the path from node N3 will be considered to be fresher and therefore node S would get down directing informations packages to node N3. Node N3 would direct the same to the malicious node. The RREQ control message from node N1, would finally make node D ( finish node ) , which would bring forth RREP control message and path it back. However, since the node S has a RREP control message with higher finish sequence figure to that path, node S will disregard two echt RREP control messages. If any nexus is disconnected during the transportation of packages so RERR control message is generated. For every RREP control message received, the beginning node would foremost look into whether it has an entry for the finish in the path tabular array or non. If it finds one, the beginning node would look into whether the finish sequence figure in the entrance control message is higher than one it sent last in the RREQ or non. If the finish sequence figure is higher, the beginning node will update its routing tabular array with the new RREP control message ; otherwise the RREP control message will be discarded.

In Route Maintenance stage, if a node finds a nexus interruption or failure, so it sends RERR message to all the nodes that uses the path.

First set the waiting clip for the beginning node to have the RREQ coming from other nodes and so add the current clip with the waiting clip. Then in hive awaying procedure, shop all the RREQ Destination Sequence Number ( DSN ) and its Node Id in RR-Table until the computed clip exceeds. By and large the first path answer will be from the malicious node with high finish sequence figure, which is stored as the first entry in the RR-Table. Then compare the first finish sequence figure with the beginning node sequence figure, if there exists much more differences between them, certainly that node is the malicious node, instantly take that entry from the RR-Table. This is how malicious node is identified and removed. Final procedure is choosing the following node Idaho that has the higher finish sequence figure, is obtained by screening the RR-Table harmonizing to the DSEQ-NO column, whose package is sent to ReceiveReply method in order to go on the default operations of AODV protocol.

Fig 4: Protocol Packet Exchanges

Table 1

Content of RR-table with malicious node













Table 2

Content of RR-table without malicious node










Solutions for Black hole onslaught

Latha Tamilselvan, Dr. V Sankaranarayanan [ 4 ] proposed a solution with the sweetening of the AODV protocol which avoids multiple black holes in the group. A technique is give to place multiple black holes collaborating with each other and detect the safe path by avoiding the onslaughts. It was assumed in the solution that nodes are already authenticated and hence can take part in the communicating. It uses Fidelity tabular array where every node that is take parting is given a fidelity degree that will supply dependability to that node. Any node holding 0 value is considered as malicious node and is eliminated.

Hesiri Weerasinghe [ 5 ] proposed the solution which discovers the secure path between beginning and finish by placing and insulating concerted black hole nodes. This solution adds on some alterations in the solution proposed by the S.Ramaswamy to better the truth. This algorithm uses a methodological analysis to place multiple black hole nodes working collaboratively as a group to originate concerted black hole onslaughts. This protocol is a somewhat modified version of AODV protocol by presenting Data Routing Information ( DRI ) tabular array and cross checking utilizing Further Request ( FREQ ) and Further Reply ( FREP ) . Most of the documents have addressed the black hole job on the protocol such as AODV.

Payal N. Raj, Prashant B. Swadas [ 6 ] proposed “ DPRAODV: A dynamic acquisition system against black hole onslaught in AODV based MANET ” ( sensing, bar and reactive AODV ) to forestall security of black hole by informing other nodes in the web. It uses normal AODV in which a node receives the Route answer ( RREP ) package which foremost checks the value of sequence figure in its routing tabular array. The RREP is accepted if its sequence is higher than that in the routing tabular array. It besides check whether the sequence figure is higher than the threshold value, if it is higher than threshold value than it is considered as the malicious node. The value of the threshold value is dynamically updated in the clip interval. The threshold value is the norm of the difference of finish sequence figure in each clip slot between the sequence figure in the routing tabular array and the RREP package. The node that is detected as the anomalousness is black listed and ALARM package is sent so that the RREP package from that malicious node is discarded. The routing tabular array for that node is non updated nor is the package forwarded to others. The chief advantage of this protocol is that the beginning node announces the black hole to its neighbours in order to be ignored and eliminated. Their solution increases the mean terminal to stop hold and normalized routing operating expense.

Zhao Min [ 7 ] has proposed a cryptanalytic based solution ( ZHAO ) , that is, an hallmark mechanism for placing black hole nodes in MANETs. An hallmark mechanism is constructed based on the construct of the hash map and Message Authentication Code ( MAC ) which is used for look intoing the RREPs at beginning node to direct the information packages. The proposed mechanism eliminates the demand for a PKI ( Public Key Infrastructure ) or other signifiers of hallmark substructure, nevertheless it needs to be discussed, how to manage limitless message hallmark by exchanging one-way-hash ironss and how to forestall a malicious node can non hammer a answer if the hash key of any nodes to be disclosed to all nodes. This solution consumes much of the calculation power of the MANET nodes.


In this paper we have mentioned the AODV protocol and Black hole onslaught in MANETs. We have proposed a executable solution for the black hole onslaughts that can be implemented on the AODV protocol. These Proposed methods can be used to happen the secured paths and forestall the black hole nodes in the MANET. As future work, we intend to develop an algorithm which can observe the Black hole onslaught and salvage our web when a figure of malicious nodes onslaught web at same clip.