Stability in MANET Using AODV Routing Protocol

Stability in MANET Using AODV Routing Protocol

CHAPTER 1INTRODUCTION1.1. mobile Ad-Hoc NetworksAn ad-hoc network is a self-configuring network of wireless links connecting mobile nodes. These nodes may be routers and/or hosts. The mobile nodes communicate directly with each other and without the aid of access points, and therefore have no fixed infrastructure. They form an arbitrary topology, called peer-to-peer networks, still have a long way to go in order to be fully functional and commercial, as it has its defects such as security and routing.

Figure 1: A Mobile Ad hoc Network.

1.1.1. TYPES OF MANETA Vehicular Ad-Hoc Network or VANET is a technology that uses moving cars as nodes in a network to create a mobile network. VANET turns every participating car into a wireless router or node, allowing cars approximately 100 to 300 meters of each other to connect and, in turn, create a network with a wide range. As cars fall out of the signal range and drop out of the network, other cars can join in, connecting vehicles to one another so that a mobile Internet is created. 1.1.2. CHARACTERISTICS OF MANETDepending on the nodes geographical positions, their transceiver coverage patterns, transmission power levels, and co-channel interference levels, a network can be formed and unformed on the fly. This ad hoc network topology changes as mobile hosts migrate, disappear (failure or depletion of battery capacity), or adjust their transmission and reception characteristics. The main characteristics of MANET are:Energy Constrained Nodes: Mobile nodes rely on batteries for proper operation. Since an ad hoc network consists of several nodes, depletion of batteries in these nodes will have a great influence on overall network performance. of multi-hop communications; that is, mobile nodes that cannot reach the destination node directly will need to relay their messages through other nodes.Limited Security: Mobile wireless networks are generally more vulnerable to security threats than wired networks. The increased possibility of eavesdropping, spoofing, and denial-of-service (DoS) attacks should be carefully considered when an ad hoc wireless network system is designed.1.2. IMPORTANT OBSERVATIONS1.2.1. Merits They provide access to information and services regardless of geographic position. These networks can be set up at any place and time.1.2.2. Demerits Limited resources and limited physical security. Intrinsic mutual trust vulnerable to attacks. Lack of authorization facilities. Volatile network topology makes it hard to detect malicious nodes.1.2.3. Applications Tactical Networks: Military Communication automated Battle fields. Educational Applications: Setup virtual class & conference rooms. Entertainment: Multi-user games, robotics pets.

1.3. PERFORMANCE METRICSThe performance metrics helps to characterize the network that is substantially affected by the routing algorithm to achieve the required Quality of Service (QoS). Throughput: It is the measure of how fast a node can actually sent the data through a network. So throughput is the average rate of successful message delivery over a communication channel.Control Overhead: It is ratio of the control information sent to the actual data received at each node.Packet Delivery Ratio (PDR): It is the ratio of the total data bits received to total data bits sent from source to destination.1.4. Routing ProtocolsRouting between any pair of nodes within an ad hoc network can be difficult because the nodes can move categories that existing ad-hoc network routing protocols fall into: Table Driven Protocols Hybrid Protocols 1.4.1. TABLE DRIVEN ROUTING PROTOCOLSIt is also known as Proactive Protocols work out routes in the background independent of traffic demands. Each node uses routing information to store the location information of other nodes in the network as power and link bandwidth therefore they might not be considered an effective routing solution for Ad-hoc Networks. Fisheye State Routing is an example of a Table Driven Protocol.1.4.2. DESTINATION SEQUENCED DISTANCE VECTOR (DSDV) ROUTING PROTOCOL Every mobile station maintains a routing table that lists all available destinations, the number of hops to reach the destination and the sequence number assigned by the destination node. The sequence number is used to distinguish stale routes from new ones and thus avoid the formation of loops. The stations periodically transmit their routing tables to their immediate neighbors. A station update packet, in addition to the routing table information, also contains a unique sequence number assigned by the transmitter. The route labeled with the highest (i.e. most recent) sequence number is used. If two routes have the same sequence number then the route with the best metric (i.e. shortest route) is used.

ASRTORADSRAODV CBRP RDMARAd-Hoc Mobile Routing ProtocolOn-demand Driven/ ReactiveHybrid ZRPTable Driven ProactiveDSDV WRPCGSR STAR

Figure 2: Ad-.

1.4.3. WRP - WIRELESS ROUTING PROTOCOLEach node in the network maintains a Distance table, a Routing table, a Link-Cost table and a Message Retransmission list. . Node exchange routing tables; with their neighbors using update messages periodically as well as onlink changes. The nodes present on the response list of update message (formed using ML) are required to acknowledge the receipt of update message.If there is no change in routing table since last update, the node is required to send an idle Hello message to ensure connectivity. On receiving an update message, the node modifies its distance table and looks for better paths using tables. The node also updates its routing table if the new path is better than the existing path. On receiving an ACK, the mode updates its MRL. A unique feature of this algorithm is that it checks the consistency of all its neighbors every time it detects a change in link of any of its neighbors. Consistency check in this manner helps eliminate looping situations in a better way and also has fast convergence. The two broad issues identified in WRP can be highlighted as: A lot of memory is required as each node needs to maintain the routing table of all its direct neighbors, in addition to its own. The protocol consumes substantial amount of processing for calculating the update to the routing table since all the routing tables from its direct neighbors are used in the calculation.1.4.4. CGSR (CLUSTER-HEAD GATEWAY SWITCH ROUTING) The mobile nodes are aggregated into clusters and a cluster-head is elected. All nodes that are in the communication range of the cluster-head belong to its cluster. A gateway node is a node that is in the communication range of two or more cluster-heads. The general algorithm works in the following manner. The source of the packet transmits the packet to its cluster-head. From this cluster-head, the packet is sent to the gateway node that connects this cluster-head and the next cluster-head has mapping from each node to its respective cluster-head. Each node broadcasts its cluster member table periodically and updates its table after receiving other nodes broadcasts using the DSDV algorithm. In addition, each node also maintains a routing table that determines the next hop to reach the destination cluster.

1112Gateway nodeCluster headInternal node12465789010103 Destination

Source

