On-demand Distance Vector Routing Research Articles

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.

Enhanced Energy efficient routing protocol for OnDemand distance vector routing to improve communication in border area Military communication

Enhanced Energy efficient routing protocol for OnDemand distance vector routing to improve communication in border area Military communication

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.

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.

Link reliable on-demand distance vector routing for mobile ad hoc networks

Link reliable on-demand distance vector routing for mobile ad hoc networks

Cross-Layer Energy Efficient (CLEE) Routing Algorithm for Mobile Ad-Hoc Networks

Ad-hoc routing algorithms in Wireless Sensor Networks (WSN) rely on nodes’ position awareness by regularly updating routing data of neighbouring nodes. Meanwhile, the transmission energy usage is not optimised as a result of this repeated updates and routing table deployment. Therefore, it is very critical to consider techniques of optimising or conserving energy in the design of wireless sensor networks (WSNs) in order to prolong the lifetime of the individual nodes. One of these techniques is the Cross-layer design which, is considered as an efficient method for addressing this challenge with WSNs. In this paper, we propose a Cross-Layer Energy Efficient (CLEE) routing algorithm to establish an optimal route from the source node to the destination node by selecting candidate nodes from neighbouring nodes based on the distance between these nodes and the rate of energy consumption by a possible candidate node. Then to select a designated node from the candidate nodes, the algorithm further computes the Signal Strength Quality (SQS) and the Link Lifetime (LL) as well as the Throughput (TH) rate of selected nodes. The proposed algorithm was simulated with a network size of 600 X 600 on Network Simulator 3 (NS3) in order to analyse its performance. An evaluation of the performance of the proposed CLEE protocol with existing similar protocols such as Ad-hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) reveals that CLEE outperformes AODV and DSR by conserving about 44% of available energy.

Frozen Base Gateway Discovery Algorithm for Mobile Ad-Hock Network with Internet Connectivity Using AODV + Routing Algorithm

A mobile ad-hoc network (MANET) is a self-organized, auto-configured network and the mobile nodes have been free to move. To enable the MANET to connect to the internet it uses an intermediate bridge called a gateway. The MANET and the internet gateway is a heterogeneous network, which needs a gateway discovery. There are three types of gateway discovery mechanisms: proactive, reactive, and hybrid gateway discovery mechanism. The main challenge in the integration of the MANET and the Internet is, that there are high link disconnection results from node mobility and limited energy. In addition link disconnection, packet drop, and end-to-end delay. This study examines the impact of node mobility and energy in the frozen path from the source node to the destination node of MANET In this study, the Ad-hoc on-demand distance vector routing (AODV) routing protocol is used and modified to examine the gateway selection for MANET and the Internet. Moreover, the AODV+ control message RREQ and RREP and the routing table are improved to store the energy factor, path queue length, and frozen factor of the path. The proposed gateway discovery algorithm is known as frozen-based gateway AODV+ (F_AODV+), The stability factors of the path from the source node to the gateway, are calculated using a simple additive weighting method of the energy factor, average path queue node, and the path with the Maximum energy factor and minimum queue length is the more Frozen to select Frozen gateway from the source node to distension node.A mobile ad-hoc network (MANET) is a self-organized, auto-configured network and the mobile nodes have been free to move. To enable the MANET to connect to the internet it uses an intermediate bridge called a gateway. The MANET and the internet gateway is a heterogeneous network, which needs a gateway discovery. There are three types of gateway discovery mechanisms: proactive, reactive, and hybrid gateway discovery mechanism. The main challenge in the integration of the MANET and the Internet is, that there are high link disconnection results from node mobility and limited energy. In addition link disconnection, packet drop, and end-to-end delay. This study examines the impact of node mobility and energy in the frozen path from the source node to the destination node of MANET In this study, the Ad-hoc on-demand distance vector routing (AODV) routing protocol is used and modified to examine the gateway selection for MANET and the Internet. Moreover, the AODV+ control message RREQ and RREP and the routing table are improved to store the energy factor, path queue length, and frozen factor of the path. The proposed gateway discovery algorithm is known as frozen-based gateway AODV+ (F_AODV+), The stability factors of the path from the source node to the gateway, are calculated using a simple additive weighting method of the energy factor, average path queue node, and the path with the Maximum energy factor and minimum queue length is the more Frozen to select Frozen gateway from the source node to distension node.

Trust-Based Routing Selection Policy on Mobile Ad-Hoc Network Using Aodv Routing Protocol

