Ad Hoc On-demand Distance Vector Research Articles

An Innovative Performance Assessment Method for Increasing the Efficiency of AODV Routing Protocol in VANETs Through Colored Timed Petri Nets

ABSTRACTRouting protocols are pivotal in Vehicular Ad hoc Networks (VANETs), serving as the backbone for efficient routing discovery, particularly within the realm of Intelligent Transportation Systems (ITS). However, ensuring their seamless functionality within VANET environments necessitates rigorous verification and formal modeling. Colored Timed Petri Nets (CTPNs) stand out as a valuable mathematical and formal method for this purpose. This study shows a new way to describe the Ad hoc On‐Demand Distance Vector (AODV) routing system in VANETs using CTPNs. There are nine pages of detailed analysis using this new modeling method, which allows you to examine success across many levels of a hierarchy. This study provides a strong foundation for building and testing the AODV routing system in VANETs, showing how well it functions in real‐life situations. It is interesting to see how the results of the CTPN–based model and simulations compare. Notably, the model finds routes in an average of 32 s, while tests show that it takes 56 s. Additionally, the model's overall number of sent and received packets closely matches the results from the exercise. Furthermore, the suggested plan shows a yield of 41%. Strict T‐tests indicate that the modeling results are highly reliable.

A Location-Aware and Greedy Cross-Layer Routing Protocol for Flying Ad-hoc Networks

The Flying Ad-hoc Networks (FANETs) enhance the coverage capacity in cellular networks by forwarding data in multiple hops using Unmanned Aerial Vehicles (UAVs). Nevertheless, unlike classic ad-hoc networks, FANETs have specific characteristics, such as free movement in three dimensions and very high-speed nodes. These characteristics lead to a more complex and dynamic mobility pattern compared to other ad-hoc networks, generating more frequent topology changes. This paper proposes the Greedy Weighted Perimeter Routing Protocol (GWPRP), which aims to improve networking performance. GWPRP is a location-aware and greedy cross-layer routing protocol based on a classic protocol for vehicular networks, the Greedy Perimeter Stateless Routing (GPSR). Following a similar greedy strategy, GWPRP forwards packets based only on local information obtained from neighbors, which considers link and network layer information, local link stability, and node location. We assess the protocol in a simulated environment, comparing its performance with GPSR and Energy Efficient Hello Ad-hoc On-Demand Distance Vector (EE HELLO AODV), a variant of AODV for FANETs. The results show that GWPRP achieves a higher packet delivery ratio with smaller control overhead and lower average end-to-end delay and jitter.

Delay-sensitive Quality of Service Routing with Integrated Admission Control for Wireless Mesh Network

Wireless mesh networks (WMNs) extend and improve broadband Internet connectivity for the end-users roaming around the edges of the wired network. Amid the explosive escalation of users sharing multimedia content over the Internet, the WMNs need to support the effective implementation of various multimedia applications. The multimedia applications require assured quality of service (QoS) to fulfill the user requirements. The QoS routing in WMNs needs to guarantee the QoS requirements of multimedia applications. Admission control (AC) is the primary traffic control mechanism used to provide QoS provisioning. AC admits a new flow only if the QoS requirements of already admitted flows are not violated, even after the admission of a new flow. We propose a new QoS routing protocol integrated with AC called Delay-Sensitive QoS Routing with integrated Admission Control (DSQRAC) to control the admission of delay-sensitive flows. A delay-aware cross-layer routing metric is used to find the feasible path. DSQRAC is implemented using ad-hoc on-demand distance vector (AODV) routing protocol, where a delay-sensitive controlled flooding mechanism is used to forward the route request packets. In the proposed work, we adjust/reassign the channels to aid the QoS routing to increase the likelihood of accepting a new flow. The simulation results show that the performance of the proposed QoS routing protocol is better than the existing schemes.

Mitigating blackhole attacks in wireless body area network

