Dynamic Source Routing Research Articles

An investigation on applicability of Ad-hoc routing protocols in Fog-assisted smart health care system

Cloud computing is widely adopted as it provides real-time services to users on a respectable scale in alignment with pay-per-use models. The heterogeneity and lively characteristics of the cloud network's components make failure inevitable. The failure also has an impact on the cloud service's dependability and accessibility. A computer paradigm called fog brings cloud computing services closer to edge hardware. Fog computing is being used more and more in applications that require faster real-time services, and the healthcare industry has embraced it heavily due to the urgent need to save lives. This work is aimed to investigate the suitable ad-hoc routing protocol for fog-assisted smart health monitoring system. By simulating with the network simulator NS-2 and using throughput, latency, and packet delivery ratio (PDR) as assessment criteria, the effectiveness of routing protocols is assessed. The protocols Ad-hoc on-demand Distance Vector (AODV), Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), and Optimized Link State Routing (OLSR) are being tested. The AODV exhibits encouraging results with other comparative protocols.

Impact of Jellyfish attack on routing protocols in TCP-based MANETs

Mobile ad-hoc networks (MANETs) are self-organized infrastructure-less network of mobile wireless devices that could be deployed for communication. Due to the insecure wireless communication medium, multi-hop routing communication process, and dynamic behavior of the nodes in MANETs, routing protocols are vulnerable to various security attacks, such as Jellyfish attacks. A Jellyfish node targets TCP-based MANET and exploits its working mechanism to degrade the communication performance. This attack is hard to detect since it is a TCP protocol compliant methodology.In this paper, we evaluate the performance of the Ad hoc on-demand vector (AODV), Dynamic source routing (DSR), Temporally ordered routing algorithm (TORA), Geographic routing protocol (GRP), and optimized link state routing (OLSR) routing protocols under the Jellyfish delay variance attacks for TCP-based MANETs. Further, the TAHOE, RENO, and SACK variants of TCP protocol are considered for comparison. These routing protocols are simulated using the OPNET simulator to compare their performance, using specific performance metrics on the network. The experimental results show that the AODV protocol performs better than the DSR, TORA, OLSR, and GRP protocols under the jellyfish delay variance attack. Further, the SACK TCP variant performs better than the other TCP variants under the Jellyfish delay variance attack.

Detection and Counter Measure of Packet Misrouting by GPS-Free Positioning of Ad-Hoc Nodes

The ad-hoc networks are a developing area of research with a large and wide variety of applications and related requirements. The nodes participating in an ad-hoc network use different routing protocols to send their packets from one node to another. But most of the time, the ad-hoc network is not suitable for urgent needs. For this, an ad-hoc network GPS-free positioning system can be used in emergency situations to save people in danger. Nodes participating in an ad-hoc network choose the best route from various nodes near them to send information through the complex system. For this, we have used trust dynamic source routing (TDSR) in our research work to determine and design the best route to transmit information, and we designed this system with the aim of being able to be used in emergencies. We have compared our proposed routing protocols with dynamic source routing (DSR) and found out that TDSR is working excellent.

Analysis of the Dynamic Source Routing Protocol on the Performance of File Transfer Protocol and Video Conference Services in the Mobile AdHoc Network Simulation

Current technological advancements make it easier for users to do their work effectively and efficiently, including the use of wireless networks to exchange data via File Transfer Protocol (FTP) and video conferencing services (VCS). A Mobile AdHoc Network (MANET) is a wireless network technology that applies a dynamic set of nodes. Data transmission on the MANET does not require the use of devices such as base stations. Because each node on the MANET can act as a router in determining the direction of the data sent, the number of nodes in the MANET will influence the quality of the data sent. Using the OPNET Modeler simulator, this paper shows how to assess the quality of FTP and VCS based on delay, jitter, and packet loss parameters. The simulation scenario employs five, fifteen, and thirty nodes with low, medium, and high traffic loads, using the Dynamic Source Routing (DSR) protocol. According to the measurement results, the FTP service with the bad category is the packet loss parameter in high traffic loads, which has the highest packet loss value of 56.6 percent with 15 nodes. In contrast, good results for VCS are only produced on the delay parameter. The jitter increases with the number of nodes, and it is 5 in this case. In all scenarios, the packet loss parameter yields poor results, with the highest packet loss value approaching 100%.

