Research Journal of Applied Sciences, Engineering and Technology 9(8): 583-593, 2015

DOI:10.19026/rjaset.9.1442
ISSN: 2040-7459; e-ISSN: 2040-7467
© 2015 Maxwell Scientific Publication Corp.
Submitted: May 31, 2014 Accepted: November 26, 2014 Published: March 15, 2015

Research Article
Directional Advanced Intruder Handling Ad-hoc on Demand Distance Vector Protocol
Using Divide and Conquer Strategy Implementation
1
S. Hemalatha and 2Paul Rodrigues
1
Anna University,
2
DMI College of Engineering, Chennai, Tamil Nadu, India

Abstract: The Aim of this study is to develop the protocol for identify the failure node, intruder node with power
optimized routing protocol named Directional Advanced Intruder Handling Adhoc On demand Vector protocol.
Mobile Ad-hoc Network is an infrastructure less network, nodes in mobile Ad-hoc are comprised to work with
wireless nodes, can move freely and dynamically self organized in to arbitrary topologies. Over the past twenty
years the development of Ad-hoc network was developed from tactical networks to Bluetooth, HyperLAN and IEEE
802.11. In the protocol stack of Ad-hoc network, the major issues on network layers, which has a responsibility to
transfer the packets from one node to another. Many protocols have been proposed in Ad-hoc network, but none of
the protocol is working under the principle of handling checking on packet delivery. This study presents the
Directional Advanced Intruder Handling Ad-hoc on demand Vector protocol algorithm definition and
implementation. The working principle of this protocol is checking the packet delivery to the destination. If any one
of the nodes in the route is not forwarding the packet, that corresponding node will be identified and redirect the
packet to the new route. For doing this checking this protocol uses divide and conquer strategy. The number hop
between the source to destination is divided into two halves and check whether the up to the middle node the packet
are flowing in a proper order or not. Recursively doing the divide and conquer of the route path, can identify the
node which is not forward the packet to the next node. The design of this protocol itself able to identify the intruder
in the routing path. Contains several stages from path discovery, packet transmits, apply divide and conquer strategy
on route, identify the node which is not forward the packet, redirect the new path, alert all the nodes about the victim
node. Finally performance of the protocol is improved with transmission in directional antennas.

Keywords: AAODV protocol, AD-HOC network, AODV protocol, divide and conquer

INTRODUCTION Aceves, 1994). The routing in topology based protocol