<p>In this paper, we aimed to develop a trusted secured routing Ad-hoc on-demand distance vector (AODV) protocol to fight against blackhole attacks within the wireless body area network (WBAN). The trusted secure routing protocol incorporates a routing strategy based on trust value to detect malicious nodes based on their trust value, a routing technique based on node residual energy to select the node with the highest residual energy during the communication process, and a hybrid cryptography algorithm that merges the Affine cipher with the modified RSA cipher algorithm to secure communication against malevolent biomedical sensor attacks. Simulation outcomes demonstrate that the suggested protocol outperforms the traditional AODV routing protocol in all evaluation metrics, including data rate, energy consumption, and packet delivery ratio. Its main strength is that it considers several factors, like illegitimate medical sensor detection, efficient network energy use, and secure data transmission, unlike similar secured routing protocols. Furthermore, the hybrid cipher algorithm improves the effectiveness and increases the security level of sensitive data compared to traditional cipher algorithms such as the Affine cipher and the RSA cipher.</p>

An Energy-efficient Routing Protocol Based on Elephant Herding Optimization in MANET

Background: A mobile ad hoc network (MANET) is a collection of self-organizing mobile nodes creating an ad hoc network without fixed infrastructure. Routing is a major issue in mobile networks that may reduce network performance due to frequent network topology changes. Routing protocols are so important in dynamic multi-hop networks that many studies have focused on the routing problem in MANETs. Methods: In this research work, a proposed ad hoc on-demand distance vector (AODV) with an elephant herding optimization (EHO) called AODVEHO is used as an optimal path selection method that creates a set of best paths between destination and source. Results: To validate the performance of proposed AODVEHO, AntHocNet, AODV, and designation sequence distance vector (DSDV). Various performance measures are considered to validate our proposed research work, such as packet delivery ratio (PDR), end-to-end delay (E2ED), and average energy consumption (AEC). Conclusion: Experimental results are indicated that the AODVEHO achieved a higher routing overhead (73 %), PDR (89.87 %), low E2ED rate (95.22 %), AEC (75.60 %), and dead nodes (75%) when compared to other routing schemes.

Research on AUV Multi-Node Networking Communication Based on Underwater Electric Field CSMA/CA Channel.

To address the issues of high attenuation, weak reception signal, and channel blockage in the current electric field communication of underwater robots, research on autonomous underwater vehicle (AUV) multi-node networking communication based on underwater electric field Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) channel was conducted. This article, first through simulation, finds that the Optimized Link State Routing (OLSR) protocol has a smaller routing packet delay time and higher reliability compared to the Ad Hoc On-Demand Distance Vector (AODV) protocol on underwater electric field CSMA/CA channels. Then, a 2FSK underwater electric field communication system was established, and dynamic communication experiments were carried out between two AUV nodes. The experimental results showed that within a range of 0 to 3.5 m, this system can achieve underwater dynamic electric field communication with a bit error rate of 0 to 0.628%. Finally, to avoid channel blockage during underwater AUV multi-node communication, this article proposes a dynamic backoff method for AUV multi-node communication based on CSMA/CA. This system can achieve dynamic multi-node communication of underwater electric fields with an error rate ranging from 0 to 0.96%. The research results have engineering application prospects for underwater cluster operations.

Intensive study, tuning and modification of reactive routing approach to improve flat FANET performance in data collection scenario.

The Flying Ad-hoc Network (FANET) can be defined as the Ad-hoc network that connects unmanned aerial vehicles flying in the space with each other and with a ground base station. However, the 3D movement of these drones with higher speeds results in a network of highly dynamic topology and intermittent connections, making the standard Ad Hoc routing protocols are not suitable for FANET. The approaches followed to address this issue include designing from scratch a routing protocol specific to FANET or modifying the existing protocols. From the view point of reliability, accuracy, and time, it is preferable to base the work on a protocol standard. But before amending the standard, tuning its performance and applying it under suitable conditions may be satisfactory for the new use. Therefore, this work considers flat FANET of fully mission-controlled drones and performs an extensive parametric simulation study to determine the best conditions and parameters' values for applying the popular Ad Hoc On-demand Distance Vector (AODV) to it. After deducing the recommended operating environment (FAODVN-OE), some examples of amendments were suggested to further improve the performance. It was found that the modified FAODVN-OE achieves high performance compared to the default standard in terms of jitter and delay. It helped reduce jitter and delay by an average of 93.2% and 83.8%, respectively, while exhausting less energy; however the network experiences a 24.5% reduction in packet delivery ratio.

Enhancing Reliability and Stability of BLE Mesh Networks: A Multipath Optimized AODV Approach.

