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,

References

1. Abd Rahman, A.H. and Z.A. Zukarnain, 2009. Performance comparison of AODV, DSDV and I-DSDV routing protocols in mobile ad hoc networks. Eur. J. Sci. Res., 31(4): 556-576.
   
2. Bace, R.G., 1998. An Introduction to Intrusion Detection and Assessment. Infidel Inc., ICSA Incorporation.
   PMid:9722887    
3. Bace, R.G., 2000. Intrusion Detection. MacMillan Technical Publishing, ISBN: 1-57870-185-6.
   PMid:10931150 PMCid:PMC1905700    
4. Bellur, B., R.G. Ogier and F.L. Templin, 2001. Topology broadcast based on reverse-path forwarding (TBRPF). IETF Internet Draft, Retrieved from: draftietf-manet-tbrpf-01.txt.
   Direct Link
5. Chiang, C.C., H.K. Wu, W. Liu and M. Gerla, 1997. Routing in clustered multihop mobile wireless networks with fading channel. Proceedings of the IEEE SICON-97, pp: 197-211.
   
6. Dorothy, E.D., 1987. An intrusion-detection model. IEEE T. Softw. Eng., 13(7): 222- 232.
   
7. Giannoulis, S., C. Antonopoulos, E. Topalis and S. Koubias, 2007. ZRP versus DSR and TORA: A comprehensive survey on ZRP performance. IEEE T. Ind. Inform., 3(1): 63-72.
   
8. Jacquet, P., P. Muhlethaler and A. Qayyum, 1998. Optimized Link State Routing Protocol. Internet Draft, Retrieved from: draft-ietf-manetolsr-00.txt.
   
9. Johnson, D.B. and D.A. Maltz, 1996. Dynamic Source Routing in Ad Hoc Wireless Networks. In: Imielinski, T. and H. Korth (Eds.), Mobile Computing. Kluwer Academic Publishers, Dordrecht, pp: 153-181.
   CrossRef    
10. Kuosmanen, P., 2002. Classification of ad hoc routing protocols. Comput. Sci., 3(8): 574-582.
    
11. Marti, S., T.J. Giuli, K. Lai and M. Baker, 2000. Mitigating routing misbehaviour in mobile ad hoc networks. Proceeding od the ACM/IEEE International Conference on Mobile Computing and Networking, pp: 255-265.
    
12. Mukherjee, B., T.L. Heberlein and K.N. Levitt, 1994. Network intrusion detection. IEEE Network, 8(3): 26-41.
    CrossRef    
13. Murthy, S. and J.J. Garcia-Luna-Aceves, 1996. An efficient routing protocol for wireless networks. Mobile Netw. Appl., 1(2): 183-197.
    CrossRef    
14. Park, V.D. and M.S. Corson, 1997. A highly adaptive distributed routing algorithm for mobile wireless networks. Proceedings of the INFOCOM-97, 3: 1405-1413.
    CrossRef    
15. Park, V. and S. Corson, 1998. Temporally Ordered Routing Algorithm (TORA) Version 1. Functional Specification. IETF Internet Draft.
    Direct Link
16. Perkins, C.E. and P. Bhagwat, 1994. Highly dynamic destination sequenced distance-vector routing (DSDV) for mobile computers. Computer Communications Review, pp: 234-244.
    CrossRef    
17. Perkins, C.E. and E.M. Royer, 1999. Ad Hoc on Demand Distance Vector (AODV) routing. Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications (WMCSA’99), New Orleans, LA, pp: 90-100.
    
18. Perkins, C. and E. Royer, 2000. Ad Hoc on Demand Distance Vector (AODV) Routing. Internet Draft, MANET Working Group, Retrieved from: draft-ietf-manetaodv-05.txt.
    
19. Perkins, C., E.B. Royer and S. Das, 2003. Ad hoc On Demand Distance Vector (AODV) Routing. Internet Draft. RFC 3561, IETF Network Working Group.
    
20. Stojmenovic, I. and J. Wu, 2003. Broadcasting and Activity-Scheduling in Ad Hoc Networks. In: Basagni, S., M. Conti, S. Giordano and I. Stojmenovic (Eds.), Ad Hoc Networking. IEEE Press, Wiley, New York.
    PMid:18238032    
21. Wikipedia, 2004. The Free Encyclopedia.
    Direct Link
22. Yongguang, Z. and L. Wenke, 2000. Intrusion detection in wireless ad-hoc networks. Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom’2000), Boston, Massachussetts, pp: 6-11.
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.