This study presents an enhanced Ad-hoc On-demand Distance Vector (AODV) routing protocol, termed Proposed_TAODV, designed to improve security in Mobile Ad-Hoc Networks (MANETs) of 150 nodes by incorporating trust-based mechanisms. Through a comprehensive simulation, the Proposed_TAODV is evaluated against existing AODV and Dynamic Source Routing (DSR) protocols under conditions of increasing malicious node presence. The results reveal that Proposed_TAODV maintains a higher Packet Delivery Ratio, experiences lower Average End-to-End Delay, and achieves greater Throughput compared to the benchmarks, indicating its superior performance and robustness. The integration of Direct Trust Evaluation, Indirect Trust Evaluation, and Trust Aggregation methods into the AODV protocol clearly enhances the MANET's resilience to security threats, establishing the Proposed_TAODV as a promising approach for securing MANETs against various forms of attacks and network disruptions.

Irregularity Behaviour Detection - Ad-hoc On-Demand Distance Vector Routing Protocol (IBD - AODV): A Novel Method for Determining Unusual Behaviour in Mobile Ad-hoc Networks (MANET)

All the communication in the mobile ad-hoc network (MANET) will depend on the intermediate neighbour nodes or router nodes. Routing protocol is very important in MANET, because all the communication will be done in the MANET depending on the neighbour or intermediate node. If the intermediate node is a malicious node, all the data will be lost or changed by the intermediate or malicious node. Ad-hoc On-demand Distance Vector routing protocol is one of the moderate routing protocol in MANET. The Ad-hoc On-demand Distance Vector Routing protocol does not have any security mechanism. This work is going to find the Irregularity Behaviour Detection (IBD) over the Ad-hoc On-Demand Distance Vector Routing (AODV) protocol. IBD is finding a trusted node by using the trust value (TV) of the node. This TV includes network performance, node energy level, and node position value. IBD-AODV is implemented and tested in the OmNetpp 6.0 simulator.

Minimizing End-To-End Time Delay in Mobile Ad-Hoc Network using Improved Grey Wolf Optimization Based Ad-Hoc On-demand Distance Vector Protocol (IGWO-AODV)

Mobile Ad-Hoc network is one of the instant network with unknown mobile devices. Each and every node in the network may act differently. Because of this time taken to travel packet from source to destination will take more time. This work proposes Improved Grey Wolf Optimization Based Ad-Hoc On-Demand Distance Vector routing protocol for reduce the End-to-End time delay in MANET.

Self-reconfigurable partial mesh using ZigBee control board towards fail-proof and reliable home area networking

This paper deals with the development of customized home area networking (HAN) with a higher degree of reliability so that a robust communication network can be provided to smart home owners. The proposed HAN is built with the multi-gateway-based partial mesh networking topology using state-of-the-art ZigBee control boards (ZCBs) where each individual appliance within the home can be monitored and controlled remotely. The gateway is actually used to coordinate amongst the In-home display (IHD), ZCBs, smart meter, and remote server-based home energy management software or even with the mobile Apps in such a way that the best possible energy usage can be made. In order to enhance the reliability of this proposed HAN, the active and pseudo gateway concept is introduced in which under the failure of the active gateway (AG), pseudo gateway (PG) takes control, and the HAN gets reconfigured automatically. Malfunctioning or failure of any ZCB or even gateway node is detected during route discovery with ad-hoc on-demand distance vector (AODV) routing. The reliability of the proposed system is estimated using possible path models and region models considering all of its running conditions. The proposed system is simulated and a prototype laboratory setup with 15 and 10 numbers of ZCBs is built for experimental verification. Various failure conditions are experimented with to demonstrate the alternate routes and activation of PG as AG. The availability of an alternate route and/or gateway makes this proposed HAN a fail-proof and reliable one and this is reflected from the relative values obtained from the simulated and experimental results.

End to end delay distribution analysis and interference aware high throughput for Wireless Mesh Networks

The wireless mesh network is an innovative and efficient wireless communication approach with immense potential to transform future wireless networks. This cutting-edge wireless technology provides a wide range of wireless services for personal, local, campus, and metropolitan environments. The wireless mesh network consists of a cluster of mobile wireless nodes that can dynamically and instantaneously create random and temporary network topologies, forming a wireless ad-hoc network. Ad hoc wireless networks are particularly advantageous due to their cost-effectiveness and ease of deployment. In order to further optimize the performance of ad-hoc networks, different routing algorithms such as Ad-hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing Algorithm (DSR) and Destination Sequenced Distance Vector (DSDV) have been thoroughly researched via simulation.

Design of a Self-Organizing Routing Protocol for Underwater Wireless Sensor Networks Based on Location and Energy Information