Bluetooth Low Energy (BLE) mesh networks provide flexible and reliable communication among low-power sensor-enabled Internet of Things (IoT) devices, enabling them to communicate in a flexible and robust manner. Nonetheless, the majority of existing BLE-based mesh protocols operate as flooding-based piconet or scatternet overlays on top of existing Bluetooth star topologies. In contrast, the Ad hoc On-Demand Distance Vector (AODV) protocol used primarily in wireless ad hoc networks (WAHNs) is forwarding-based and therefore more efficient, with lower overheads. However, the packet delivery ratio (PDR) and link recovery time for AODV performs worse compared to flooding-based BLE protocols when encountering link disruptions. We propose the Multipath Optimized AODV (M-O-AODV) protocol to address these issues, with improved PDR and link robustness compared with other forwarding-based protocols. In addition, M-O-AODV achieved a PDR of 88%, comparable to the PDR of 92% for flooding-based BLE, unlike protocols such as Reverse-AODV (R-AODV). Also, M-O-AODV was able to perform link recovery within 3700 ms in the case of node failures, compared with other forwarding-based protocols that require 4800 ms to 6000 ms. Consequently, M-O-AODV-based BLE mesh networks are more efficient for wireless sensor-enabled IoT environments.

Performance Comparison of CC AODV and Optimized AODV K-Means Clustering Using NS3

Nowadays, many studies have been interested in Ad Hoc Wireless Networks because of their low cost, when there is a need to communicate using a network without any infrastructure. Ad Hoc On-Demand Distance Vector (AODV) is a routing protocol for mobile ad hoc networks (MANET) and other wireless ad hoc networks. AODV was co-developed in July 2003 at the NOKIA Research Center, University of California, Santa Barbara and University of Cincinnati by C. Perkins, E. Belding-Rover an S.Das. AODV is a routing protocol used by ZigBee - a low power wireless ad hoc network with low data rates. AODV is included in the proactive routing protocol. The advantage of using this routing protocol is that it has economical resources, because resources are not needed to store information about routes to other nodes. However, this AODV has a drawback, namely the packet that will be sent has a long delay in anti-node origin waiting for the protocol to find the path to be passed. There are many papers that optimize AODV, including CC AODV and K Means Clustering AODV. Based on the paper “CC-AODV: An effective multiple paths congestion control AODV”, a control scheme called CC AODV has been created, namely managing routing conditions by significantly increasing packet sending rates while reducing packet drop rates, and based on the paper “An Energy Efficient Clustering Using K-Means and AODV Routing Protocol in Ad hoc Networks”. Based on both paper, in this study the objectives to be achieved are: a) Analyze the performance of using CC AODV and K Means Clustering AODV based on the number of nodes. b) how much influence the number of nodes has on the performance of CC AODV and K Means clustering AODV c) Performance analysis is performed on throughput, end to end delay, packet loss, packet delivery ratio. This paper begins by looking at the literature covering MANET, AODV, CC AODV, and K-Means Clustering AODV. On the result section the test results such as end to end delay, throughput, packet delivery ratio, and packet loss ratio are documented. The conclusion summarizes key points and is followed by the references.

Extended Comparison and Performance Analysis for Mobile Ad-Hoc Networks Routing Protocols Based on Different Traffic Load Patterns and Performance Metrics

A mobile ad-hoc network (MANET) is a network of mobile nodes that dynamically form a transitory network lacking any existence of infrastructure and any form of centralized management. Nodes in ad hoc networks are powered by batteries with a limited lifespan and communicate in a restricted bandwidth. The unpredictable environment of a MANET may run into a major concern in the routing mechanism, therefore the need for a routing protocol with robust performance is still one of the key challenges in MANET deployment. In this work, a comparative comparison and extensive simulation analysis have been carried out for three major routing protocols: destination sequenced distance vector (DSDV), dynamic source routing (DSR) and ad hoc on-demand distance vector (AODV). Protocol evaluation has been extended by considering several simulation arrangements, different classes of traffic load patterns and diverse performance metrics. Based on packet rate change, node quantity and node speed, simulation scenarios were generated. Protocols were investigated against energy consumption, throughput, lost packets, routing load and packet delivery fraction for three types of traffic load patterns regular, irregular and joint traffic. DSR and AODV protocols proved to be more reliable when joint traffic was implemented when node speed and packets variations are considered. DSDV protocol verifies outstanding response over other protocols in terms of energy consumption when either regular or irregular traffic is applied. The simulation results for DSR protocol have verified the superiority over other protocols in 9 simulation scenarios when diverse metrics are considered. DSDV showed optimal performance in 7 cases, especially at low packet rates and in networks with minimum number of nodes. Similarly, AODV protocol showed outstanding performance in 6 scenarios, when higher packet rates and node mobility are considered.

