Home            Contact us            FAQs
    
      Journal Home      |      Aim & Scope     |     Author(s) Information      |      Editorial Board      |      MSP Download Statistics

     Research Journal of Applied Sciences, Engineering and Technology


Advanced AODV Protocol for Identify Victim Nodes Using Divide and Conquer Strategy in MANET

1S. Hemalatha and 2Paul Rodrigues
1Anna University
2DMI College of Engineering, Chennai, Tamil Nadu, India
Research Journal of Applied Sciences, Engineering and Technology  2014  14:1648-1655
http://dx.doi.org/10.19026/rjaset.8.1146  |  © The Author(s) 2014
Received: May ‎31, ‎2014  |  Accepted: July ‎01, ‎2014  |  Published: October 10, 2014

Abstract

Objective of this study is there are many protocols have been proposed in Ad-hoc network, but none of the protocol is working under the principle of handling and checking on packet delivery. We have developed a routing protocol called the Advanced Ad-hoc on demand Vector protocol. 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 contains several stages from path discovery, packet transmits, apply divide and conquer strategy on route, identify the victim node which is not forward the packet, redirect the new path, alert all the nodes about the victim node. Finally performance graph has been given compared with AODV protocol.

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. Bellur, B, R.G. Ogier and F.L. Templin, 2001. Topology Broadcast Based on Reverse-Path Forwarding (TBRPF). IETF Internet Draft, draftietf-manet-tbrpf-01.txt. Retrieved form: http://www.ietf.org/ internet-draft/draft-ietf-manet-tbrpf-01.txt (Accessed on: 2 March, 2001).
    Direct Link
  3. Chiang, C.C., H.K. Wu, W. Liu and M. Gerla, 1997. Routing in clustered multi-hop mobile wireless networks with fading channel. Proceeding of IEEE SICON-97, pp: 197-211.
  4. 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.
  5. Jacquet, P., P. Muhlethaler, A. Qayyum, A. Laouiti and L. Viennot, 1998. Optimized Link State Routing Protocol. Internet Draft, draft-ietf-manetolsr- 00.txt. Work in Progress, June 2001.
  6. 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, The Netherlands, pp: 153-181.
    CrossRef    
  7. Kuosmanen, P., 2002. Classification of ad hoc routing protocols. Finnish Defence Forces, Naval Academy, Finland. Retrieved form: Direct Link
  8. Murthy, S. and J.J. Garcia-Luna-Aceves, 1996. An efficient routing protocol for wireless networks. Mobile Netw. Appl., 1(2): 183-197.
    CrossRef    
  9. Park, V.D. and M.S. Corson, 1997. A highly adaptive distributed routing algorithm for mobile wireless network. Proceedings of 16th Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution INFOCOM-97, 3: 1405-1413.
    CrossRef    
  10. Park, V. and S. Corson, 1998. Temporally Ordered Routing Algorithm (TORA) Version 1, Functional specification. IETF Internet Draft. Retrieved form: http://www.ietf.org/internet-drafts/draft-ietf- manet –tora–spec-01.txt1998.
    Direct Link
  11. Perkins, C.E. and P. Bhagwat, 1994. Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. ACM Comput. Commun. Rev., 24(4): 234-244.
    CrossRef    
  12. Perkins, C.E. and E.M. Royer, 1998. Ad Hoc on demand distance vector (AODV) routing. Internet-Draft, Aug-1998.
    Direct Link
  13. Perkins, C.E. and E.M. Royer, 1999. Ad-hoc on demand distance vector routing. Proceeding of 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp: 90-100.
    CrossRef    
  14. Perkins, C.E. and E.M. Royer, 2000. Ad Hoc On-demand Distance Vector (AODV) Routing. Internet Draft, MANET Working Group, draft-ietf-manetaodv-05.txt, March 2000.
  15. Perkins, C.E., E.M. Royer and S. Das, 2003. Ad hoc On-demand Distance Vector (AODV) Routing. Internet Draft, RFC 3561. IETF Network Working Group, July 2003.
    CrossRef
  16. 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    
  17. Wikipedia, 2004. The Free Encyclopedia. Retrieved form: http://en.wikipedia.org/wiki/Mobile_ad-hoc_network (Accessed on: Oct. 2004).
    Direct Link

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.

ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Information
   Sales & Services
Home   |  Contact us   |  About us   |  Privacy Policy
Copyright © 2024. MAXWELL Scientific Publication Corp., All rights reserved