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

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.

[1]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[2]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[3]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[4]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[5]  Ivan Stojmenovic,et al.  Broadcasting and Activity Scheduling in AD HOC Networks , 2004 .

[6]  Stavros A. Koubias,et al.  ZRP versus DSR and TORA: a comprehensive survey on ZRP performance , 2005, 2005 IEEE Conference on Emerging Technologies and Factory Automation.

[7]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[8]  Vincent Park,et al.  Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification , 2001 .

[9]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[10]  Fred L. Templin,et al.  Topology Broadcast based on Reverse-Path Forwarding (TBRPF) , 2000 .

[11]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[12]  Zuriati Ahmad Zukarnain,et al.  Performance comparison of AODV, DSDV and I-DSDV routing protocols in mobile ad hoc networks. , 2009 .

[13]  Tomasz Imielinski,et al.  Mobile Computing , 1996 .

[14]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[15]  Maung Aung Zeya Thu. Routing in ad-hoc wireless networks , 2001 .