Smart AODV Routing Protocol Strategies Based on Learning Automata to Improve V2V Communication Quality of Services in VANET

The Adhoc On-Demand Distance Vector (AODV) protocol faces challenges in selecting the best relay nodes, which requires optimization to improve performance in Vehicular ad-hoc networks (VANETs). This study aims to enhance Vehicle-to-Vehicle (V2V) communication in VANETs by implementing the Learning Automata-Driven Ad-hoc On-Demand Distance Vector (LA-AODV) routing protocol. LA-AODV is designed to achieve higher packet delivery ratios and optimize data transfer rates, even under congested network conditions, by dynamically adjusting to changing network scenarios. The performance evaluation includes six key metrics analyzed under varying node densities and time intervals, comparing LA-AODV against the standard AODV protocol. Results indicate that LA-AODV consistently outperforms AODV, demonstrating improved efficiency in flood identifier management, reduced data loss, higher packet delivery ratios, better throughput, and reduced end-to-end delay and jitter. Specifically, under a 20-node scenario, LA-AODV exhibits lower flood ID scores (54 vs. 88), reduced packet loss (11% vs. 12%), higher PDR (88.0% vs. 87.0%), and superior throughput (85.34 Kbps vs. 47.26 Kbps). Additionally, LA-AODV achieves lower end-to-end delay (6.84E+09 ns vs. 3.76E+10 ns) and jitter (2.52E+09 ns vs. 2.15E+10 ns). These findings suggest that LA-AODV significantly enhances Quality of Service (QoS) in vehicular ad-hoc networks, positioning it as a promising solution for optimizing V2V communication performance.

Hybrid ant colony-based inter-cluster routing protocol for FANET

This study addresses the challenges in large-scale unmanned aerial vehicle (UAV) clusters, specifically the scalability issues and limitations of using reactive routing protocols for inter-cluster routing. These traditional methods place an excessive burden on cluster heads and struggle to adapt to frequently changing topologies, leading to decreased network performance. To solve these problems, we propose an innovative inter-cluster routing protocol (ICRP), which is based on a hybrid ant colony algorithm. During the route establishment phase, ICRP uses this algorithm to identify the optimal relay node. This approach is inspired by the foraging behavior of Physarum polycephalum, combining factors such as the number of hops from the source node, the load condition of the node, and its weight in the pheromone calculation. In the route maintenance phase, ICRP uses a predictive repair and contraction mechanism to dynamically maintain routes, accommodating the high mobility of UAVs. Comparative simulations in OMNeT + + showed that this protocol surpasses ad-hoc on-demand distance vector (AODV), fuzzy-logic-assisted-AODV, and Enhanced-Ant-AODV routing protocols in packet delivery rate and end-to-end transmission delay. Furthermore, it showed superior adaptation to network environments with high-speed node mobility.

Detection of sequence number attacks using enhanced AODV protocol in MANETs

A Mobile Adhoc NETwork (MANET) operates without dedicated routing hardware, relying instead on dynamic wireless connections among nodes that can join or leave the network at any time. This dynamic nature demands a flexible routing protocol to manage variable number of nodes effectively. However, the absence of centralized infrastructure in MANETs poses security challenges, leaving nodes vulnerable to attacks. While several security solutions have been proposed, many face practical limitations. This paper introduces a novel approach to detect attacks on the Ad Hoc On-Demand Distance Vector (AODV) routing protocol within MANETs, specifically those involving malicious nodes masquerading as best routing paths by manipulating AODV's sequence numbers. An extension to the AODV protocol is introduced to ensure secure communication between different nodes in MANET. The proposed security mechanism includes a signature verification mechanism based on the Edwards digital signature curve (Ed25519), which is demonstrated on the Objective Modular Network Testbed in C++ (OMNet++) simulator. Our solution employs an extension to AODV protocol where asymmetric cryptography is introduced to generate and authenticate digital signatures, ensuring a high level of security. Additionally, a novel detection mechanism is introduced to identify malicious nodes within the network as a supplementary security layer. Simulation results demonstrate a high detection rate, accurately identifying between 83 % and 100 % of malicious nodes based on their presence in the network.

