Mobile Adhoc networks are widely used across the networking world these days and there are many routing protocols in place to manage the routing across these MANETS. The Adhoc on demand distance vector routing protocol (AODV) is specially designed for the purpose of supporting both the Unicast and multicast routing across MANETs .
The basic nature of this algorithm runs on the principle like on demand, where the actual routing and the corresponding routes are built as per the decision of the source node dynamically. Source passes the instructions to add or modify the predefined routes based on the demand of networking parameters like bandwidth and congestion. A typical tree based structure is maintained by the AODV routing protocols, where this tree is composed of group members of multicast routing and the nodes connects these members. AODV is a reactive protocol even the basic characteristics of the protocol are similar to proactive protocols .
Technical implementation of AODV is done based on the Dynamic Source Routing Protocol (DSR), where it inherits the route discovery from the DSR and Destination Sequence Distance Vector (DSDV), where it inherits the concept of maintaining sequence of the hello messages being transmitted. Time based states for each node is the important and useful feature available with the AODV routing protocol, where a node which is not used recently is automatically expired. AODV updates the neighboring nodes if there is any change across the route and even in case of route failures. AODV always use a most recent route to reach the destination nodes .
Table of Contents
1.INTRODUCTION AND PROBLEM DEFINITION
2.AIMS AND OBJECTIVES
3.1 ROUTE DISCOVERY IN AODV
3.2 ABOUT DSR
3.3 ABOUT DSDV
3.4 PERFORMANCE OF TCP OVER MANETs
3.5 FACTORS RESPONSIBLE FOR LOW PERFORMANCE OF TCP OVER MANETs
3.6 BEHAVOIUR OF TCP OVER CBR
4.1 SOFTWARE REQUIREMENTS
4.2 HARDWARE REQUIREMENTs
5. RESEARCH METHODOLOGY
8.ETHICAL AND LEGAL ISSUES
This paper is written and submitted by Sujana Priya V