Figure 3: Example of CGSR 1 to node 11.On receiving a packet, a node -head selected in step one and transmits the packet to that node However, CGSR needs to address the following issues: Degradation of network performance is caused as network is divided into clusters. The probability of network portions is very high as the battery power of the cluster-heads a gateway is extensively utilized in comparison to the ordinary nodes. 1.4.5. GLOBAL STATE ROUTING (GSR) It takes the idea of link state routing but improves it by avoiding flooding of routing messages. In this algorithm, each node maintains a Neighbor list, a Topology table, a Next Hop table and a Distance table. Neighbor list of a node contains the list of its neighbors (here all nodes that can be heard by a node are assumed to be its neighbors.). For each destination node, the Topology table contains the link. After this the node reconstructs its routing table and broadcasts the information to its neighbors. Excessive usage of bandwidth since entire topology table is broadcasted with each update. As the link state latency depends up on the update interval, thus the up-to-date information about neighboring nodes is not achieved. 1.4.6. STAR - SOURCE TREE ADAPTIVE ROUTING The simulations have been done without stating the simulation software used. Comparison was against a so called simple routing protocol, which always chooses the shortest path. It is unclear if this should be regarded as an optimal routing algorithm. The result shows some advantages (fewer route measures like routing overhead, throughput or packet latency have not been considered. So it is very unclear, if there is any benefit at all, or if the advantage of fewer repairs and reduced broadcast is consumed by the longer path-length or multiple route requests.1.5. ON- DEMAND ROUTING PROTOCOLSIt is also known as Reactive Protocols, establish routes between nodes only when they are required to route data destination. On Demand protocols are generally considered efficient when the route discovery is less frequent than the data transfer because the network traffic caused by the route discovery step is low compared to the total communication bandwidth. This makes On Demand Protocols more suited to large networks with light traffic and low mobility. An example of an On Demand Protocol is Dynamic Source Routing.

1.5.1. ABR - ASSOCIATIVELY BASED ROUTINGABR protocol is free from loops, deadlock, and packet duplicates. It defines a new metric for routing known as the tick of nodes. Each node generates a periodic beacon to indicate its existence. Associativity ticks are reset when the neighbors of a node or the node itself move out of proximity. The discussion on ABR gives rise to two main issues: The protocol relies on periodic beaconing and thus resulting in additional power consumption. The route caches are not utilized for discovery of routes leading to consumption of bandwidth.1.5.2. TORA - TEMPORALLY ORDERED ROUTING ALGORITHMThe Temporally Ordered Routing Algorithm (TORA) is a highly adaptive, efficient and scalable distributed routing, the nodes maintain routing information about adjacent nodes. The protocol has three basic functions: Route creation, Route maintenance, and Route erasure. Each node has a quintuple associated with it Logical time of a link failure A propagation ordering parameter The unique ID of the node the first three elements collectively represent the reference level. A new reference level is defined each time a node loses its last downstream link due to a link failure. The last two values define a delta with respect to the reference level. Route Creation is done using QRY and UPD packets. The route creation algorithm starts with the height (propagation ordering parameter in the quintuple) of destination set to 0 and all other node's height set to for oscillations to occur, especially when multiple sets of coordinating nodes are concurrently detecting partitions, erasing routes, and building new routes based on each other. Because TORA uses inter nodal coordination, its instability problem is similar to the "count-to-infinity" problem in distance-vector routing protocols, except that such oscillations are temporary and route convergence will ultimately occur. Certain disadvantages of TORA are given below: The protocol requires clock synchronization between the participating nodes, which is an unrealistic requirement for ad hoc environment. Route to be determined. Network congestion 1.5.3. AD HOC ON DEMAND (AODV) ROUTING The source broadcasts a route request packet. The neighbors in turn broadcast the packet to their neighbors till it reaches an intermediate node that has recent route information about the destination or symmetric links because the route reply packet follows the reverse path of route request packet. As the route notification to its upstream neighbors and so on till it reaches the source upon which the source can reinitiate route discovery if needed.

12345678SourceDestination(a) Propagation of Route Request (RREQ) Packet

Figure 4: Route A number of issues explained the functioning of AODV, namely: Requires symmetric links between nodes, and hence cannot utilize routes with asymmetric links Route caching becomes ineffective with high mobility.1.5.4. DYNAMIC SOURCE ROUTING (DSR)The Dynamic Source Routing Protocol is a source-routed on-demand routing protocol. A node maintains route caches containing the source routes that it is aware of. The node updates entries in the route cache as and when it learns about new routes. The two major phases of the protocol are: route discovery and route maintenance. When the source node wants to send a packet to a destination, it looks packet to its neighbors. To limit the number of route requests propagated, a node processes the route request packet only if it has not already seen the packet and its address is not present in the route record of the packet. A route reply is generated when either the destination or an intermediate node with current information about the destination receives the route request packet. A route request packet reaching such a node already contains, in its route record, the sequence of hops taken from the source to this node. 12345678SourceDestinationBuilding Record Route during Route Discovery

12345678SourceDestination(b) Propagation of Route Reply with Route Record

Figure 5: Creation of in DSR.

As the route request packet propagates through the network, the route record is formed as shown in Figure (a). If the route reply is generated by the destination then it places the route record from route request packet into the route reply packet. On the other hand, if the node generating the route reply is an intermediate node then it appends its cached route to destination to the route record of route request packet and puts that into the route reply packet. Figure (b) shows the route reply packet being sent. DSRP uses two types of packets for route maintenance: - Route Error packet and Acknowledgements. When a node encounters a fatal transmission problem at its data link layer, it generates a Route Error packet. When a node receives a route error packet, it removes the hop in error from its route cache. All routes that contain the hop in error are truncated at that point. Acknowledgment packets are used to verify the correct operation of the route links. This also includes passive acknowledgments in which a node hears the next hop forwarding the packet along the route. An analysis on discussion on DSR leads to emergence of five major issues: Inefficient usage of Node must support parsing of variable packet header size.1.6. HYBRID ROUTING PROTOCOLSIt combines Table Based Routing Protocols with On Demand Routing Protocols. They use distance-vectors for more precise is a change in the topology of the network. Each node in the network has its own routing zone, the size of which is defined by a zone radius, which is defined by a metric.

1.6.1. ZRP - ZONE ROUTING PROTOCOLThe Zone Routing Protocol by Zygmund Haas was first introduced. It is a hybrid protocol, which combines reactive and proactive strategies. Since the advantages of either approach depend on the characteristics of the network (like the degree of mobility), it could be beneficial to combine them. ZRP introduces the notion of a routing zone, which is a set of nodes within the local neighborhood. In practice if the target is within their own zone, or continue to broadcast. The broadcast process must take care, not to border cast requests back into regions already covered. To achieve this, queries must be recorded for some time by the relaying nodes. ZRP uses a special technique for this, called Advanced Query Detection and Early Termination. Route caching and local repair is also possible.

1.7. DISCUSSION of vs On-Demand Routing ProtocolsAs discussed earlier, table-driven routing relies on a routing table update mechanism that involves the constant propagation of routing information, which incurs substantial Signaling traffic and power consumption is always available. Table lists some basic differences between the two classes of protocols. Results for some existing ad hoc routing protocols (AODV, DSDV, DSR, and TORA) found in numerous research has concluded that AODV and DSR are two ad hoc routing protocols with overall better performance in terms of three metrics: packet delivery ratio, routing overhead and path optimality.1.7.1. TABLE 1: ON-DEMAND VS. TABLE-DRIVEN ROUTING PROTOCOLSParametersOn-demand routing protocolsTable-driven routing protocols

Availability of routing informationAvailable Always available

Periodic route updatesNot requiredRequired

Dealing with Link breakageUse route discoveryPropagate i to neighbours to maintain consistent routing table.

Routing over headIncreases with mobility of nodesprotocols

1.7.2. TABLE 2: COMPARISON OF PROACTIVE AND REACTIVE ROUTING PROTOCOLS

Proactive ProtocolsReactive protocols

Attempt to maintain node to every other node in the network.A route is built only when required.

Constant.No unless there is a change in the topology.

IncurssubstantialtrafficandpowerConsumption, which is generally scarce in mobile computers.

Does not incur substantial traffic andpower contion compared to TableDriven routing protocols.

First packet is less when comparedWith on-demand protocols.First-packet -drivenprotocols because a route needs to be built.

A route to node in ad-hocNetwork is always available.Not available.

In the situation with smaller number of nodes and lower load and/or mobility, DSR outperforms AODV; otherwise, AODV outperforms DSR. Because DSR places a source route header in each packet, DSR becomes more expensive than AODV in larger network topologies and/or at higher load except at higher

chapter 2 literature surveyWon-Suk Kim et al [1] In this paper, the optimized routing protocol for multi-interface multi-channel wireless mesh networks (MIMC-WMNs). The MIMC-WMNs using original AODV (Ad hoc On-demand Distance Vector) routing protocol which defined in IEEE 802.11s standard can cause several problems, because of proposed routing protocol will be analyzed when it applied to the MIMC-WMNs. Also, the routing protocol will be evaluated by several experiments in outdoor test bed with real mesh routers we implemented. The proposed routing protocol reduced by up to 72% of the number of management frame, and also increased by up to 37% of the path quality.Mohannad Ayash et al [2] Ad-hoc On-demand Distance Vector (AODV) routing protocol is the most popular routing protocol for mobile ad-hoc networks (MANETs). This paper enhances AODV protocol by minimizing its control messages overhead. Enhancements include developing two improved versions of AODV protocol. These two versions use Global Positioning System (GPS that the two proposed protocols outperform the original AODV, where the results show a significant reduction of control overhead and delay compared to the original AODV. Results also show that the delivery ratio in the proposed protocols is comparable to the delivery ratio in the original AODV.Yang Hua et al [3] As mobile ad hoc networks of mobile nodes in the topology changes frequently lead to the data transmission link was broken. In view of this situation, the analysis of R-AODV routing. Finally, through NS simulation experiments to compare AODV routing protocol, R-AODV routing protocol, SR-AODV routing protocol packet arrival rate, end to end delay, etc., indicating that SR-AODV routing protocol than the R-AODV routing protocol and AODV routing protocol more advantages.Dharmendra Sutariya et al [4] Vehicular Ad hoc Network (V ANET) is a new communication paradigm that enables the communication between vehicles on the road network which falls in two categories: 1) Vehicle to Vehicle (V2V) and 2) Vehicle to Infrastructure (V2I). In this paper, propose a routing protocol IAODV (Improved AODV) that ensures giving timely and accurate information to drivers in V2V communication compare to AODV protocols in city scenarios of vehicular ad hoc networks. protocol in terms of Avg. End-to-End Delay, Packet Loss Ratio, Packet Delivery Ratio and Normalized Routing Load.Simulation results show that IAODV performs better than AODV protocol in given city scenarios of VA NETs.Li Qiong et al [5] This paper researches optimization problems of AODV Routing Protocol in wireless sensor networks. In order to make more extensive use of the AODV routing protocol, AODV routing protocol needs improved optimization. The routing table in AODV maintains only one route to the speed is less than a threshold value. Simulation results show that this method can decrease the average delay, throughput and routing load, and improve the capability of the network.Zhi-yuan LI et al [6] In this paper, modified R-AODV routing protocol, designed to improve the performance of Ad Hoc networks. Firstly describe the characteristics of routing protocols AODV and R-AODV that lack, and for this deficiency, a stability routing protocol base on Reverse AODV (SR-AODV). Finally, through the NS2 simulation, compared to the AODV routing protocol, R-AODV routing protocol and SR-AODV packet delivery ratio, end to end delay, etc., that SR-AODV routing protocol is more advantages than the R-AODC and the AODV routing protocol.Yang Hua et al [7] Paper has been modified AODV routing protocol, designed to improve the performance of Ad Hoc networks. The paper first describes the characteristics of routing protocols AODV that lack, , end to end delay, etc., that M-AODV routing protocol is more advantages than the AODV routing protocol.Abdusy Syarif et al [8] In mobile ad hoc networks (MANET), routing protocol plays the most important role. For more than one decade, Ad hoc on-demand Distance Vector (AODV) routing protocol becomes attention network. In this paper, proposed a new variant of routing protocol AODV by combining two protocols, R-AODV and AODV+, called it R-AODV+, so it will be able to be implemented in hybrid ad hoc networks. The reason of proposed R-AODV+ protocol to be achieved is the best performance and reliable. Nodes that attain a connection to the Internet will be able to have access with a gateway node support. In this work, performed a simulation using NS-2 and measured the performance of the proposed protocol by measuring the routing overhead, end-to-end delay and packet delivery ratio. The result of the simulation shows that proposed protocol outperformed AODV+.Ben Ding et al [9] The rise in the number of vehicles has led to a rapid increasing need for vehicle communication today. The emerging Vehicular Ad Hoc Network (VANET) is becoming more and more important, which can provide intelligent transportation application, comfort application and other services for people in vehicles. In order to provide stable routes and obtain good performance in suffers poor performances when it is applied in VANET directly. So in improved AODV routing protocol in VANET, make two steps optimization in route discovery and route selection process to improve the route stability and decrease overhead. Simulation results show that our proposed AODV protocol can get better performances in forms of link stability and packet delivery ratio.Chao Dong et al [10] Due to the bandwidth-limited wireless broadcast channel and node mobility in Mobile Ad hoc Networks (MANETs), reactive on-demand routing protocols have attracted extensive attention because that the routes are established only when required. Ad hoc On-Demand Distance Vector (AODV) routing protocol is a prominent on-demand one which has been used widely. However nodes information of the received packets are sufficient for the nodes with most distance-vector routing protocols to discover the coding opportunity effectively. Then we implement AODV routing protocol with Coding Opportunity Discovery (AODV-COD) and evaluate its performance by simulation. The results show that implementation is effective and AODV-COD can increase network throughput in comparison with AODV.Baozhu Li, Yue Liu and Guoxin Chu et al [11] The paper presents the Vehicular Ad hoc Networks and the typical routing protocol: the ad hoc on-demand routing protocol (AODV) in mobile ad hoc networks and the optimized protocol AODV OBD for protocol AODV; also presents a practical mobility simulate the two routing protocols in ad hoc networks based on Linux and then compares and analyses the simulation results and do performance evolution. Also infer that AODV OBD routing protocol induces the packet delay to a certain extent compared with AODV routing protocol.Zhongyu Cao et al [12] AODV (Ad Hoc On-Demand Distance Vector) protocol is an on-demand protocol specialized for ad hoc network and it has been used as a mesh routing in 6LoWPAN (IPv6 over IEEE 802.15.4). In order to adapt to the hardware sources especially energy source restrictions of 6LoWPAN, propose S-AODV (Sink Routing Table over AODV) routing, a new AODV implementation designed to provide benefits in terms of traffic reduction, power consumption and AODV is reduced by using SRT (Sink Routing Table). By the new mechanism, the delay and energy consumption of the connection between each internal common node and the sink are reduced.Zhang Jianwu et al [13] Presents an improved mobile Ad Hoc Network on-demand routing protocol which based on AODV by controlling the broadcasting of RREQ information. This protocol analysis the lifetime of node when implementing routing discovery, and avoiding the unnecessary information sending efficiently. By compare AODV with IAODV in the same scenario, the new protocol is much better than AODV in terms of packet delivery ratio as well as routing load.Md. Monzur Morshed et al [14] Mobile Ad-hoc Network is an infrastructure less and decentralized network which need a robust dynamic routing protocol. Many routing protocols have been proposed to accommodate the needs of communications for MANET. In this paper compared the performance of traditional proactive DSDV routing protocol along with on-demand reactive routing protocol, the simulation results were analyzed by graphical manner and trace file based on QoS metrics such as Delay, Jitter. The performance differentials have been analyzed based on network load, mobility, and network size. The simulation result analysis verifies the DSDV and AODV routing protocol performances.C. Gomez et al [15] The IEEE 802.15.4 standard is expected to enable a wide variety of envisaged low-cost control and monitoring applications with relaxed throughput requirements and a strong emphasis on power conservation. A routing protocol is needed for the mesh topology approach, which must take into account the very limited features of the network. In this paper provide a three-fold designed to provide benefits in terms of data delivery latency, network reliability and power consumption, especially in dynamic topology networks. Finally, evaluate the tradeoffs and most critical features of our solution in a real IEEE 802.15.4 mesh sensor network test bed.N Thanthry et al [16] Needless to say the importance of Mobile Ad-hoc networks has been increasing everyday because of its Ad-hoc network routing protocols choose the number of hops (shortest path) as the metric for data transfer which may not lead to stable paths. Thus, these unstable routes are prone to degrade the network performance. A metric based enhanced version of Ad-hoc On Demand Distance Vector routing protocol (AODV) called Enhanced Metric Based Ad-hoc On Demand Distance Vector Protocol (EMAODV) is presented. This new metric characterizes the stability of the paths by taking primarily three parameters viz. affinity, available bandwidth and battery level into routing decisions. The EM-AODV protocol maintains multiple paths to the is backed by the simulations in Glomo Sim that show an overall reduction in number of packet drops, route discovery frequency, control overhead and an increase in the packet delivery ratio.M.Ramakrishnan et al [17] The Ad hoc On Demand Distance Vector (AODV) routing protocol is a highly efficient routing protocol intended for use by mobile nodes in an ad hoc network. The main highlight of this protocol is the usage of destination sequence number which omits problems like counting to infinity problem or the formation of loops which are associated with other classical distance vector the power consumption and delay time so that the mobile device's battery life time is extended in an unpredictable temporary communication network in case of an emergency like floods, earthquakes and on mountains where there is no scope for construction of required infrastructure and also helps in military applications.Riri Fitri Sari et al [18] This paper presents work on the test bed implementation of hybrid ad hoc network. In Mobile Ad hoc NETwork (MANET), nodes are equipped with wireless device which provides self-managing and self-organizing capability, even when there is no network infrastructure present. Ad hoc hybrid network which enables mobile nodes to form instant communication without depending on infrastructure network can communicate with the other devices through LAN or (PDA), and evaluate the packet delivery ratio, end-to-end delay, and routing overhead of different Ad-hoc Hybrid network topologies. The test bed implementation results for the average packet delivery ratio is 99.57%, and the end-to-end delay is 1.004 s and the routing overhead is 1, 36036 bps.Parkpoom Manoyut et al [19] Wireless sensor networks are widely used in many applications such as environment monitoring, intelligent transportation system (ITS) and health care monitoring. In wireless sensor. Therefore, focus on the existing ad-hoc routing protocol named AODV which is widely applied in from 20 to 36%. In addition, the routing overhead in term of dropped packet is better than the original AODV. The number of CBR drop and the energy usage in the network are also reported and analyzed in this paper.Ahed M. Alshanyour et al [20] Bypass-AODV, a local recovery protocol, is proposed to enhance the performance of AODV routing protocol by overcoming several inherited problems such as unnecessary error recovery invocations, newly non-optimal reconstructed routes, high packet drop ratios, and high routing overheads. Bypass-AODV uses cross-layer MAC-notification to identify mobility-related link break, and then setup a bypass between the broken-link end nodes via an alternative node while keeps on the rest of the route. Therefore, Bypass-AODV enhances resource utilization by avoiding unnecessary error recovery cycles and consequently increases the network CP connections. Further, the ratio of packet drop is reduced from 16% to 2%. Moreover, considering the hop count, the Bypass-AODV shows less sensitivity to the ongoing number of TCP connections.Hetal Jasani et al [21] A set of wireless mobile nodes communicate with each other without using any fixed infrastructure in mobile ad hoc network (MANET). MANET devices usually communicate in a seamless manner. There are multiple routing protocols that have been developed for MANETs. There is a need to support VoIP applications in MANETs as they gain popularity and require an efficient routing protocol. Many voice applications have strict requirements such as delay, jitter, etc. This work evaluates the performance of AODV and DSR by comparing the results while are concluded for these protocols.Hoda M. Hassan et al [22] This paper presents an implementation of an Intrusion Detection System (IDS) aiming to secure the AODV protocol designed for MANET. The IDS is designed as multiple static agents that run on a subset of the nodes in the network and executes a monitoring protocol that observes the process of route establishment. The monitoring protocol uses specification based intrusion detection to identify misuses to the routing messages. The IDS design is a correlation of previous work done in the field of MANET security. The IDS is implemented using ns-2 simulator and its ability to detect attacks was tested using previously devised attack scripts. Detailed specification for the runtime behavior of the AODV protocol was derived in the process of implementation.Carles Gomez et al [23] Real world MANET routing protocol implementations generally use layer three mechanisms for carrying out connectivity maintenance tasks. In many cases, such mechanisms are based on periodical transmission of Hello messages. When topology changes occur frequently, usage of higher Hello rates than default may lead to higher end-to-end connectivity and available bandwidth. However, in rather static conditions, low Hello rates are adequate to avoid unnecessary of the proposed solution.Ian D. Chakeres et al [24] In this paper AODVjr, a simplified version of the AODV protocol, is described. AODVjr is compared in simulation to a full featured AODV implementation. The results show that AODVjr performs as well as AODV and describes other positive effects of a smaller protocol specification. Yuxia Lin et al [25] There have been various secure routing protocols proposed for mobile ad hoc networks. There has been a lack of work related to the performance of secure routing protocols in real network test bed. In this paper, quantitative results for the performance comparisons between AODV and SAODV routing protocols by using a small-scale experimental test bed, which consists of 10 laptops within a 250 m by 100 m rugby field. Apart from outdoor testing, also compare the results with those obtained via simulation and indoor emulation. The workload includes both UDP and TCP traffic. Results show that SAODV is effective in preventing routing message tampering and data dropping attacks. For outdoor experiments, also estimate the average distance within a communication gray zone under different bit rates.Pattana Wannawilai et al [26] Congestion is a major problem in mobile ad hoc network (MANET) which causes long delay and significant loss of data packets, and increases the routing overhead and battery power consumption. The shortest path route seldom offers the optimal route, especially when it traverses Aware (AODV+SBA) routing protocol which significantly improves the performance of on-demand routing protocols by discovering better routes to avoid congestion and reducing excessive routing overhead. The ns-2 simulation results illustrate the improvement of network performance and stability by reducing data packet delay and routing overhead and increasing packet delivery ratio, under high traffic load. Moreover, in case of low-to-medium traffic load, its performance is close to the popular AODV routing protocol and the quality of its properties is maintained.Uttam Ghosh et al [27] In this paper, propose an identity (ID) based scheme that secures AODV and transmit TCP data to the authorized hosts. The proposed scheme secures the AODV using sequential aggregate signatures (, the scheme is secure against the attacks that are associated with AODV and TCP in MANET. Performance analysis shows that proposed scheme is secure and efficient against various types of attacks with fairly good overhead.Elizabeth M. Belding-Royer et al [28] While increasing a nodes transmission range allows fewer hops between a source and destination and enhances overall network connectivity, it also increases the probability of collisions and reduces the effective bandwidth seen at individual nodes. To enable formation of multihop ad hoc networks, a routing protocol is needed to provide the communication and route studies the effects of transmission range on AODVs multicast performance by examining the results achieved at varying transmission ranges and network configurations. Misagh Mohammadizadeh et al [29] Secure routing is one of the most important topics in the wireless MANETs networks. MANET networks don't have a central infrastructure for the management of routing in the networks. Each node independently routes and sends packets, so many attacks such as forging, such as SAODV, ARAN and SEAR have improved security and performances. SEAODV uses HEAP authentication Scheme with symmetric cryptography and one-way hash function for protection of routing packets, show through theoretical examination and simulation, that SEAODV provides better security with significantly less overhead than other existing secure AODV protocols.A.Pravin Renold et al [30] In Mobile Ad hoc Networks (MANETs), nodes (mobile devices) are located in a self organized way external attacks caused by malicious nodes present in the network. In this paper implemented an approach based upon trust to provide security to Ad hoc On-demand Distance Vector (AODV) protocol, which helps AODV to detect the compromised nodes. This proposed approach is able to detect the compromised nodes and isolates it from the network. The reliability of the trusted AODV routing protocol is evaluated by implementing black hole attack and the performance is calculated in terms of metrics like packet delivery ratio, throughput and average end to end delay. The evaluation of trusted AODV with black hole attack has been done with the help of QualNet 5.0 simulator. Bagwari, A. et al [31] A mobile ad hoc network (MANET) consists of mobile wireless nodes. The communication between these mobile nodes is carried out without any centralized control. The ease of deployment and the infrastructure less nature of Mobile Ad hoc Networks (MANETs) make them highly desirable for the present day multimedia communications. Traditional routing protocols may not like end-end delay, throughput, date drop and network load. Finally, this paper conducts simulation experiments in the conditions where improve QoS of MANET Network performance. Chakeres, I.D. et al [32] To date, the majority of ad hoc routing protocol research has been done using simulation only. One of the most motivating reasons to use simulation is the difficulty of creating a real implementation. In a simulator, the code is contained within a single logical component, which is clearly defined and accessible. On the other hand, creating an implementation requires use of a, the design possibilities and the decisions for our ad hoc on-demand distance vector (AODV) routing protocol implementation, AODV-UCSB. This paper is meant to aid researchers in developing their own on-demand ad hoc routing protocols and assist users in determining the implementation design that best fits their needs.Li, Shibao et al [33] Global flooding and expanding ring search are two commonly used methods in searching for an interested object in multi-hop wireless networks. Global flooding is not scalable for large networks. To take advantage of expanding ring search, in this paper, propose an improved evaluation using simulation modeling and compare HP-ERS-AODV with both ERS-AODV and Flood-AODV. Tianyi Xing et al [34] Nowadays, dynamically adjusting routing protocol parameters according to different and specific network scales is becoming a breakthrough of the Ad Hoc routing protocol research. In this paper, estimation function to original AODV protocol to get the information of the max hop of the networks. The Dynamic-Adjusting AODV(DA-AODV) based on max hop count first calculates the value of max hop of the networks and then intelligently and dynamically adjusts its parameters based on the value of max hop to enhance the network performance. Finally, ns2 simulation results show that DA-AODV based on max hop count can significantly reduce the routing protocol overhead and enhance the networks throughput performance in networks of different scales.Ghanbarzadeh, R. et al [35] Mobile ad hoc networks are special kind of wireless networks, there is no fixed structure in these networks but they have nodes movement ability that adds their complexity. These networks are outing protocol performance by using link availability prediction in urban area by Hello message mechanism. In order to modeling urban employed Manhattan mobility model for node's movement. The results of simulations show that new method reduces message overhead and average of broken links metrics relative to classic AODV algorithm.Jiao Wen-Cheng et al [36] The running process of AODV protocol mainly includes two processes, routing find and routing maintenance. AODV protocol uses the method of hop-by-hop routing to transmit packets. Wormhole attack is a special attack method aimed at Ad hoc network. Based on the analysis of AODV protocol and the attack conditions of wormhole attack, the process and algorithm aimed at wormhole attack are researched. At last, a method to improve AODV protocol is put forward.P.Parvathi et al [37] An ad hoc network is a collection of wireless mobile nodes that wish to communicate without any fixed infrastructure or centralized control. It is a self-configuring network of mobile nodes connected by wireless links the union of which forms an arbitrary topology. Therefore, routing in MANET is a critical task due to highly dynamic environment. Several protocols are introduced for improving the routing mechanism to find route between any source and destination host across the network. This paper focuses on the three popular routing algorithms Cluster Based presenting their characteristics, functionality, benefits and limitations.Zoulikha Mekkakia Maaza et al [38] This paper present a full performance analysis of an energy conserving routing protocol in mobile ad hoc network, named EM-AODV (Energy Multi-path Ad-hoc On-demand Distance Vector routing). EM-AODV is a reactive routing protocol which combines two mechanisms used in the basic AODV protocol. AODV and most of the on demand ad hoc routing protocols use single route reply along reverse path. Rapid change of topology causes that the route reply could not arrive to the source node, i.e. after a source node sends several route request messages, the node obtains a reply message, and this increases in power consumption. To avoid these problems, also propose a mechanism which tries multiple route replies. The second mechanism proposes a new adaptive approach which seeks to incorporate the metric "residual energy " in the process route selection, Indeed the residual energy of mobile nodes were considered when making routing decisions. The results of simulation show that protocol EM-AODV answers better energy conservation.Royer, E.M. et al [39] The Ad hoc On-Demand Distance Vector (AODV) routing protocol is designed for use in ad hoc mobile networks. Because of the difficulty of testing an ad hoc routing protocol in a real-world environment, a simulation was first created so that the protocol design could be tested in a variety of scenarios. Once simulation of the protocol was nearly complete, the simulation was used as the basis for an implementation in the Linux operating system. In the course of converting the simulation into an implementation, certain modifications were needed in AODV and the Linux kernel due to both simplifications made in the simulation of AODV and to incompatibilities of the Linux kernel and the IP-layer to routing in a mobile environment. This paper details many of the changes that were necessary during the development of the implementation.V.K.Taksande et al [40] A mobile ad hoc network (MANET) represents system of wireless mobile nodes that can self-organize freely and dynamically into arbitrary and temporary network topology. Routing is the task of directing data packets from a source node to a given destination. The main method for evaluating the performance of MANETs is simulation. This paper is subjected to ad hoc On Demand Distance Vector (AODV) routing protocol, performance with IEEE 802.11 Mac protocol in chain topology for various number of nodes and evaluated its performance.Ehsan, H. et al [41] From the security perspective Mobile Ad hoc Networks (MANETs) are amongst the most challenging research areas and one of the key reasons for this is the ambiguous nature of insider attacks in these networks, a major feature that research has lately lacked is a detailed and comprehensive study of the effects of various insider attacks on the overall performance of MANETs. In this paper investigate, in detail, some of the most severe attacks against MANETs namely the black hole attack, sinkhole attack, selfish node behavior, RREQ flood, hello flood, and selective forwarding attack. A detailed NS-2 implementation of launching these attacks successfully using Ad hoc On-Demand Distance Vector (AODV) routing protocol has been presented and a comprehensive and comparative analysis of these attacks is performed.Yu-Doo Kim et al [42] Wireless network industry for the ubiquitous generation is growing quickly. Especially, IEEE 802.15.4 is one of special issues of the networking technology for sensor network. Then, many researchers are studying it for enhanced performance. But many researchers are not focusing on developing routing protocol. So, proposed improved AODV routing protocol in previous research. But it had studied about performance analysis based on IEEE 802.11. In this paper, proposed improved routing protocol using AODV (Ad hoc On-demand Distance Vector) for sensor network. The simulation result is analyzed and compared based on IEEE 802.11 and IEEE 802.15.4.Dr. Aditya Goel et al [43] This research work proposes a new protocol that modifies AODV to improve its Performance using Ant Colony algorithm. The mobility behavior of nodes in the application is modeled by the random waypoint model through which random locations to which a node move are generated, and the associated speed and pause time are specified to control the frequency at which the network topology is changed. The Optimized-AODV protocol incorporates path accumulation during the route discovery process in AODV to attain extra routing information. It is evident from the results that Optimized- AODV improves the performance of AODV under conditions of high load and moderate to high mobility. Anurag Porwal et al [44] A mobile ad-hoc network is a collection of mobile nodes forming an ad-hoc network without the assistance of any centralized structures. These networks shows a new way of network establishment and these are well suited for an environment where either the infrastructure is lost or where deploy an infrastructure is not very cost effective. In this paper worked to solve the problem of intermediate route building in Ad hoc on demand distance vector routing protocol (AODV) and proposed scheme that enhances the performance of AODV protocol. The scheme proposed by us is Advance-Ad hoc on demand distance vector (AAODV) routing protocol. It consists of the use of Ad-hoc On demand Distance Vector with Backup routing (AODV-BR) and concept of local recovery with limited TTL value in case of failure of local recovery in first attempt i.e. if the neighboring node of the node that find the link break do not have path to destination in its alternate routing table.V.K.Taksande et al [45] This paper is subjected to Ad hoc On Demand Distance Vector (AODV) routing protocol, performance with IEEE 802.11 Mac protocol in chain topology for various number of nodes and evaluated its performance. In this paper, investigated the performance metrics namely throughput by varying network size up to 55 nodes through NS-2 simulation. Almost always the network protocols were simulated as a function of mobility, but not as a function of network density in chain topology. The main interest of this paper is to test the ability of AODV routing protocol to react on chain network topology as number of nodes changes. Xuedong Liang et al [46] In this paper, investigate the use of cooperative communications for quality of service (QoS) provisioning in resource-constrained wireless sensor networks, and propose MRL-CC, a Multi-agent Reinforcement Learning based multi-hop mesh Cooperative Communication mechanism for wireless sensor networks. In order to disseminate data reliably in MRL-CC, a multi-hop mesh cooperative structure is first constructed. Then a cooperative mechanism with cooperative partner assignments and coding and transmission schemes is implemented using a multi-agent reinforcement learning algorithm. Compare the network performance of MRL-CC with MMCC, a Multi-hop Mesh structure based Cooperative Communication scheme, and investigate the impacts of network traffic load, interference and sensor node's mobility on the network performance. Simulation results show that MRL-CC performs well in terms of a number of QoS metrics, and fits well in large-scale networks and highly dynamic environments.Zhenhui Cui et al [47] Based on the characteristics of the wireless sensor networks, a middleware layer for quality of service support was proposed. For kinds of users QoS requirements, tasks of network were scheduled by collecting and updating local information continuously and the reliability of network was enhanced by redundancy. Results of simulation show that the middleware mechanism can not only meet the user QoS requirements, but also reduce the energy consumption of network.Prabhat Singh et al [48] In MANETs, the protocol is selected on the basis of how the data is delivered and how its integrity is maintained. Hence, before making the selection of any routing protocol we should make the performance analysis of various routing protocol. In this paper, performance analysis of various routing protocols Ad-hoc On-Demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA), Optimized Link State Routing (OLSR) and Destination Sequenced Distance Vector (DSDV) are carried out using NS2 simulator. Compare the performance of these routing protocols on the basis of various parameters such as throughput, packet delivery ratio, delay and control overhead.Pravin Ghosekar et al [49] A mobile ad hoc network (MANET), sometimes called a mobile mesh network, is a self-configuring network of mobile devices connected by wireless links. The Ad hoc networks are a new wireless networking paradigm for mobile hosts. This paper attempts to provide a comprehensive overview of dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas of Manets characteristics, capabilities and applications.Syed Fakhar Abbas et al [50] The main focus behind is to save resources (bandwidth) while using routing protocols. While deploying MANETs, a number of challenges involve like network scalability, Quality of Services (QoS), energy utilization, security, privacy measures, bandwidth optimization and dynamic topology etc. In this paper an effort has been made to compare the performance of different routing protocols using multimedia application (video traffic). Protocols which are being analyzed in this paper are: AODV, DSR TORA and OLSR. The performance parameter includes Data Dropped, Delay, Load, Media Access Delay, Retransmission attempt and throughput.