Deployment of efficient MANET testbed using aggregation based archive population optimization

In today’s 6G era, Mobile ad hoc networks (MANETs) have been enhanced by rapid technological advancement in the wireless communication industry to better support a wide range of domains, including military operations, emergency operations, urban settings, and natural crisesmanagement. In MANET, self-organizing mobile nodes collaborate to build a flexible network architecture. With a MANET, data must transit through numerous intermediate nodes even before reaches its destination node. Local link connectivity is essential for the establishment and preservation of routes. To decrease energy usage, these findings suggest the Aggregation-based Archive Population Optimization(AAPO) along with Ad-hoc On-demand Distance Vector (AODV) Routing Protocol. For both local and global optimal routes, the proposed optimized modelgives top priority. There existtwo different types of rules used by AAPO to evaluate the quality of a route before using it for data transmission. Instead of relying on just one path for transmitting data, AAPO leverages many paths. Also, it minimizes the issue of the network nodes being suddenly inaccessible, which eliminates interruptions in transmissions. However, the suggested optimal routing system considers mobility and energy availability when responding to queries, resulting in significant performance improvements, utilizing 42.69 % of the scenario’s power and functioning at 208.6 kbps with an average PDR of 87.1 %. Also, detailed simulations are conducted using the Matlab (R2021b)software to assess the suggested approach. Furthermore, the suggested protocol outperforms the current methods in terms of effectiveness.

An efficient security and privacy approach for internet of vehicles in vehicular networks for smart cities

AbstractIntelligent sensing plays a crucial role in making vehicles safe and trouble‐free. The purpose of this paper is to introduce Vehicular Sensor Networks (VSNs) in a vehicular IoT‐based smart city paradigm, focusing on security. Furthermore, we discuss the robustness and reliability of VSN. In this design, Ad hoc On‐Demand Distance Vector (AODV) routing‐based Internet of Vehicles is integrated with a privacy‐aware secure ant colony optimization for smart cities in which suspicious vehicles are prevented from disseminating messages. IoV real‐time communication emphasizes data security. A comparison of experimental results shows that the proposed approach outperforms existing approaches. Smart city communication networks can be optimized using the proposed model.

Comparative analysis of reactive routing protocols for vehicular adhoc network communications

In the recent past, vehicular adhoc networks (VANETs) have gained a lot of importance. The routing protocols play a vital role to deliver payloads from one vehicle to another one while they are moving at relative speeds. It is a challenging task to select a routing protocol for VANETs because of the uneven distribution and high mobility of vehicles. In this paper, we have analysed the two standard reactive protocols, adhoc on-demand distance vector (AODV) and ant colony optimization (ACO). The performance comparison of AODV and ACO routing protocols has been presented in this paper. The results show AODV performed better in terms of energy consumption and routing overhead. While considering the throughput, energy loss ratio, and delay ACO has performed. ACO resulted as upperhand.

A Blockchain-Enabled Trust Management Framework for Energy-Efficient and Secure Routing in Mobile Ad-Hoc Networks

This study principally addresses the challenges associated with streaming videos in wireless Mobile ad hoc networks (MANETs), primarily constrained by wireless channels and node mobility. This study proposes a novel routing protocol incorporating a feedback mechanism and cross-layer architecture, supported by three key enhancements. First, it incorporates a route recovery strategy for detecting link failures and re-establishing connections based on predefined Quality of Service (QoS) metrics. Second, a novel algorithm estimates the available bandwidth, enabling dynamic adaptation of bitrate at the application layer concerning the source video. This novel rate-adaptive approach utilizes a scalable layered structure of the video coding, thereby removing layers that the network cannot efficiently support due to bandwidth limitations. Third, a gateway discovery procedure enhances the connectivity among MANETs and other infrastructure networks. This method employs available bandwidth as a parameter while selecting appropriate gateways and dynamically adjusts operational parameters like proactive area size and advertisement message frequency. The performances of the proposed Enhanced OLSR (E-OLSR) protocol are compared with the state-of-the-art routing procedures such as Adhoc on-demand distance vector (AODV), destination sequenced distance vector (DSDV), and optimized link state routing (OLSR), in terms of metrics like packet delivery ratio (PDR), end-to-end (E2E) delay, throughput, as well as energy consumption. The simulation results demonstrated notable improvements, including reduced packet delay, fewer dropped packets, and decreased link failures, indicating effective utilization of available bandwidth. The overall performance of the proposed E-OLSR protocol exceeds other traditional protocols and its security is enhanced through the integration of Blockchain Technology.