each node makes a decision based on the topology
A Collection of nodes formed a network under the information. This type based on link state protocol
working principles of move freely, organized (Chiang et al., 1997; Jacquet et al., 1998). Routing in
themselves arbitrarily and without any administration is destination based protocol is maintaining a distance to a
called Mobile Ad-hoc network (Wikipedia, 2004). In a destination. A Routing protocol in an Ad-hoc network
common, a route between the source to destination is divided into two main categories of proactive and
through the Ad-hoc network is established by the reactive protocol. In proactive protocol nodes maintain
routing protocol. The packets have followed this route routing information for all other nodes in the network is
to transfer the data. Packets are moved from a node to stored in a table is called a routing table. So this
another node called the hop, until to reach the protocol is also named as a table driven protocol.
destination. A Routing protocol an Ad-hoc network is In the second type of protocol, route information is
classified into two types is uniform protocol and non established when a packet transfers between the nodes.
Uniform protocols. In uniform protocol each node In the table driven protocol are Destination Sequence
sends and responds a routing control message. In non Distance Vector (DSDV) protocol (Perkins and
uniform type protocol reduces the number of nodes Bhagwat, 1994), every node maintain a routing table of
participating in routing computation (Murthy and all other nodes is based on the shortest path from source
Garcia-Luna-Aceves, 1994). to destination. When any topological changes occur in
Routing protocols describe the state information the network, the route table also changes. The
into two ways like topology based protocol and maximum number of changes in maintain by a counter
destination based protocol (Kuosmanen, 2002; which is increment by one when any router table
Stojmenovic and Wu, 2003; Murthy and Garcia-Luna- changed. Wireless Routing Protocol (WRP) is a

Corresponding Author: S. Hemalatha, Anna University, Chennai, Tamil Nadu, India

This work is licensed under a Creative Commons Attribution 4.0 International License (URL: http://creativecommons.org/licenses/by/4.0/).
543
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

proactive protocol which maintains a four kind of table identifying an intruder. In the year 2005 knowledge
hold a detail like distance, link cost and route and based IDS proposed who defined finite base machine
message transmission information (Perkins and Royer, through RIDAN architecture against the AODV routing
1999). Clustered Gateway Switch Protocol is an process.
extension of Destination Sequence Distance Vector Directional antennas have a number of
routing protocol which includes clustering to increase advantages over omni-directional antennas for ad hoc
the protocol scalability (Murthy and Garcia-Luna- networking. By focusing energy only in the intended
Aceves, 1994). This protocol performance is improved direction, directional antennas significantly increase the
by including methods like priority token scheduling, potential for spatial reuse. They provide a longer range
gateway code scheduling and path recursion. and/or more stable links due to increased signal strength
Optimization link state routing protocol (Chiang et al., and reduced multipath components.
1997) optimized the multipoint relay. Each node To best utilize directional antennas, a suitable
identifies its multipoint relay, by flooding message to Medium Access Control (MAC) protocol must be
MRP will be received by the destination. Topology designed. Current MAC protocols, such as the IEEE
dissemination Based on Reverse Path Forwarding 802.11 standard, do not benefit when using directional
(TBRPF) (Bellur et al., 2001) is a link state routing antennas, because these protocols have been designed
with overhead reduction technology (Jacquet et al., for omnidirectional antennas. In this study, we present
1998). Each node computes its shortest path tree to all modified MAC protocols suitable for 802.11 based ad
other nodes, but to optimize bandwidth Fish Eye State hoc networks using directional antennas. For instance,
routing Protocol (Bellur et al., 2001) is under the routing performance can be improved by using a
technique of Fish Eye state information about other directional antenna.
nodes is based on how far away the defined nodes are. As a consequence, various research issues,
In source initiated routing protocols Dynamic Source including MAC, routing, transmission scheduling,
Routing Protocol (Johnson and Maltz, 1996) each node location discovery and topology control, have been
maintains a route cache contain a route learned by the emerged to best utilize the benefit of using directional
node. AODV (Perkins and Royer, 2000; Marti et al., antennas.
2000; Park and Corson, 1997, 1998; Abd Rahman and Most of the current MAC protocols, such as IEEE
Zukarnain, 2009; Perkins et al., 2003) node create a 802.11 MAC standard, use a handshake mechanism
route on demand to maintain a complete a route using implemented by exchanging small control frames
DSDV algorithm. TORA (Giannoulis et al., 2007) is
named Request-to-Send (RTS) and Clear-to-Send
another source initiated on Demand protocol, in a
(CTS).
concept of link reversal of direct Acyclic Graph. TORA
The successful exchange of these two control
has the capacity of routing repair. ABR routing protocol
is on demand protocol route selection is based on the frames reserves the channel for transmission of the,
signal strength in the link. potentially longer, data frame and a short
The evolution of identifying intruder was started in Acknowledgement (ACK) frame.
the early 1987 onwards. In Dorothy (1987), Bace When using directional antennas, while one
(1998, 2000) and Mukherjee et al. (1994), the computer directional antenna at some node may be blocked other
directional antennas at the same node may not be
abuse on real time intruder detection was proposed by
blocked, allowing transmission using the unblocked
dinning methods able to detect, break and penetration
antennas. This property results in performance
of intruder in the MANET (Marti et al., 2000;
improvement when using directional antennas.
Yongguang and Wenke, 2000). Intruder was identified
by proposed that watch dog and parthrater method was
MATERIALS AND METHODS
used to identify the node which do not able to forward
the packet. This method also checks whether node DAIHAODV protocol design stages: This protocol
forward the packet without modification or not. Second implementation is divided into several stages are:
method used was knowledge based IDS paper, different
attacker patterns are updated on the IDS. Any variations • Decide the path using AODV protocol select the
on the attacker patters are identified as a intruder. Third threshold level battery power nodes
method used was sensor based. They used multiple
• Packet transmit
sensor for collecting data from nodes, which is used to
• Establish the divide and conquer strategy
identify the intruder. Next method was a signature
based intruder detection and Geo graphic zone based • Identify the victim node and Intruder node
intrusion detection system. Next method was proposed • Redirect the new route
an architecture is called cooperative intrusion detection • Sending alarm message to all the node
architecture was used to detect intruders. This
architecture forms a node hierarchy on the network, top Figure 1 shows the flow of directional AIHAODV
level nodes in the network were responsible for protocol, follows the above stages.

584
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

Fig. 1: Stages of DAIHAODV protocol

Fig. 2: Path identification based on threshold energy using AODV protocol

Decide the path using AODV protocol: Route This module is processed with discover the route
discovery of this protocol will be based on Ad-hoc On by using the AODV protocol as in Fig. 2 implemented
Demand Vector protocol principle. Steps involved in in NS2. It can be done based on the route request and
Route Discovery: unicasting reply.

• Node S (Source) needs a route to D (Destination) Packet transmit: Once the route between source to
• Creates a Route Request (RREQ): Enters D’s IP destination was identified, the packet is transferred
addr, seq#, S’s IP addr, seq#, hop count (= 0) from source to destination. This module is processed
• Node S broadcasts aRREQ to neighbours with packet transmission the packet can be transmitted
• Node A receives RREQ: Makes a reverse route via the route which is discovered by the AODV
entry for S dest = S, next hop = S, Hop count = 1 It protocol as in Fig. 2. If the packet is reached properly to
has no routes to D, so it rebroadcasts RREQ the destination, then the route is perfect and the route
• Node C (intermediate node say C) receives RREQ: does not have any victim. If and packet loss or any
Makes a reverse route entry for S dest = S, delay occurred means it considers that the route have
nexthop = A, hopcount = 2 It has a route to D and victimized. Identification purposes we are transmitting
the seq# for a route to D is > = D’s seq# in RREQ packet. Figure 3 Packet Transmit.
585
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

Fig. 3: Packet transmit

Establish the divide and conquer strategy: middle for source to middle (Dest = middle)
Customized protocol forwards the packet from source (iii) repeat the process
to identified destination. Then calculate the number of //assume there is no flow of data then suspect
nodes and do the operation for giving divide and the node may be the intruder
conquer strategy. In this strategy, the network can Process whether the middle node is intruder
calculate the number of nodes and then it calculates the If True Set voctim = Middle and initiate route
middle node, which the middle node will act as the discovery process
temporary destination. Then the packet can be Step 4: Process to conform victim node
transmitted from the source to the temporary Step 5: Process the flow of data in middle node
destination. If the temporary destination receives the Step 6: If the flow is delayed, set Dest = prev (middle)
packet then that node is not a victim. Then it will again and go to step 2
calculate the number of remaining nodes. And find the Step 7: If the flow is normal set source = next (middle)
and go to step 2
middle node. That old middle node is acting as a
Step 8: Stop
temporary source and a new middle node will act as the
temporary destination and do the process again. Else
This module is processed with the strategy of
calculate the source node to middle node hop count and divide and conquers; the packet can be transmitted via
again do the new middle node and that will act as the the route which is discovered by the AODV protocol as
temporary destination. in Fig. 2. It can be calculate the number of nodes in the
route as in Fig. 4. It can send the packet to the
Divide and conquer strategy algorithm: Procedure destination. If the packet is not reached to the
(Source, Dest, G) -Divide and Conquer strategy destination, then the route is divided and middle node
Consider the ordered Set G = {1……..N} will act as the temporary destination as in Fig. 5. After
a transmit ion that temporary destination receives the
Step 1: Initialize source = 1, dest = N packet, then that node act as the temporary source as in
Step 2: Calculate middle = No of hops (source to dest) Fig. 5.
/2
Step 3: (i) Check the packet is passed the middle node Identify the victim node and intruder node: Using
if yes the calculate the new middle form old AIHAODV Routing protocol divide and conquer
middle (source = old middle) to dest, go to strategy can be done. Based on this strategy it can
step 2 identify the victim node which does not forward the
(ii) otherwise calculate the new packet to the next node shown in Fig. 6.
586
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

Fig. 4: Divide and conquer flow diagram

Fig. 5: Route discovery and number of node calculation

587
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

Fig. 6: Victim node identification

Fig. 7: Intruder node identification

For identification of intruder, protocol made the Send alert message: This module is focused for
victim node as suspected node. Sends a route request to sending alter the message to entire node after the victim
the suspected node, there is no reply comes from the node identified using divide and conquer strategy.
node it is conformed as a intruder and send alert
message about the intruder to all other node shown in Route re-direction: This module is focused in the
Fig. 7. route redirection, after send an alert message it will
588
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

Fig. 8: Route re-direction initiation

Fig. 9: Through redirection packet reached at destination

redirect the route from source to the destination. This was based on the AODV protocol design principles. We
will be reflected in the Fig. 8 and 9. made a performance comparison with AODV and
AIHAODV protocol. Three performance measures we
RESULTS AND DISCUSSION have taken are throughput, packet delivery ratio, End to
End delay.
Compare DAIHAODV with AODV and AIHAODV:
In the previous chapter discuss the implementation of Through put between AODV and AIHAODV with
DAIHAODV protocol. This protocol implementation DAIHAODV: Throughput refers to how much data can
589
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

Fig. 10: Graph for throughput evaluation

Fig. 11: Graph for packet delivery ratio

be transferred from one location to another in a given ∑ Number of packets receive/∑ Number of packets
amount of time. Figure 10 shows that DAIHAODV send
protocol gets a better through put comparing with
AIHAODV and AODV. Figure 11 shows that DAIHAODV protocol gets a
better packet delivery ratio comparing with AIHAODV
Packet delivery ratio: The ratio of the number of and AODV.
delivered data packets to the destination. This
illustrates the level of delivered data to the End-end delay: The average time is taken by a data
destination: packet to arrive in the destination. It also includes the
590
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

Fig. 12: End 2 end delay

Fig. 13: Energy consumption

delay caused by route discovery process and the queue Figure 12 shows that DAIHAODV protocol gets a
in data packet transmission. Only the data packets better end to End delay comparing with AIHAODV and
that successfully delivered to destinations that AODV.
counted:
Energy consumption: Figure 13 shows that
∑ (arrive time-send time) /∑ Number of DAIHAODV protocol gets a better energy consumption
connections with AIHAODV and AODV.
591
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

Fig. 14: Residual energy comparison

Residual energy: Figure 14 shows that DAIHAODV Chiang, C.C., H.K. Wu, W. Liu and M. Gerla, 1997.
protocol gets a better residual energy comparing with Routing in clustered multihop mobile wireless
AIHAODV and AODV. networks with fading channel. Proceedings of the
IEEE SICON-97, pp: 197-211.
CONCLUSION Dorothy, E.D., 1987. An intrusion-detection model.
IEEE T. Softw. Eng., 13(7): 222- 232.
This study presents, the implementation of Giannoulis, S., C. Antonopoulos, E. Topalis and
S. Koubias, 2007. ZRP versus DSR and TORA: A
Advanced DAIHAODV protocols using the divide and
comprehensive survey on ZRP performance. IEEE
conquer strategy, was developed for identify victim
T. Ind. Inform., 3(1): 63-72.
node, intruder detection and power consumption using Jacquet, P., P. Muhlethaler and A. Qayyum, 1998.
directional antenna. The performance factors energy Optimized Link State Routing Protocol. Internet
level are compared with AIHAODV and AODV Draft, Retrieved from: draft-ietf-manetolsr-00.txt.
protocol which proved better result. In future this Johnson, D.B. and D.A. Maltz, 1996. Dynamic Source
protocol can be enhanced with developing of dynamic Routing in Ad Hoc Wireless Networks. In:
antennas used for packet transmission which can Imielinski, T. and H. Korth (Eds.), Mobile
support the more flexible of packet delivery in mobility Computing. Kluwer Academic Publishers,
on nodes. Dordrecht, pp: 153-181.
Kuosmanen, P., 2002. Classification of ad hoc routing
REFERENCES protocols. Comput. Sci., 3(8): 574-582.
Marti, S., T.J. Giuli, K. Lai and M. Baker, 2000.
Abd Rahman, A.H. and Z.A. Zukarnain, 2009. Mitigating routing misbehaviour in mobile ad hoc
Performance comparison of AODV, DSDV and I- networks. Proceeding od the ACM/IEEE
DSDV routing protocols in mobile ad hoc International Conference on Mobile Computing
networks. Eur. J. Sci. Res., 31(4): 556-576. and Networking, pp: 255-265.
Mukherjee, B., T.L. Heberlein and K.N. Levitt, 1994.
Bace, R.G., 1998. An Introduction to Intrusion
Network intrusion detection. IEEE Network, 8(3):
Detection and Assessment. Infidel Inc., ICSA 26-41.
Incorporation. Murthy, S. and J.J. Garcia-Luna-Aceves, 1996. An
Bace, R.G., 2000. Intrusion Detection. MacMillan efficient routing protocol for wireless networks.
Technical Publishing, ISBN: 1-57870-185-6. Mobile Netw. Appl., 1(2): 183-197.
Bellur, B., R.G. Ogier and F.L. Templin, 2001. Park, V.D. and M.S. Corson, 1997. A highly adaptive
Topology broadcast based on reverse-path distributed routing algorithm for mobile wireless
forwarding (TBRPF). IETF Internet Draft, networks. Proceedings of the INFOCOM-97, 3:
Retrieved from: draftietf-manet-tbrpf-01.txt. 1405-1413.
592
 Res. J. Appl. Sci. Eng. Technol., 9(8): 583-593, 2015

Park, V. and S. Corson, 1998. Temporally Ordered Perkins, C., E.B. Royer and S. Das, 2003. Ad hoc On
Routing Algorithm (TORA) Version 1. Functional Demand Distance Vector (AODV) Routing.
Specification. IETF Internet Draft,Retrieved from: Internet Draft. RFC 3561, IETF Network Working
http://www.ietf.org/internet-drafts/draft-ietf-manet- Group.
tora-spec-01.txt1998. Stojmenovic, I. and J. Wu, 2003. Broadcasting and
Perkins, C.E. and P. Bhagwat, 1994. Highly dynamic Activity-Scheduling in Ad Hoc Networks. In:
destination sequenced distance-vector routing Basagni, S., M. Conti, S. Giordano and
(DSDV) for mobile computers. Computer I. Stojmenovic (Eds.), Ad Hoc Networking. IEEE
Communications Review, pp: 234-244. Press, Wiley, New York.
Perkins, C.E. and E.M. Royer, 1999. Ad Hoc on Wikipedia, 2004. The Free Encyclopedia. Retrieved
Demand Distance Vector (AODV) routing. from: http://en.wikipedia.org/wiki/Mobile_ad-hoc_
Proceedings of the IEEE Workshop on Mobile network (Accessed on: October 2004).
Computing Systems and Applications Yongguang, Z. and L. Wenke, 2000. Intrusion detection
(WMCSA’99), New Orleans, LA, pp: 90-100. in wireless ad-hoc networks. Proceedings of the 6th
Perkins, C. and E. Royer, 2000. Ad Hoc on Demand
Annual International Conference on Mobile
Distance Vector (AODV) Routing. Internet Draft,
Computing and Networking (MobiCom’2000),
MANET Working Group, Retrieved from: draft-
ietf-manetaodv-05.txt. Boston, Massachussetts, pp: 6-11.

593