chapter 3 OBJECTIVES AND METHODOLOGY3.1. OBJECTIVEThe objective of this work is to find out stable path in between source and destination and the when intermediate node alive during communication are not consider in communication path. For achieving this objective we use AODV routing protocol to find out the stable path in between source and destination.

3.1.1. PROBLEM FORMULATIONThe highly dynamic nature of MANETs results in frequent and unpredictable changes in the network topology, which add to the difficulty and complexity to routing among the mobile nodes within the network. Thus, establishing communication among mobile nodes is a great challenge in itself. The applications as the coverage area increases the packet drop ratio also increases due to mobility of the node, thus degrading the network performance and Quality of Service (QoS).We will use AODV as a base protocol which is a class of Reactive protocol to design optimized routing algorithm.

3.2. METHODOLOGY/ PLANNING OF WORKIn order to achieve the above objective, following outline is proposed:Evaluation and Analysis of existing Ad-Hoc routing protocols: The assessment and study of different protocols will help in better understanding of the basic characteristics and functioning of the protocols.Design and development of the proposed routing protocol: Based upon the knowledge of previous routing protocol will verification and validation through all Location Based Routing Protocol.For validation of propose we use MATLAB to simulate the propose routing protocol and then compare with other Routing Protocol.

REFERENCES[1] Won-Suk Kim and Sang-Hwa Chung Design of Optimized AODV Protocol for Multi-Interface Multi-Channel Wireless Mesh Networks, IEEE, 2013.[2] Mohannad Ayash and IEEE, 2012.[3] Yang Hua and Zhiyuan, Simulation and Anlysis of A Stability Reverse AODV Routing Protocol, IEEE, 2012. [4] Dharmendra Sutariya and Dr. Shrikant Pradhan An Improve AODV Routing Protocol for VANETs in City Scenarios, IEEE, 2012.[5] Li Qiong and Yang Jun, An Improved AODV Routing Protocol of Wireless Sensor etwork, IEEE, 2011.[6] Zhi-yuan LI and Hua Yang, [7] Yang Huya and Zhi-yuan LI, A Stability Routing Protocols base on Reverse AODV, Haryanti and Riri Fitri Sari Adding Gateway Mode for R-AODV Routing Protocol in Hybrid Ad Hoc Network, IEEE, 2011. [9] Ben Ding, Hui [10] Chao Dong, Rui Qian and Hai Wang AODV Routing Protocol with Coding Opportunity Discovery, IEEE, 2010.[11] Baozhu Li, Yue Liu and Guoxin Chu, Optimized AODV Routing Protocol for Vehicular Ad hoc Networks, IEEE, 2010.[12] Zhongyu Cao and Gang Lu, S-AODV: Sink Routing Table over AODV Routing Protocol for 6LoWPAN, IEEE, 2010.[13] Zhang Jianwu, Zou Jingyan Qi, MANET Routing Protocol for Improving Routing Discovery Based on AODV, IEEE, 2010. [14] Md. Monzur Morshed and Md. Habibur Rahman, Performance Evaluation of DSDV and AODV Routing Protocols in Mobile Ad-hoc Networks, IEEE, 2010.[15] C. Gomez, P.Salvatella,Q.Alonso and J.Paradells, Adapting AODV for IEEE 802.15.4 Mesh Sensor Networks, IEEE, 2006.[16] N.Thanthry and S.R. Kaki, EM-AODV: Metric Based Enhancement to AODV Routing Protocol, IEEE, 2006.[17] M. Ramakrishan, FPGA Routing Protocol in MANET, IEEE, 2006.[18] Riri Fitri Sari, Abdusy Syarif, and Bagio Budiardjo, Performance Evaluation of AODV Routing Protocol on Ad hoc Hybrid Network Test Bed Using PDAs, IEEE, 2006.[19] Parkpoom Manoyut and Wannarat Suntiamorntut, Modified Local Repair in AODV for LoWPANs, ICUIMC, Kuala Lumpur, Malaysia.[20] Ahed M.Alshanyour and Uthman Baroudi, Bypass AODV: Improving Performance of AODV Routing Protocol in Wireless Ad Hoc Networks, ICST, Quebec, Canada.[21] Hetal Jasani, Evaluations of AODV and DSR for QoS Requirements, RIIT, Calgary, Alberta, Canada.[22] Hoda M.Hassan and Mohy Mahmoud Protocol Using Specification Based Intrusion Detection, Torremolinos, Malaga, Spain.[23] Carles Gomez and Alex Cuevas, AHR: A Two-State Adaptive Mechanism for Link Connectivity Maintenance in AODV, Florence, Italy, 2006.[24] Ian D. Chakeres and Luke Klein Berndt, AODVjr, AODV Simplified, Maryland, USA, 2006. [25] Yuxia Lin and Vincent W.S. Wong between SAODV and AODV Routing Protocols, Columbia,Vancouver, BC, Canada, 2006.[26] Pattna Wannawilai and Chanboon Sathitwiriyawong, AODV With Sufficient Aware Routing Protocol, Caen,France .[27] Uttam Ghosh and Raja Dutta, Identity Based Secure AODV and TCP for Mobile Ad Hoc Networks, IEEE, Kerala, India.[28] Elizabeth M.Belding- Royer, Implementation study of the AODV routing protocol, Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA.[29] Misagh Mohammadizadesh, and Seyad Mohammmad Safi, SEAODV Routing Protocol for MANETs Networks, ICIS, Seoul, Korea.[30] A. Pravin Renold and R.Parthasarathy, Source Based Trusted AODV Routing Protocol for Mobile Ad hoc Networks, IEEE, Chennai, India.[31] Bagwari, A. and Jee, R., Performance of AODV Routing Protocol with Increasing the MANET Nodes and its Effects on QoS of Mobile Ad Hoc Networks, IEEE, 2005.[32] Chakeres, I.D. and Belding-Royer, E.M., AODV Routing Protocol Implementation Design, IEEE, 2012.[33] Li, Shibao, Jia, Wei, AODV route protocol research based on improved ERS algorithm, IEEE, China University of Petroleum, Dongying, China.[34] Tianyi Xing, Yuanan Liu, Bihua Tang and Fan Wu, Dynamic-Adjusting AODV Routing Protocol Based on Max hop count, Beijing University of Posts and Telecommunications, China.