Underwater wireless sensor networks (UWSNs) are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, variable topology, limited battery, low processing power and so on. These new features pose many challenges to the design of self-organizing routing protocol for UWSNs. This paper focuses on the application of Ad Hoc On-demand Distance Vector (AODV) routing protocol in UWSNs. In order to solve the problems of packet collision and excessive energy consumption associated with the flooding-based routing discovery method and the periodic hello packet routing maintenance mechanism of AODV, a routing discovery and maintenance method based on location and energy information is proposed, and it is referred to as the route-focusing AODV (RFAODV) routing protocol. In the RFAODV protocol, the routing discovery process is focused on a few nodes through forwarding area control and dynamic delay adjustment. In addition, feedback from a media access control layer and residual energy control are used for routing maintenance. We implement the RFAODV and evaluate its performance according to the sea trial data as parameters in the NS-2. The simulation results show that compared with the other protocols, RFAODV improves the routing discovery success ratio by at least 18%, increases the packet transmission ratio by at least 4%, reduces the protocol overhead by at least 15% and reduces the energy consumption by at least 5% under various simulation scenarios. RFAODV is suitable for large-scale, high-load and dynamic networks underwater wireless sensor networks.

SDODV: A smart and adaptive on-demand distance vector routing protocol for MANETs

SDODV: A smart and adaptive on-demand distance vector routing protocol for MANETs

Clustering based secure error report fault tolerant routing in mobile adhoc networks

A Mobile Ad-hoc Network (MANET) is a self-constructed network consisting of spatially distributed nodes that cooperatively arrange themselves without any centralized manager or fixed based stations. In MANET, the nodes are deployed in a dynamic scenario, so, the nodes may fail as a result of energy depletion, hardware failure, communication link errors, and malicious attacks. Therefore, it is necessary to design energy-efficient fault-tolerant algorithms and protocols for MANETs. Since the development of Mobile Ad-hoc networks was originally motivated by military applications, such as battlefield surveillance and healthcare applications it is required to have a fast recovery mechanism to overcome the fault condition. In this research work, a fault-tolerant Routing mechanism is designed and implemented to address the fault conditions such as node failure, link failure, and critical battery issues called Fault tolerant cluster based AODV with Error Reporting Routing (CAODVERR) protocol, and to improve the stability of the MANET. Also, an Error reporting mechanism has been incorporated with the Ad-hoc On-Demand Distance Vector (AODV) routing protocol.

Secured mobile IOT ecosystem using Enhanced Multi-level Intelligent Trust Scheme

The Internet of Things (IoT) is a collection of heterogeneous, interconnected mobile ad-hoc networks (MANETs) devices. High-level security is always required to protect sensitive information travelling over MANET-IoT networks. IoT security ensures the privacy, confidentiality, and security of the users, infrastructure, and data. The Enhanced Multi-Level Intelligent Trust Scheme (EMITS) initially designs to authenticate and validate the data for the Mobile IoT (MIoT) ecosystem. The proposed model used the AODV (Adhoc On-Demand Distance Vector Routing) routing protocol with an intelligent trust scheme. This paper aims to present a MANET-IoT-based model combined with a hybrid cryptographic scheme that ensures secure communication between mobile IoT ecosystems against the black hole attack. The performance of the proposed EMITS-MIoT model is verified based on the packet delivery ratio (PDR), packet loss ratio (PLR), false positive ratio (FPR), false negative ratio (FNR), and attack detection rate (DR). The EMTS-IoT technique shows a 3–5% success in data transmission over existing techniques.

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

ENHANCED ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL TO PREVENT BLACKHOLE ATTACK IN MANET

Wireless networks are becoming increasingly popular. Mobile ad hoc networks are one category among the different types of wireless networks that transmit packets from the sender node to the receiver node without the use of a base station or infrastructure, as the nodes serve as both hosts and routers. These networks are referred to as mobile because they are movable. MANET is an ad-hoc network that can change positions at any time, and nodes can join or leave at any moment, making it vulnerable to attacks such as Blackhole. Existing solutions, in some ways, led to more memory space consumption, while others led to an overhead. This research proposes an Enhanced On-demand Distance Vector (AODV) routing protocol to prevent Blackhole attacks on MANETs using Diffie Hellman and Message Digest 5 (DHMD), implemented using Network Simulator 2 (NS2). The performance of the proposed protocol was evaluated using the following parameters: Packet Delivery Ratio, throughput, End to End (E2E) Delay, and routing overhead. It was concluded that DHMD has reduced network overhead as it resulted to 23% while AODV resulted at 38% and memory consumption for DHMD gave 0.52ms compared to AODV that gave 0.81ms due to Blackhole prevention. This research will help to mitigate the effect of blackhole attacks in a network and increase network performance by reducing overhead and memory consumption.

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.