Performance evaluation of dynamic source routing protocol with variation in transmission power and speed

<span lang="EN-US">Mobile ad-hoc network (MANET) is a set of mobile wireless nodes (devices) which is not rely on a fixed infrastructure. In MANETs, each device is responsible for routing its data according to a specific routing protocol. The three most common MANET routing protocols are: dynamic source routing protocol (DSR), optimized link state routing protocol (OLSR), and ad-hoc on-demand distance vector (AODV). This paper proposes an efficient evaluation of DSR protocol by testing the MANETs routing protocol with variation in transmission power at different speeds. The performance analysis has been given using optimized network engineering tools (OPNET) modeler simulations and evaluated using metrics of average end to end delay and throughput. The results show that the throughput increases as the transmission power increases up to a certain value after which the throughput decreases, also the network work optimally at a certain transmission power which varied at different speed.</span>

Dynamic source routing protocol with transmission control and user datagram protocols

Dynamic source routing protocol (DSR) is a common routing protocol in wireless network without infrastructure, called ad-hoc network, DSR used just above internet protocol (IP) at the network layer. The upper transport layer provides reliability by transmission control protocol (TCP) and user datagram protocol (UDP). The choice between DSR/TCP and DSR/UDP is an actual issue for network designers and engineers. The question arises: which one provides better quality of service (QoS) parameters, less delay and jitter, greater throughput, and data rates. This paper focuses on the study and analysis of DSR and comparison of DSR/TCP and DSR/UDP by simulation in network simulator (NS2) environment. Another comparison of DSR and ad hoc on-demand distance vector (AODV) is provided. Design and simulation of the protocols in ad hoc network accurately describe the behavior in real system and QoS parameters are obtained.

Performance Analysis by Improving Energy Efficiency in IoT Based Wireless Sensor Network for Routing Algorithm

Objectives: To improve the energy efficiency in IoT-based wireless sensor networks. To increase the sensor node lifetime in any wireless sensor network (WSN) based on the Energy-efficient cluster and routing in WSN. The advancement in the electronic industry has to develop the low powerconsuming and low-cost devices for multiple purposes. Methods: A new algorithm is proposed to improve the energy efficiency in IoT-based WSN for routing algorithms. The low power consuming devices are wisely chosen for the respected application and their power management. This study is intended to provide efficient routing algorithms with less energy consumption in wireless sensor networks. Findings: A wireless sensor network deployed with a number of non-static nodes in a communication network are beneficial for numerous fields such as the military, medical sector, structural health monitoring, transportation industries, etc. In this paper, the performance parameters like average throughput, average end-to-end delay, packet delivery ratio, average node energy, and normalized routing load are analyzed. Novelty: We designed and simulated the Distributed IoT-based wireless network system to analyze the information of nodes roaming in the vicinity of the zone area. In proposed technique energy efficiency is increased compared to the conventional algorithm. In node centric routing protocol, energy efficiency is increased from 55% to 68%. In data centric routing protocol, energy efficiency is increased from 65% to 75%. In source-initiated routing protocol, energy efficiency is increased from 68% to 80%. In destination-initiated routing protocol, energy efficiency is increased from 72% to 85%. Keywords: Ad Hoc OnDemand stance Vector (AODV); DestinationSequenced DistanceVector Routing (DSDV); Dynamic source routing (DSR); MQ Telemetry Transport (MQTT); Quality of Services (QoS); Wireless Sensor Network (WSN)

Design and analysis of energy aware interior gateway routing algorithm with particle swarm optimization

SummaryIn wireless sensor networks (WSNs), the data must reach a processing node with less energy consumption and delay rate. However, with the specific consideration of the unique properties of sensor networks such as limited power, stringent bandwidth, dynamic topology due to node failures, adding/removing nodes, or even physical mobility, high network density and large‐scale deployments have posed many challenges in the design and management of sensor networks. These challenges have demanded energy awareness and robust protocol design. Efficient utilization of the sensor's energy resources and maximizing the network lifetime were the primary design considerations for the proposed work. As a result, the new interior gateway routing with particle swarm optimization (IGRPSO) is presented with minimal latency and a higher packet delivery ratio in WSN; optimum link weights are calculated in a fraction of the original data to the new protocol. Network entropy maximization is a conceptual framework that guides the development of the protocol and the computational techniques required to determine which traffic distributions are not only best but also realizable through link‐state routing. Therefore, a routing algorithm provides the optimal and economically optimal route. We used the MATLAB simulation environment to compare and contrast the performance of the dynamic source routing (DSR) protocol and enhanced interior gateway routing protocol, DSR protocol with particle swarm optimization with that of the IGRPSO protocol, which has the maximum packet delivery ratio of 75.74% and less packet drop of 25.37%, less energy consumption of 0.3674 J.

