# Introduction ireless networks can be broadly classified into infrastructure based wireless network and infrastructure wireless networks or Ad-hoc networks. In Ad-hoc networks, the nodes are mobile and routing between source and destination node is achieved by intermediate nodes acting as routers if it not in radio range. As Ad-hoc networks are highly dynamic, routing protocols plays a crucial role to achieve quality of service. Other important factors to be considered in Ad-Hoc networks are dynamic networks topology, frequently of network updates, scalability, security and energy required. Basically MANET [1] is a group of wireless computing devices like Laptop, Mobile phone, Personal Digital Assistant (PDA) or similar devices. In Ad-hoc networks routing protocols are broadly classified into proactive (table driven) routing protocol, reactive (On-demand) routing protocols and hybrid protocols. In proactive routing each node in the Ad-hoc network maintains a table or tables containing routing information of the network. Any node that needs to transmit data can start transmitting data using routes already present in the routing table enabling immediate data transmission. Popular proactive routing protocols include Destination sequence distance vector (DSDV) [2] routing protocol ,Wireless routing protocol (WRP) [3] and Optimized link state routing protocol (OLSR) [3] .The advantages of proactive routing protocols is it update its routing table irrespective of data traffic. Unlike table driven routing protocols, Reactive protocols update routing information only when a route is required by a source node to transmit data. Reactive routing protocols reduce the control overhead which is advantageous in high mobility networks whereas periodic updates in routing information leads to significant increase in networks overheads even when there is no data transmission between nodes in the networks. Some of the popular Ad-hoc routing protocols falling in this category are Dynamic Source Routing (DSR) [4], Ad-hoc On demand Distance Vector (AODV) [4] [5]routing and Temporarily Ordered Routing Protocols (TORA) [4]. AODV is considered to be the best out of many Reactive protocols but its performance degrades when nodes or link fails as with the dynamic mobility of nodes, damaging of nodes etc. In this paper we had successfully upgrades several factors like performance, throughput, load delay etc. even at time of nodes or links fails in AODV routing protocol by enhancing in its algorithm. # II. # Aodv Routing Protocol AODV is an adaptation of Destination Sequenced Distance Vector (DSDV) protocol used in wired networks and overcomes the shortcomings of DSDV in wireless environment. AODV eliminates the counting to infinity problem faced in other distance vector protocols by implementing a sequence number. Unlike DSR which carries the entire route between the source and destination in the packet, the nodes in AODV carry only the next hop information corresponding to each data flow. Being a reactive routing protocol route is discovered as and when needed and the Author ?: e-mail: asifullahkhan@gmail.com A route discovery is initiated [6] when one of the nodes in the network wants to send a data packet to another node. If an active route is not available AODV initiates the route discovery process with the source node broadcasting a route request message (RREQ) to find a route to the destination. The route is found either with the RREQ reaching the destination or an intermediate node in the network which has "fresh enough" route to the destination with the sequence number equal to or greater than the sequence number contained in the RREQ. Once a valid route is found it is made available by a route reply (RREP) message back to the originator of the RREQ. Once the route is established the nodes monitor the state of the links continuously. If a link breaks in an active route, a route error message (RERR) is sent to the other nodes of the link breakage. This initiates a new route discovery process. The advantages of AODV routing protocol is the selection of the least congested route instead of the shortest path. AODV supports both uncast and multicast data transmission. Performance is not drastically affected even if the topology changes continuously. Since source routing is not used, there are no additional overheads in the data. # III. The Previous Algorithm And their Problem From the recent up gradations in the AODV routing protocol its had been cleared that they are using the shortest path to start the transmission [7] and also consider or selection of the path on a factor like weak node [8] , delay function [9] .and at the time of path breaks, due to node or link fails, several handling procedure or algorithm had been developed so far from traditional [10] to improvising the local repair procedure [11] ,selecting [12]and performance evaluation [13] node disjoint path identifying the performance [14] , Security [15] [16] ,and also modifying [17][18]the traditional and improvising local repair algorithm which will increase packet delivery ,delay, and other several factors. By considering all the recent updating in AODV, they didn't provide result satisfactory or they provide but under certain constraints. So it is needed to improve AODV with all recent updates to achieve better performance, throughput and packet deliver and several other factors which can be achieve under any situation or constraints and also even frequent path breaks due to node or links broken. IV. # The Proposed Algorithm The proposed algorithm will be as followsa) Send hello packet from source (RREQ) to discover all path available from source to destination. b) During discovery phase, i. Every nodes must updates its cell in its routing table (named as delay factor) ii. Every node must update its cell from its routing table (name as short distance to destination) by calculating the minimum number of hops to reach to destinations. e) As grades reaches to 0, enhanced path search operation will start on the basis of following steps -Assigning the grade equivalent to 10 to all nodes to a selected path whose 'ng' (nodes grades) is smaller or equivalent to threshold value 'th' and ng is calculated as specified in formula 1 ng= Shortest path distance to destination In order to evaluate or compare several factors between proposed and previous algorithm, both the algorithm is implemented in Network simulator in Windows by creating as Linux environment .After executing both the algorithm, several factors had been compared in Table 1 specified below by considering 50 nodes and for 100 seconds. --formula 1 Delay functions basis of the above table many compared graphs can be draw which really proves that it is better than previous. In graph Fig. 2, shows that proposed send more number of packet as compare to old .And also ensure that as time is increase its packet delivery ration will increase. # Figure 3 : Overhead Analysis In graph Fig. 3 ,shows that overhead packets is higher in old as compared to proposed algorithm which can degrades the performance .And also ensure that less number overhead as time is increase. The above graph Fig. 4 and Fig. 5, shows that proposed algorithm shows that lost of UDP packet is less than old algorithm and received packet received is high than old. Now we compared on the basis of TCP connection in a graph Fig. 7 and Fig. 8 which may have impact on the network. In graph Fig. 4, shows that throughput of proposed algorithm will be increase as time than old algorithm and thus its efficiency will increase. # Conclusion The above simulation result proves that the proposed algorithm works highly effectively and efficiently as on compared with old algorithm and therefore upgrading the performance, throughput, delay, load factor, packet ratio delivery fraction ,throughput etc and also even at the time of node or links fails or even in case of mobility factor. 2013![Global Journals Inc. (US)Global Journal of Computer Science and TechnologyVolume XIII Issue XVI Version I routes are maintained as long as they are required.](image-2.png "W © 2013") 1![Figure 1 : Flow chart of AODV Protocol messaging](image-3.png "Figure 1 :") ![c) During the propagation phase, shortest path is selected to begin the packet transmission and assign 10 as grade to all the intermediate nodes in this path d) Depending upon the acknowledgment of every packet received its degrades or upgrades grade values assigned to them.](image-4.png "") 2![Figure 2 : Packet Delivery Ratio Analysis](image-5.png "Figure 2 :") 45![Figure 4 : Throughput Analysis](image-6.png "Figure 4 :Figure 5 :") 6![Figure 6 : UDP Analysis Old Scheme Time](image-7.png "Figure 6 :") 7![Figure 7 : TCP Analysis Proposed Scheme Time](image-8.png "Figure 7 :") ![Designing the E-AODV (E as Enhanced) Routing Protocol to improvise it During the Nodes or Links FailGlobal Journal of Computer Science and TechnologyVolume XIII Issue XVI Version I](image-9.png "") 8![Figure 8 : TCP Analysis Old Scheme Time V.](image-10.png "Figure 8 :") 1ParameterProposed PreviousSEND63716142RECV60875760ROUTINGPKTS45416156Packet Delivery Fraction (PDF )95.5493.78Normal Routing Load (NRL)0.751.07Average e-e delay(ms)215.88378.98No. of dropped data (packets)321454No. of dropped data (bytes)296384425828By considering the above table its had beenclear that the proposed algorithm provides betteraspects as compare to previous algorithm. And on the EDesigning the E-AODV (E as Enhanced) Routing Protocol to improvise it During the Nodes or Links Fail EDesigning the E-AODV (E as Enhanced) Routing Protocol to improvise it During the Nodes or Links Fail * Ad-hoc Networking CPerkins 2001 Addison-Wesley * zhou-zw02@mails "security Enhancement Over Ad-Hoc Aodv RoutingZongweizhou Protocol Beijing, China Tsinghua University tsingh ua.edu.cn * Node Prediction -Routing in Mobile Ad Hoc Networks Saleem T. Arulldoss AlbertSheik Aalam Victorie 2011 © EuroJournals Publishing, Inc * Performance Analysis of Ad-Hoc Network under Node Failure AlankarShastri PallaviKhatri ShilpiJain 1 IJCTEE_0910_32.pdf volume * Ad-hoc on-demand distance vector routing CPerkins ERoyer Proc of. 2nd IEEE Workshop. Mobile Computing. Systems and Applications (WMCSA 00) of. 2nd IEEE Workshop. Mobile Computing. Systems and Applications (WMCSA 00) 1999 * Performance Analysis of Ad-Hoc Network under Node Failure PallavikhatriAlankarshastri ShilpiJain IJCTEE_0910_32..pdf * Dynamic reverse route for on-demand routing protocol in MANET MegatZuhairi HaseebZafar DavidHarle 10.3837/tiis.2012.02.006 May 25. 2012 * MaamarSedrati Azeddine Bilami and Mohamed Benmohamed "M-AODV :AODV variant to improve quality of service in MANETs" IJCSI vol 8 issue 1January 2011 www.IJCSI.org * A quality of service based AODV with QoS -Aware routing algorithm for MANET MPushpavalli A MDr Natarajan N ;Annitha HRHr VSharma Asha Ambhaikar 2 2 February 2013 * Improved AODV protocol for solving link failure in MANET Mohabey 10 october 2012 3 * On Demand Local Link Repair Algorithm for AODV Protocol JyotiJain RoopamGupta TKBandhopadhyay International Journal of Computer Applications 35 5 December 2011 * New multipath nodedisjoint Routing based on ADOV protocol VZangeneh SMohammadi World Academy of Science, Engineering and Technology 52 2011 * Performance evaluation Of Node disjoint multipath routing protocol based on AODV for manets &Vidya Kudachi Vvnod Jadhav ; Alankarshastri ShilpiPallavikhatri Jain 2013 Performance Analysis of Ad-Hoc Network underNode Failure. IJCTEE_0910_32..pdf * "security Enhancement Over Ad-Hoc Aodv RoutingZongweizhou Protocol Beijing Tsinghua University China zhou-zw02@mails.tsing hua.edu.cn * Black hole attack in AODV routing protocol :A Review ChanchalAghi ChanderDiwaker ijarcsse.com Issue4 April 2013 www 3 * Improvising the Adhoc on demand distance vector (AODV) routing protocol when nodes or links fails AISOBE -Nov 4 BrijeshSoni ArjunRajput 2012 Biplab Kumar sarkar * Biplab Kumar sarkar "An noval approach to ehance the Adhoc on demand distance vector (AODV) routing protocl when nodes or links fails " CSEE'13 (UACEE ) BrijeshSoni ArjunRajput Feb 2013 24