[35] Ghanbarzadeh, R. and Meybodi, M.R., Reducing Message Overhead of AODV Routing Protocol in Urban Area by Using Link Availability Prediction , Comput. Eng. Dept., Islamic Azad Univ., Heris, Iran.[36] Jiao Wen-Cheng, Peng Jing and Zheng Jian-Ling, Research and Improvement of AODV Protocol in Ad Hoc Network Dept. of Comput. Eng., Ordnance Eng. Coll., Shijiazhuang, China.[37] P.Parvathi, Comparative Analysis of CBRP, AODV, DSDV Routing Protocols in Mobile Ad-hoc Networks, ICIS.[38] Said Khelifa and Zoulikha Mekkakia Maaza, An Energy Multi-path AODV Routing Protocol in Ad Hoc Mobile Networks, IEEE.[39] Royer, E.M. and Perkins, C.E. An implementation study of the AODV routing protocol, Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA.[40] V.K. Taksande, An Extensive Simulation Analysis of AODV Protocol with IEEE 802.11 MAC for Chain Topology in MANET, IEEE.[41] Ehsan, H. and Khan, F.A. , Malicious AODV: Implementation and Analysis of Routing Attacks in MANETs, Dept. of Comput. Sci., Nat. Univ. of Comput. & Emerging Sci., Islamabad, Pakistan.[42] Yu-Doo Kim, Il-Young Moon and Sung-Joon Cho, A Comparison of Improved AODV Routing Protocol Based on IEEE 802.11 and IEEE 802.15.4, IEEE, Korea Aerospace University, Republic of Korea.[43] Dr. Aditya Goel & Ajaii Sharma, Performance Analysis of Mobile Ad-hoc Network Using AODVProtocol, Deemed University Bhopal, India.[44] Anurag Porwal1, and Rohit Maheshwari3, Study and Design of New Reactive Routing Protocol Advance AODV for Mobile Ad hoc Networks, IJERA.[45] Dr.K.D.Kulat and V.K. Taksande, Simulation Analysis of AODV Protocol with IEEE 802.11 MAC for Chain Topology in MANET, IEEE. [46] Xuedong Liang and Min Chen, A Novel Cooperative Communication Protocol for QoS Provisioning in Wireless Sensor Networks, IEEE, University of British Columbia.[47] Zhenhui Cui and Linchuan Li, A Design of Middleware Layer for QoS in Wireless Sensor Networks, IEEE, Key Laboratory of Smart Grid of Ministry of Education, Tianjin University. [48] Ravi Kumar and Prabhat Singh, Performance analysis of AODV, TORA, OLSR and DSDV Routing Protocols using NS2 Simulation, IJIRSET. [49] Pravin Ghosekar, Mobile Ad Hoc Networking: Imperatives and Challenges, IEEE and IJCA.[50] Syed Fakhar Abbas, MANET Routing Protocols for Real-Time Multimedia Applications, IEEE, Lahore Pakistan.

S.R.M.I.E.T. Khora - Bhura, Kurukshetra University 2