Weight-Based Clustering Algorithm for Military Vehicles Communication in VANET

In vehicular ad-hoc network (VANET), every vehicle node indicates a mobile node and it acts as a transmitter, receiver and router for the delivery of the information. VANET is a subgroup of mobile ad-hoc network (MANET) and is related to the dynamic topology. Dynamic network scenarios are more challenging issues as compared to MANET topologies, so finding a suitable algorithm for all VANET applications is the major challenge for the researchers. Routing protocols in VANET are divided into six parts i.e., cluster-based, geocast-based, topology-based, position-based, and broadcast-based. Autonomous robots and unmanned military vehicles (UMVs) become part of the advanced warfare strategy to execute dangerous war field operations and military combat missions. The military vehicles (MVs) transfer information to each other in order to achieve required military tasks collectively. In the proposed work, rhombus shaped area is divided into multiple clusters using a weight-based clustering algorithm for transmitting the event information to the vehicles. Intersection clustering with rhombus shaped area which are very effective for clustering. To choose cluster head (CH), the proposed method has used two weighted metrics, one is real time average speed and the other parameter is degree. This work is useful for choosing right CH in the network. Each vehicle in the same cluster transmits the data to the CH instead of broadcasting it. The simulation has been done in the SUMO and NETSIM simulator, which shows the network performance for the different protocols like Ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR) in terms of packet delivery ratio, throughput, delay, overhead transmission, mean and standard deviation.

Analysis of Latency and Bandwidth for Edge-Based Short Length in Edge Computing Devices for Short Ranges and Long Ranges

Objectives: To propose an IoT-based design in an edge computing environment for short ranges and long ranges of real-time data streaming to the client. Methods: Multimedia data is used in this work. Here we have used Opnet for creating a physical architecture and to analyze the quality-of-service parameters like delay, throughput, and jitter for different Ad-hoc routing protocols like Ad-hoc on-Demand Distance vector routing, Dynamic source routing, Optimized Link State Routing, Temporally ordered routing algorithm and Geographic Routing Protocol for edge-based short length in edge computing devices for short ranges and long ranges. Riverbed academic modeler (formerly known as OPNET) has been used as a simulation tool to analyze the latency and bandwidth for edge computing under the pre-configured set-up. The simulation is accomplished using MATLAB to find the fluctuation of the delay, throughput, and jitter for edge-based short length in edge computing devices for short ranges and long ranges by applying the datasets in the edge computing environment. Findings: The results we got through simulations from different routing protocols like AODV, DSR, OLSR, TORA, and GRP of delay, throughput, and jitter shows that the proposed system strengthens the existing cloud-based system, leading to greater QoS.AODV surpasses all other protocols with a minimal delay of 0.24 msec and OLSR achieves the best performance with an average delay of 0.3 msec, better throughput of 180 bits/sec, and a load of 1410 bits/sec for the three key parameters of latency, throughput, and jitter. Novelty: The study compares the performance of different routing protocols and shows a reduction in the delay of 0.24 msec with respect to time as compared to other existing works. The proposed research is designed for a media streaming application based on the mobile nodes regarded as an edge devices fordifferent QoS parameters like throughput, delay, and load, and by comparing the existing work we found that AODV outperforms all other routing protocols with a minimum delay. Keywords: Edge Computing; Cloud Computing; Latency; Bandwidth; Throughput; Jitter

Energy consumption analysis of DSR reactive routing protocol on mobile ad-hoc network

