AODV is a very simple, well-organized, and effectual routing protocol for Mobile Ad-hoc Networks which do not have fixed topology. This algorithm was motivated by the limited bandwidth that is obtainable in the media that are used for wireless communications. It borrows most of the beneficial concepts from DSR and DSDV algorithms. The on insist route detection and route maintenance from DSR and hop-by-hop routing, usage of node succession numbers from DSDV make the algorithm cope up with topology and routing in order. Obtaining the routes purely on-demand makes AODV a very useful and desired algorithm for MANETs. Mobile Ad Hoc Networks (MANETs) are self-organizing, rapidly deployable and with no fixed communications [9–11]. They are composed of wireless mobile nodes that can be deployed anywhere, and help to animatedly establish infrastructure using limited network management and administration [12]. Nodes in an ad hoc network may be highly mobile, or stationary, and may vary widely in terms of their capabilities and uses [12, 13]. It is hoped that in the future, ad hoc networks will emerge as an effective complement to wired or wireless LANs, and even to wide-area mobile networking services, such as Personal Communication Systems (PCS). The successful completion of mobile ad hoc networking technology presents a sole set of challenges, which differ from customary wireless systems. These include effective multi-hop routing, MAC, mobility and data management, congestion control.

Each mobile host in the network acts as a dedicated router and routes are obtained as desirable, thus creation the network self-starting. Each node in the network maintains a routing table with the routing in sequence entries to its neighboring nodes, and two divide counters: a node sequence number and a broadcast-id. When a node (source node ‘S’) has to converse with another (destination node ‘D’), it increments its broadcast-id and initiates path discovery by broadcasting a route request packet RREQ to its neighbors. The (source-addr, broadcase-id) pair is used to identify the RREQ uniquely. Then the dynamic route table entry organization begins at all the nodes in the network that are on the path from S to D.

The destination sequenced distance vector (DSDV) routing protocol is a practical routing protocol which is a alteration of conventional Bellman-Ford routing algorithm. This protocol adds a new attribute, sequence number, to each route table entry at each node. Routing table is maintained at each node and

2

This protocol was aggravated for the use of data swap along changing and arbitrary paths of interconnection which may not be close to any base station. The data transmit by each node will enclose its new succession number and the following information for each new route:

• The destination address

• The number of hops required to reach the destination and

• The new sequence number, originally stamped by the destination

Many routing solutions that have been specifically designed for WSNs have been proposed [1, 2]. In these proposals, the unique properties of the WSNs have been taken into account. These routing techniques can be classified according to the protocol operation as negotiation based, query based, QoS based, and multi-path based, as depicted. The negotiation based protocols have the objective to eliminate the redundant data by including high level data descriptors in the message exchange. In query based protocols, the sink node initiates the communication by broadcasting a query for data over the network. The multipath based protocols were initiated with objectives to provide reliability and to balance the traffic load in the network [3-5]. These protocols use multipaths in order to achieve better energy efficiency and network robustness in case of node failures. Multi-path routing protocols have been discussed in WSN literature for several years now [6]. QoS based protocols allow sensor nodes to balance between the energy consumption and certain pre-determined QoS metrics, such as delay, energy, reliability, bandwidth, etc., before they deliver the data to the sink node. A routing protocol for ad hoc wireless networks should have the following characteristics [14]:

• It must be fully distributed.

• Route computation and maintenance must involve a minimum number of nodes.

• It must be loop-free and free from stale routes.

• The number of packet collision must be kept to a minimum by limiting the number of broadcasts made by each node.

• It must optimally use scarce resources such as bandwidth, computing power, memory and battery power.

DSDV routing protocol consumes more bandwidth, because of the frequent broadcasting of routing updates. While the AODV is better than DSDV as it doesn’t maintain any routing tables at nodes which results in less overhead and more bandwidth. From the above, chapters, it can be assumed that DSDV routing protocols works better for smaller networks but not for larger networks. So, my conclusion is that, AODV routing protocol is best suited for general mobile ad-hoc networks as it consumes less bandwidth and lower overhead when compared with DSDV routing protocol.

[1] Jamal N. Al-Karaki, Ahmed E. Kamal, Routing techniques in wireless sensor networks: a survey, IEEE Journal of Wireless Communications 11 (6) (2004) 6-28. [2] Anahit Martirosyan, Azzedine Boukerche, Richard Werner, Nelem Pazzi, A taxonomy of clusterbased routing protocols for wireless sensor networks, in: The Proceedings of International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN-2008, Sydney, Australia, May, 7-9, 2008, pp.247-253. [3] Shah R, Rabaey J. Energy aware routing for low energy ad hoc sensor networks. Proceedings of IEEE WCNC’02,Orlando, FL, March, 2002; 350-355. [4] Ganesan D, Govindan R, Shenker S, Estrin D. Highly-resilient, energy-efficient multipath routing in wireless sensor networks.

[5] Ye Ming Lu, Vincent W.S. Wong, An energy efficient multipath routing protocol for wireless sensor networks, International Journal of Communication System 20 (7) (2007) 747-766. [6] Jack Tsai, Tim Moors, A review of multipath routing protocols: from wireless adhoc to mesh networks, in: The Proceedings of ACoRN Early Career Researcher Workshop on Wireless Multihop Networking, Sydney, Australia, July, 17-18, 2006 [7] R.Sumathi and M.G.Srinivas , “A Survey of QoS Based Routing Protocols for Wireless Sensor Networks” J Inf Process Syst, Vol.8, No.4, December 2012 [8] Vijayalaskhmi M, Avinash Patel, Linganagouda Kulkarni , QoS Parameter Analysis on AODV and DSDV Protocols in a Wireless Network, International Journal of Communication Network & Security, Volume-1, Issue-1, 2011. [9] Haas ZJ. Panel report on ad-hoc networks. Mobile Computing and Communications Review 1997; 2(1): 15–18. [10] Corson S, Macker J. Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations. Internet-Draft, October 1998. [11] Perkins CE. Mobile Ad Hoc Networking Terminology. Internet Draft, November 1998. [12] Alwan A, Bagrodia R, Bambos N, Gerla M, Kleinrock L,Short J, Villasenor J. Adaptive Mobile Multimedia Networks. IEEE Personal Communications Magazine 1996; 3(2): 34–51. [13] Lettieri P, Srivastav M. Advances in wireless terminals. IEEE Personal Communications 1999; 6(1): 6–19. [14] Bhagyashri. R. Hanji et al. Survey on QoS Routing protocols challenges and recent advances in MANETs, Journal of Computing Technologies 2012, ISSN 2278 – 3814