Artificial self-attention rabbits battle royale multiscale network based robust and secure data transmission in mobile Ad Hoc networks

In a Mobile Ad hoc Network (MANET), the network structure constantly evolves due to the movement of devices, users, or nodes. The Black Hole Attack (BHA) is recognized as the most impactful threat in MANETs, where an attacker node intentionally discards all data traffic, hence minimizing the network performance. Therefore, developing a secure and robust routing protocol is vital for efficient data transmission in a MANET. Although existing solutions have been designed to counteract malicious nodes, these solution presents drawbacks such as the need for additional hardware, notable delivery delays, limited throughput, increased energy consumption, and minimum packet delivery ratio. Thus, this research work introduces a new updated Ad hoc On-demand Distance Vector (AODV) routing protocol that integrates the benefits of the Artificial Rabbits Battle Royale Optimization (ARBRO), and Self-attention Multiscale Network (SMNet). The role of the ARBRO algorithm is to optimize the route by selecting the most appropriate node properties. Then, SMNet identifies the BHA node using these node properties. The proposed scheme is implemented in MATLAB. Experimental results determines that the introduced approach attains a delay of 0.039 s, a throughput of 94.57 Kbps, and a packet delivery ratio of 98.76 %, which are better than the existing techniques. Simulation results demonstrate that the introduced method improves network performance by enhancing the quality of service in the presence of a BHA.

Detection of black hole attacks in vehicle-to-vehicle communications using ad hoc networks and on demand protocols

PurposeThe potential of vehicle ad hoc networks (VANETs) to improve driver and passenger safety and security has made them a hot topic in the field of intelligent transportation systems (ITSs). VANETs have different characteristics and system architectures from mobile ad hoc networks (MANETs), with a primary focus on vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. But protecting VANETs from malicious assaults is crucial because they can undermine network security and safety.Design/methodology/approachThe black hole attack is a well-known danger to VANETs. It occurs when a hostile node introduces phony routing tables into the network, potentially damaging it and interfering with communication. A safe ad hoc on-demand distance vector (AODV) routing protocol has been created in response to this issue. By adding cryptographic features for source and target node verification to the route request (RREQ) and route reply (RREP) packets, this protocol improves upon the original AODV routing system.FindingsThrough the use of cryptographic-based encryption and decryption techniques, the suggested method fortifies the VANET connection. In addition, other network metrics are taken into account to assess the effectiveness of the secure AODV routing protocol under black hole attacks, including packet loss, end-to-end latency, packet delivery ratio (PDR) and routing request overhead. Results from simulations using an NS-2.33 simulator show how well the suggested fix works to enhance system performance and lessen the effects of black hole assaults on VANETs.Originality/valueAll things considered, the safe AODV routing protocol provides a strong method for improving security and dependability in VANET systems, protecting against malevolent attacks and guaranteeing smooth communication between cars and infrastructure.

A COMPARATIVE ANALYSIS OF PROACTIVE ROUTING PROTOCOLS (DSDV, OLSR) & REACTIVE ROUTING PROTOCOLS (AODV, DSR) IN MANET USING NS-3

The abstract outlines a comprehensive analysis focusing on routing protocols in Mobile Ad Hoc Networks (MANETs). Ad-hoc networks are dynamic wireless networks without a central infrastructure. This analysis compares two types of routing protocols—proactive (table-driven) and reactive (on-demand)—using simulation analysis. The protocols DSDV, OLSR, AODV, and DSR are evaluated using NS-3, considering various performance metrics under different scenarios. The research aims to provide insights into protocol strengths and weaknesses, aiding network protocol selection and potential enhancements. This investigation contributes to understanding routing behaviours in ever-changing MANETs, benefiting network design and optimization efforts. Keywords: MANET (Mobile Ad Hoc Network), DSDV (Destination-Sequenced Distance Vector), OLSR (Optimized Link State Routing), AODV (Ad Hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), Routing Information Protocol (RIP)