Mobile ad-hoc network is a connection between mobile devices that uses wireless media. Mobile devices on the network hereinafter referred to a nodes. This network does not have an administrative center so each node on the network in addition to functioning as a sender and receiver of data information also functions as a router that will look for route information from the sender to the receiver. The topology of an ad-hoc network is always changing because the nodes move dynamically. The topology changes resulted in the repetition of route information searches. The process of finding route information requires a routing protocol. The routing protocol-enabled nodes must maintain the energy usage in the route-finding mechanism. Choosing the right routing protocol can be a solution to make energy use by nodes more efficient, especially in ad-hoc networks. In this study, a routing protocol in the reactive category is used, namely DSR (Dynamic Source Routing). This study aims to determine the performance of energy consumption, remaining energy, and PDR with scenarios of increasing node movement speed and network area. Based on the research results, it is known that the DSR routing protocol can handle changes in the speed of node movement and network area related to energy consumption and remaining energy. This is evidenced by the results of research showing that with faster node movements and wider areas, less energy is required. Meanwhile, regarding the success of packet delivery, the DSR routing protocol cannot handle changes in the speed of node movement and network area. This is evidenced by the results of the packet delivery ratio measurement which shows that with faster node movements and wider areas, many packets are not successfully received.

Virtual Local Area Network Performance Improvement Using Ad Hoc Routing Protocols in a Wireless Network

Wireless Communication has become one of the most popular types of communication networks because of the many services it provides; however, it has experienced several challenges in improving network performance. VLAN (Virtual Local Area Network) is a different approach which enables a network administrator to create a logical network from a physical network. By dividing a large network into smaller networks, VLAN technology improves network efficiency, management, and security. This study includes VLAN for wireless networks with mobile nodes integration. The network protection was improved by separating the connections and grouping them in a way that prevents any party from being able to contact unauthorized stations in another party using VLAN. VLAN demonstrated restricted access to private server data by managing traffic, improving security, and reducing levels of congestion. This paper investigates the virtual local area network in a wireless network with three ad hoc routing protocols in a number of different scenarios, using the Riverbed Modeler simulation, which was used as a simulation program in this study. It was found from the investigation process that adopting VLAN technology could reduce delay and data of the network and considerably lower throughput, which is a major drawback of VLAN. Ad hoc routing algorithms, including AODV (Ad Hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), and OLSR (Optimized Link State Routing) routing protocols, were used to improve the delay and throughput of the network. Routing methods with VLAN were tested across the WLAN to obtain the best throughput gain performance. The findings also revealed that these ad hoc routing protocols improved the Wireless Sensor Network performance as an additional investigation for the improvement of any network’s delay and throughput.

Comparative Analysis of Low and High Scalable VANET in terms of Receive Rate, Packets Received, MAC/PHY Overhead and Average Goodput

The modern advancements in mobile and wireless communications have made an tremendous change in human lifestyles. Mobile Ad-hoc Networks (MANETs) are self-organized and self-configured networks consisting of moving nodes that communicate through wireless communication systems. Vehicular Ad-hoc Network (VANET) is a special category of MANETs with some distinctive set of characteristics. Some common features of VANET are its use of multi-hop communications between mobile vehicles with limited bandwidth and self-organization of the moving vehicles. Also, VANET is differed from MANET by the feature of high mobility of nodes. One significant advantage of VANET over MANET is that the computing devices get continuous power from its vehicles. Scalability refers to a VANET's ability to accept a rising number of communicating vehicles without experiencing disruption or loss in data transfer or traffic loading, which increases administrative complexity and reduces network performance. Because of its difficult properties, designing a scalable and robust network is an open topic of research in VANET. When VANETs go from sparse to dense mode, or from high mobility to slow traffic conditions, several design methods fall short. The performance metrics Average Goodput, MAC/PHY overhead, packet received, and receive rate over four VANET routing protocols- Ad-hoc On Demand Vector (AODV), Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), and Optimized Link State Routing (OLSR) in a defined area. The results showed that DSR performed well in average goodput,MAC/PHY overhead, receive rate, and packets received in low and highly scalable scenarios.

Efficient Optimal Routing Algorithm Based on Reward and Penalty for Mobile Adhoc Networks

