Adaptive Enhancement of routing protocol under CBR and TCP traffic source Manish Singh Chaudhary M.TECH (Computer Technology) National Institute Of Technology Raipur, India chaudharymanishsingh8@gmail.com Mrs. Varsha Singh Assistant Professor (Electrical Engineering Department) National Institute Of Technology Raipur, India vs@nitrr.ac.in Abstract—The main objective of this article is to study and enhance on demand routing protocol under different traffic consideration so that our proposed routing protocol give an better result then other reactive and proactive routing protocol . we used TCP and CBR based traffic to analyze the above said protocol based on the basis of Average end-to-end delay and Number of data packet received. We will investigate how proposed algorithms are for routing in MANET will behave under highly congested network. This paper also results the comparison graph of Enhanced-AODV, AODV, DSR, DSDV done on ns2. Keywords-E-AODVs, NS-2(Network Simulator) I. INDRODUCTION As the importance of computers in our daily life increases it also sets new demands for connectivity. A Mobile Ad-Hoc Network (MANET) is a multi-hop wireless network which forms a temporary infrastructure- less network and communicates with each other and support de-centralized administration. Quick and easy deployment of ad-hoc network makes them feasible to use in battlefield environments, disaster relief and conference. In MANET, nodes can move independently thus, each node function as a router and forward packet. Due to high node mobility network topology changes frequently. Therefore, routing in ad-hoc network becomes a more challenging task. Therefore it become recent research area in MANETs, Many routing protocol have proposed for ad hoc network for finding routes in the literature[1][4][6], with the advance of wireless communication low cost and powerful trans-receiver are widely used in mobile application. The main aim of this paper is to perform comparative analysis between reactive and proactive routing protocol. They are Ad hoc on Demand Distance Vector(AODV), Dynamic Source Routing(DSR) are reactive and Destination Sequence Distance Vector(DSDV) are proactive routing protocol in variable pause time for a constant number of nodes to bring out their relative advantages. The main objective is to understand their internal mechanism of working and suggest in which situations where one is preferred than the other. II. DESCRIPTION OF ROUTING PROTOCOL A. Ad-Hoc on Demand Distance Vector (AODV) AODV [1][2] routing algorithm is a reactive routing protocol designed for ad hoc mobile networks. AODV builds routes using a route request / route reply query cycle. When a source node desires a route to a destination for which it does not already have a route, it broadcasts a route request (RREQ) packet across the network. Nodes receiving this packet update their information for the source node and set up backwards pointers to the source node in the route tables. In addition to the source node's IP address, current sequence number, and broadcast ID, the RREQ also contains the most recent sequence number for the destination of which the source node is aware. A node receiving the RREQ may send a route reply (RREP) if it is either the destination or if it has a route to the destination with corresponding sequence number greater than or equal to that contained in the RREQ. If this is the case, it uni-casts a RREP back to the source. Otherwise, it rebroadcasts the RREQ. Nodes keep track of the Manish Singh Chaudhary et al. / International Journal on Computer Science and Engineering (IJCSE) ISSN : 0975-3397 Vol. 4 No. 05 May 2012 763