Mobile adhoc networks have grown in prominence in recent years, and they are now utilized in a broader range of applications. The main challenges are related to routing techniques that are generally employed in them. Mobile Adhoc system management, on the other hand, requires further testing and improvements in terms of security. Traditional routing protocols, such as Adhoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), employ the hop count to calculate the distance between two nodes. The main aim of this research work is to determine the optimum method for sending packets while also extending life time of the network. It is achieved by changing the residual energy of each network node. Also, in this paper, various algorithms for optimal routing based on parameters like energy, distance, mobility, and the pheromone value are proposed. Moreover, an approach based on a reward and penalty system is given in this paper to evaluate the efficiency of the proposed algorithms under the impact of parameters. The simulation results unveil that the reward penalty-based approach is quite effective for the selection of an optimal path for routing when the algorithms are implemented under the parameters of interest, which helps in achieving less packet drop and energy consumption of the nodes along with enhancing the network efficiency.

Authentication of WSN for Secured Medical Data Transmission Using Diffie Hellman Algorithm

The applications of wireless sensor network (WSN) exhibits a significant rise in recent days since it is enveloped with various advantageous benefits. In the medical field, the emergence of WSN has created marvelous changes in monitoring the health conditions of the patients and so it is attracted by doctors and physicians. WSN assists in providing health care services without any delay and so it plays predominant role in saving the life of human. The data of different persons, time, places and networks have been linked with certain devices, which are collectively known as Internet of Things (IOT); it is regarded as the essential requirement of people in recent days. In the health care monitoring system, IOT plays a magnificent role, which has produced the real time monitoring of patient’s condition. However the medical data transmission is accomplished quickly with high security by the routing and key management. When the data from the digital record system (cloud) is accessed by the patients or doctors, the medical data is transferred quickly through WSN by performing routing. The Probabilistic Neural Network (PNN) is utilized, which authenticates the shortest path to reach the destination and its performance is identified by comparing it with the Dynamic Source Routing (DSR) protocol and Energy aware and Stable Routing (ESR) protocol. While performing routing, the secured transmission is achieved by key management, for which the Diffie Hellman key exchange is utilized, which performs encryption and decryption to secure the medical data. This enables the quick and secured transmission of data from source to destination with improved throughput and delivery ratio.

A Cross-Layer Solution for Contention Control to Enhance TCP Performance in Wireless Ad-Hoc Networks

With the development of wireless technology, users not only have wireless access to the Internet, but this has also sparked the emergence of Wireless Ad-hoc Networks (WANETs); this promising networking paradigm has the potential to adopt the shape of new emergent networks such as the Internet of Things (IoT), Vehicular Ad-hoc Networks (VANET) and Wireless Sensor Networks (WSN). However, channel contention (CC) is one of the key reasons why the TCP performs poorly in WANETs. This paper presents a mechanism called Cross-layer Solution for Contention Control (CSCC) to enhance TCP performance in WANETs. Each node starts marking packets in the proposed mechanism when its CC level reaches a certain threshold. As a result, the source node adjusts the congestion window (cwnd) size to a good state to control the insertion ratio of packets into the network. To provide a fair share to each flow, the flow having a large cwnd is penalized more. Numerous simulations have been conducted across several topologies to clarify the performance of the suggested mechanism. The simulation findings show that, in the presence of the Ad-hoc On-demand Distance Vector (AODV) routing and Dynamic Source Routing (DSR) protocols, the proposed CSCC mechanism outperformed TCP NewReno in terms of throughput and fairness. In comparison to TCP NewReno, the suggested mechanism has fewer retransmitted packets.

An Improved Multi-Objective Particle Swarm Optimization Routing on MANET

A Mobile Ad hoc Network (MANET) is a group of low-power consumption of wireless mobile nodes that configure a wireless network without the assistance of any existing infrastructure/centralized organization. The primary aim of MANETs is to extend flexibility into the self-directed, mobile, and wireless domain, in which a cluster of autonomous nodes forms a MANET routing system. An Intrusion Detection System (IDS) is a tool that examines a network for malicious behavior/policy violations. A network monitoring system is often used to report/gather any suspicious attacks/violations. An IDS is a software program or hardware system that monitors network/security traffic for malicious attacks, sending out alerts whenever it detects malicious nodes. The impact of Dynamic Source Routing (DSR) in MANETs challenging blackhole attack is investigated in this research article. The Cluster Trust Adaptive Acknowledgement (CTAA) method is used to identify unauthorised and malfunctioning nodes in a MANET environment. MANET system is active and provides successful delivery of a data packet, which implements Kalman Filters (KF) to anticipate node trustworthiness. Furthermore, KF is used to eliminate synchronisation errors that arise during the sending and receiving data. In order to provide an energy-efficient solution and to minimize network traffic, route optimization in MANET by using Multi-Objective Particle Swarm Optimization (MOPSO) technique to determine the optimal number of clustered MANET along with energy dissipation in nodes. According to the research findings, the proposed CTAA-MPSO achieves a Packet Delivery Ratio (PDR) of 3.3%. In MANET, the PDR of CTAA-MPSO improves CTAA-PSO by 3.5% at 30% malware.

Energy Based Random Repeat Trust Computation in Delay Tolerant Network

As the use of mobile devices continues to rise, trust administration will significantly improve security in routing the guaranteed quality of service (QoS) supply in Mobile Ad Hoc Networks (MANET) due to the mobility of the nodes. There is no continuance of network communication between nodes in a delay-tolerant network (DTN). DTN is designed to complete recurring connections between nodes. This approach proposes a dynamic source routing protocol (DSR) based on a feed-forward neural network (FFNN) and energy-based random repetition trust calculation in DTN. If another node is looking for a node that swerved off of its path in this situation, routing will fail since it won’t recognize it. However, in the suggested strategy, nodes do not stray from their pathways for routing. It is only likely that the message will reach the destination node if the nodes encounter their destination or an appropriate transitional node on their default mobility route, based on their pattern of mobility. The EBRRTC-DTN algorithm (Energy based random repeat trust computation) is based on the time that has passed since nodes last encountered the destination node. Compared to other existing techniques, simulation results show that this process makes the best decision and expertly determines the best and most appropriate route to send messages to the destination node, which improves routing performance, increases the number of delivered messages, and decreases delivery delay. Therefore, the suggested method is better at providing better QoS (Quality of Service) and increasing network lifetime, tolerating network system latency.

Implementation of Quality of Service-Oriented Distributed Routing Protocol using Fuzzy Logic in Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a type of wireless network made up of nodes that are both wireless and mobile. This type of wireless network is a non-infrastructure network (without a central manager such as router, servers, etc.) that is hard to manage; providing the Quality of Service (QoS) is also difficult. The fuzzy logic is one of the effective methods required to achieve high QoS in MANET. We propose an Ant-colony Based Cluster-head (ABC) selection a protocol based on artificial intelligence fuzzy logic techniques in this paper. With the proposed protocol, we divide the network into clusters, then, choose a cluster head which is a node having high residual energy, the most trusted; this is achieved using Ant-colony optimization (ACO) algorithm thanks to the use of a probability function which determines the likelihood of various nodes to be selected as cluster-heads. Using the Network Simulator Version-2 (NS-2), we evaluated our Proposed Protocol with ones existing in literature; Quality of Service-Ad-hoc On-Demand Distance Vector (QoS-AODV), Bandwidth aware Multi-path Routing protocol in mobile Ad Hoc networks (BMR) and Dynamic Multi-Path Source Routing Method (MSR). We conducted various experimental evaluations varying both the number of the total mobile nodes in the network and the number of receivers from a single sender; all simulation outcomes revealed that the Proposed protocol; Quality of Service-Oriented Distributed Routing Protocol using Fuzzy Logic and clustering techniques in Mobile Ad Hoc Networks (QODFL) outperformed the existing ones as compared to existing protocols, it was able to increase both the Packet Delivery Ratio by 10.5% and throughput by 6.7 % , and the End-to-End Delivery ratio by 7.7%.

A Performance Analysis of MANET Routing Protocols

A group of mobile nodes creates an arrangement connected to a remote media, forming a dynamic topology. In adhoc networks, Any time a device sends data to another node, that node uses energy, and occasionally the data transmission will halt when all the power is used up. The difficulty with MANET is reducing the energy consumption of the network's intermediary devices so that the network is active during data transmission because Mobile Adhoc Network (MANET) devices are often power-driven. Then, using performance measurements, a performance analysis is carried out across several routing protocols, including Dynamic Source Routing (DSR), Ad-hoc On-Demand Multipath Distance Vector (AOMDV), Destination-Sequenced Distance-Vector Routing (DSDV), and Ad-hoc On-Demand Distance Vector (AODV). The performance analysis is done using the NS2.35 simulator.