On-demand Distance Vector Routing Research Articles

A Novel Cross-Layer Adaptive Fuzzy-Based Ad Hoc On-Demand Distance Vector Routing Protocol for MANETs

One of the essential processes in Mobile Ad hoc Networks (MANETs) is blind flooding to discover routes between source and destination mobile nodes. As the density of nodes in the network increases, the number of broadcast packets increases exponentially. This can lead to broadcast storms, a drain on the device’s battery, and reduced network efficiency. We propose a Cross-layer Adaptive Fuzzy-based Ad hoc On-Demand Distance Vector routing protocol (CLAF-AODV) to minimize the routing broadcast traffic by considering the quality of service (QoS) (e.g. delay, throughput, packet loss), stability, and adaptability of the network. The suggested method employs two-level fuzzy logic and a cross-layer design approach to select the appropriate nodes with a higher probability of participating in broadcasting by considering parameters from the three first layers of the Open Systems Interconnection (OSI) model to achieve a quality of service, stability, and adaptability. It not only investigates the quality of the node and the network density around the node to make a decision but also investigates the path that the broadcast packet traveled to reach this node. Simulation results reveal that our proposed protocol reduces the number of broadcast packets and significantly improves network performance with respect to throughput, packet loss, normalized routing load, collision rate, and average energy consumption compared to the standard AODV and the Fixed Probability AODV (FP-AODV) algorithms.

Privacy Aware Post Quantum Secure Ant Colony Optimization Ad Hoc On-Demand Distance Vector Routing in Intent Based Internet of Vehicles for 5G Smart Cities

Privacy Aware Post Quantum Secure Ant Colony Optimization Ad Hoc On-Demand Distance Vector Routing in Intent Based Internet of Vehicles for 5G Smart Cities

An improved algorithm for delay constrained relay node deployment in wireless sensor networks

Given that Delay Constrained Relay Node Placement (DCRNP) problem is getting more and more attention in time-critical domains, this paper proposes an Improved Greedy-based Selection Algorithm (IGSA) to tackle such problem under delay and budget constraints. IGSA first employs communication cost matrix and Dijkstra’s algorithm to detect whether the problem is solvable, then selects the amount and locations of deployed relay nodes (RNs) layer by layer by continuously calling the greedy coverage algorithm until all sensors have a feasible path to the sink under a preset delay constraint, and finally removes redundant RNs to reach the approximate optimal solution. Extensive simulations show that our approach can save 15%–30% of deployed RNs than the Two-phase Set-Covering-based Algorithm (TSCA), which is the state-of-the-art algorithm for the DCRNP problem, only with a slight sacrifice of solving time. Meanwhile, Ad Hoc On-Demand Distance Vector (AODV) routing protocol is applied to further examine the performance of the deployment results solved by TSCA and IGSA, respectively. Results show that every RN deployed by IGSA is involved in data forwarding, while IGSA deploys leisure RNs which do not participate in the data forwarding. Besides, compared with TSCA, the network formed by IGSA has lower network delay in the data transmission process, and the energy consumption of the central node and throughput of the two topologies are almost at the same level.

An Optimized and Energy-Efficient Ad-Hoc On-Demand Distance Vector Routing Protocol Based on Dynamic Forwarding Probability (AODVI)

MANET (mobile ad-hoc network) is a wireless ad-hoc network made up of mobile devices that use peer-to-peer routing to provide network access instead of using a preexisting network infrastructure. Despite the network infrastructure’s simplicity, it faces issues such as changeable connection capacity, dynamic topology, node battery power exhaustion, and inadequate physical security. Broadcasting is a standard MANET approach for sending messages from a source node to all other nodes in the network. Flooding is a frequent method for broadcasting route request (RREQ) packets, which is susceptible to broadcast storms. The high retransmission rate is caused by the standard flooding technique, which causes media congestion and packet collisions, which can drastically reduce throughput and network performance. In a mobile ad-hoc network, efficient broadcasting focuses on selecting a compact forward node set while assuring broadcast coverage. The goal is to find a limited number of forward nodes that will provide complete coverage. In this paper, we propose an optimized and energy-efficient routing protocol for MANET (mobile ad-hoc network) based on dynamic forwarding probability in general and AODV (ad hoc on-demand distance vector) in particular, in which the route request packets are randomly controlled to increase the network lifetime and reduce packet loss in the flooding algorithm. We tested and assessed the results of our proposed solution using various network performance factors after implementing and integrating it into NS-2. According to simulation findings, our proposed technique effectively reduced route request propagation messages (RREQ). The suggested technique is more efficient, has a longer network lifetime, and uniformly utilizes node residual energy, enhancing network throughput and minimizing routing overhead when compared to regular and modified AODV protocols.

Networked control system with MANET communication and AODV routing

The industries are presently exploring the use of wired and wireless systems for control, automation, and monitoring. The primary benefit of wireless technology is that it reduces the installation cost, in both money and labor terms, as companies already have a significant investment in wiring. The research article presents the work on the analysis of Mobile Ad Hoc Network (MANET) in a wireless real-time communication medium for a Networked Control System (NCS), and determining whether the simulated behavior is significant for a plant or not. The behavior of the MANET is analyzed for Ad-hoc on-demand distance vector routing (AODV) that maintenances communication among 150 nodes for NCS. The simulation is carried out in Network Simulator (NS2) software with different nodes cluster to estimate the network throughput, end-to-end delay, packet delivery ratio (PDR), and control overhead. The benefit of MANET is that it has a fixed topology, which permits flexibility since mobile devices may be used to construct ad-hoc networks anywhere, scalability because more nodes can be added to the network, and minimal operating expenses in that no original infrastructure needs to be developed. AODV routing is a flat routing system that does not require central routing nodes. As the network grows in size, the network can be scaled to meet the network design and configuration requirements. AODV is flexible to support different configurations and topological nodes in dynamic networks because of its versatility. The advantage of such network simulation and routing behavior provides the future direction for the researchers who are working towards the embedded hardware solutions for NCS, as the hardware complexity depends on the delay, throughput, and PDR.

Enhancing Ad hoc Networks Performance by Using Location and Energy Information

Mobile ad hoc network (MANET) is considered to be a promising technology for the near future. This calls for more efficient mechanisms and methods to fulfil the expectation of end users and at the same time make the best use of resources. Although of its variety of applications and potentials, MANET has issues such as resource limitation, routing overhead and changing of wireless link. This paper proposes three algorithms that can diminish the overhead and energy consumption of MANET and at the same time improve the overall performance of the network. By Controlling the Route Request (RREQ) broadcasting in the Ad-hoc On-Demand Distance Vector (AODV) routing protocol using location and energy information, a better resource management and hence a better performance for the overall network is achieved.

A Simulation Modeling Approach for the Performance of Proactive, Reactive and Position-based Routing Protocols in MANET

Mobile Ad Hoc Network (MANET) hasrecently gotten much attention, especially regarding proactive, reactive, and position-based routing protocols. Routing protocols' primary objective is to transmit data packets from their source to their destination. Identifying the best routing protocol is a common problem in Ad Hoc networks. This paper presents a performance evaluation study of proactive, Open Shortest Path First (OSPF), reactive; Ad Hoc onDemand Distance Vector Routing (AODV), and positionbased routing; Location-Aided Routing (LAR1). The QualNet v5.1 simulator was used to conduct the performance evaluation study. The effectiveness of those routing protocols was also assessed using measures of throughput, typical endto-end delay, typical jitter, and energy consumption. This paper depicts that OSPF and AODV have the best performance among the number of packet sizes for the tested protocols.

A Technique of NLAODV algorithm to get Routes of Nodes-List in Mobile Ad-hoc Network (MANET)

A Mobile Ad-hoc Network (MANET) is a group of nodes that connect to each other wirelessly without the use of a central server or a traditional network structure. In MANETs, data packets are sent through wireless channels to keep communication going. Ad-hoc On-Demand Distance Vector Routing is a MANET-related reactive routing technology that generates a path of nodes to a destination by broadcasting packets of route request across the network. In this kind of Routing protocol, a connection loss causes the source to send control (RREQ) on the network, causing network congestion and performance deterioration. This study offers a Node List (NLAODV) Node List Ad-hoc On-Demand Distance Vector routing method that includes links and path-nodes to identify if any node on the network is involved in the route discovery process for sending control packets from wireless source node to the wireless destination node. Simulation findings reveal that the proposed NLAODV algorithm minimizes flood Packets and get best network as it’s not necessary for all nodes to be present in route discovery.

Enhanced-AODV: A Robust Three Phase Priority-Based Traffic Load Balancing Scheme for Internet of Things

One of the operational challenges in the Internet of Things (IoT) is load balancing, which is the focus of interest of this article. We propose a three-phase enhanced <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ad hoc</i> on-demand distance vector (enhanced-AODV) routing protocol for multiwireless sensor networks (multi-WSNs). The three phases are categorized based on traffic priority, namely: 1) high priority; 2) low priority; and 3) ordinary network traffic. The network architecture is divided into chains, i.e., local and public chains, where the cluster heads (CHs) and base stations (BSs) are used, respectively, to manage the network traffic based on priority information with alternative route allocation. Moreover, our three-phase enhanced-AODV protocol provides traffic categorization with alternatives route allocation to minimize energy consumption and prolong the lifetime of participating devices in the network. The proposed model is implemented in the simulation environment to overview results statistics in terms of network lifetime, prioritize traffic, computation and communication costs, latency, and packet lost ratio (PLR). Findings from the simulation suggest that our scheme achieves 15% improvement in network lifetime, 17% latency, 22% PLR, and approximately 10% in the computation and communication costs of the network, in comparison to three other similar protocols.

Performance Enhancement of Cluster-Based Ad Hoc On-Demand Distance Vector Routing in Vehicular Ad Hoc Networks

Recently, extensive research has focused on the design of clustering algorithms for grouping vehicles in a set of clusters in Vehicular Ad Hoc Networks (VANETs). However, due to the dynamic nature of VANETS, frequently connected or detached nodes threaten the stability of the network. When these nodes are clustered heads (CHs), the impact of these disruptions on network performance is even worse. Therefore, the stability of clusters is an important issue that should be maintained to enhance the performance of the network with minimum data loss. In this article, a novel clustering approach is proposed, which is based on the average weight concept of three main attributes, namely, the geostationary coordinates (x, y) and drop density. The average of the above-mentioned attributes is calculated and compared with the values of other vehicles’ attributes. Those vehicles having minimum average values are dropped and not to be considered in the cluster formation. The cluster members having minimum Euclidean distance are considered as Cluster Head (CH) until a certain checkpoint is not attained. The checkpoints are created in order to generate the social score of the vehicles. Once the social score is attained, a multiobjective framework is developed, which considers minimizing the Euclidian distance and maximizing the social score. The social score is generated based on the Quality of Service (QoS) attained attributes, and the data transmission is performed using Ad Hoc On-Demand Distance Vector (ADOV) routing protocol. A comparison of the proposed work and existing work has also been undertaken to demonstrate the improvement in the proposed work. As a result, throughput, PDR, network longevity, and energy consumption have been improved by 28.27%, 20.9%, 23.12%, and 27.48 percent, respectively. Extensive simulations show that the proposed scheme, unlike other popular clustering algorithms, can significantly increase the stability of the network by extending the life of the cluster head.

A Modified On-Demand Vector Distance Routing Protocol Incorporating Alternate Vehicle-RSU-Vehicle and Vehicle-RSU- RSU Paths

The Vehicular ad-hoc network (VANET) is an ad-hoc wireless network that allows moving or stationary vehicles to communicate with each other and with the roadside to facilitate various applications, including safety, collision avoidance, and traffic monitoring. The routing protocols provide vehicle-to-vehicle and vehicle-to-roadside communication for the VANET. However, due to the rapid mobility of the vehicles in the network, these protocols suffer from broken links, which leads to unreachable transmission. This paper proposes a new routing protocol based on the ad-hoc on-demand distance vector (AODV) routing protocol to locate the optimal routing of packets in moving vehicles by constructing alternative stable paths with the roadside unit. In the case of the broken links, the alternative stable paths can be used for message transmission, reducing packet discarding. The proposed protocol was simulated, and the results were compared with the original AODV. According to the obtained results, the proposed protocol improves the performance of the AODV in terms of throughput, end-to-end delay, and delivery ratio.

Optimization in the Ad Hoc On-Demand Distance Vector Routing Protocol

The main challenge of the MANET network is the continuous management of information, each device, to ensure the correct direction of traffic. MANET consists of a peer-to-peer connection; the network is self-repairing and at the same time self-formed. The network can be used in the field of road safety, in sensors in the home, healthcare, robotics, etc. The aim of this work was to study the MANET network and its protocols and especially the AODV protocol, the choice of peer in the AODV protocol, and the subsequent improvement of this mechanism. The work deals with ETX metrics and its subsequent implementation in the AODV protocol. The work includes simulations of the AODV protocol and subsequently also simulations of the AODV-ETX protocol. The implementation of the proposed result simulation takes place in Network Simulator 3 tool. The work contains a comparison of the AODV and AODV-ETX protocols. The simulation results are shown in tables and plotted. The AODV-ETX has better properties compared to the AODV protocol, but with a larger number of nodes over 20, these properties approach the AODV protocol. The packet loss, packet delay, and permeability are considered for performance evaluations.

Cross-Layer and Energy-Aware AODV Routing Protocol for Flying Ad-Hoc Networks

In recent years, unmanned aerial vehicles (UAVs) have become the trend for different types of research and applications. UAVs can accomplish some technical and risky tasks while still being safe, mobile, and inexpensive to operate. However, UAVs need flying ad-hoc networks (FANET) to operate in inaccessible or infrastructure-less areas. Subsequently, in many military and civil applications, the UAVs are connected ad hoc. FANET-based UAV systems have been developed for search and rescue, wildlife surveys, real-time monitoring, and delivery services. Maintaining the reliability and connectivity among UAV nodes in FANET becomes challenging because of the UAV movement, environmental conditions, energy efficiency, etc. Energy-aware routing protocols have become essential for developing advanced and effective FANETs. This paper presents a proposed Cross-Layer and Energy-Aware Ad-hoc On-demand Distance Vector (CLEA-AODV) routing protocol for improving FANET performance. The CLEA-AODV protocol is mainly divided into three sections: routing with AODV protocol, Glow Swarm Optimization (GSO)-based Cluster Head Selection, and Cooperative Medium Access Control (MAC). The cross-layer approach is implemented on the network layer and the data layer. The major parameters considered to evaluate the performance of the FANET are Packet Success Rate (PSR), Throughput (TP), End-to-End (E2E) delay, and packet drop ratio (PDR). The Network Simulator version 2 (NS2) is used to implement the CLEA-AODV protocol and evaluate the network performance. The results are compared with the standard AODV, Self-Organization Clustering-GSO (SOC-GSO), and Energy Efficient Neuro-Fuzzy Cluster-based Topology Construction with Meta-Heuristic Route Planning (EENFC-MRP) protocols. The results show that the CLEA-AODV surpasses these protocols in terms of PSR, TP, E2E delay, and PDR.

A Scalable Multicast Routing Protocol for Mobile Ad-Hoc Networks

The multicasting technique supports a variety of applications that require data to be instantaneously transmitted to a set of destination nodes. In environments with continuously moving nodes, such as mobile ad-hoc networks, the search for efficient routes from sources to the projected destinations is a common issue. Proposed Windmill protocol provides a scalable multicast solution for mobile ad-hoc networks. Windmill aims to improve routing protocol’s performance by introducing a hierarchal distributed routing algorithm and dividing the area into zones. Additionally, it attempts to demonstrate better scalability, performance and robustness when faced with frequent topology changes, by utilizing restricted directional flooding. A detailed and extensive simulated performance evaluation has been conducted to assess Windmill and compare it with multicast ad-hoc on-demand distance vector (MAODV) and on-demand multicast routing protocols (ODMRP). Simulation results show that the three protocols achieved high packet delivery rates in most scenarios. Results also show that Windmill is capable of achieving scalability by maintaining the minimum packet routing load, even upon increasing the nodes’ speed, the number of sources, the number of group members and the size of the simulated network. The results also indicate that it offers superior performance and is well suited for ad-hoc wireless networks with mobile hosts. The trade-off of using Windmill consists in slightly longer paths – a characteristic that makes it a good choice for applications that require simultaneous data transmission to a large set of nodes.

Investigation of Video Streaming over MANETS Routing Protocols

For industrial and academic researchers from all around the world, the Mobile Ad-hoc Network (MANET) is a specific focus. A MANET was created as a result of the fast growth of wireless gadgets. Mobile Ad hoc network is a self-organizing network with no framework. MANET’s device has the ability to travel in any direction in order to transmit and receive data with other devices or network nodes. An administrator node which is capable of controlling other nodes is absent in MANET. All nodes in MANET act as its own router and host and arrange its own network. The most important element of MANET is Routing protocol. For routing in MANET, various routing protocol is responsible. Providing a video streaming service using mobile ad-hoc networks is a hard task. The network topology is immensely unstable and its instability causes data to be lost. The performance of MANET routing protocols for video applications has been examined in this paper. There are many routing protocols, however the Optimized Link State Routing (OLSR) protocol and Ad-hoc On-Demand Distance Vector (AODV) routing protocols are explored here. In this work, a comparison of these two effective routing protocols for supporting video streaming applications is offered.

Performance and statistical analysis of ant colony route in mobile ad-hoc networks

&lt;div class="WordSection1"&gt;&lt;p&gt;Research on mobile ad-hoc networks (MANETs) is increasing in popularity due to its rapid, budget-friendly, and easily altered implementation, and relevance to emergencies such as forest firefighting and health care provisioning. The main concerns that ad-hoc networks face is dynamic topology, energy usage, packet drop rate, and throughput. Routing protocol selection is a critical point to surmount alterations in topology and maintain quality in MANET networks. The effectiveness of any network can be vastly enhanced with a well-designed routing protocol. In recent decades, standard MANET protocols have not been able to keep pace with growing demands for MANET applications. The current study investigates and contrasts ant colony optimization (ACO) with various routing protocols. This paper compares ad-hoc on-demand multi-path distance vector (AOMDV), dynamic source routing protocol (DSR), ad-hoc on-demand distance vector routing (AODV), and AntHocNet protocols regarding the quality of service (QoS) and statistical analysis. The current research aims to study the behavior of the state-of-the-art MANET protocols with the ACO technique. The ACO technique is a hybrid technique, integrating a reactive route maintaining technique with a proactive method. The reason and motivation for including the ACO algorithm in the current study is to improve by using optimization algorithms proved in other domains. The ACO algorithm appears to have substantial use in large-scale MANET simulation.&lt;/p&gt;&lt;/div&gt;

Mobile Ad Hoc networks intrusion detection system against packet dropping attacks

&lt;span&gt;Due to the extreme lack of a stable infrastructure, also self-organization of network components, unpredictable network topologies, and the lack of a central authority for routing, security assurance in mobile ad hoc networks (MANETs) is an important and difficult challenge. Among the famous threat that MANETs suffer from: blackhole, grayhole, and selfishness attacks, because the target of these attacks is to drop packets and disturb the routing operation of the network. A scalable, reliable, and robust network intrusion detection system (NIDS) should be created to effectively combat these families of network layer routing assaults in order to offer high availability for MANETs. In this paper, we present a MANETs-IDS based on machine learning algorithm against blackhole, grayhole, and selfishness attacks with Ad Hoc on-demand distance vector (AODV) routing protocol (RFC 3561) and optimized link state routing (OLSR) potocol (RFC 3626), using ns-3 simulation platform. Our simulation took into consideration the density of the network and a random mobility model of nodes. The obtained experimental results show that the proposed detection algorithm reached very promoting performances (in term of accuracy, processing time, time to build the model, precision, recall, F-measure).&lt;/span&gt;

Performance analysis of black hole and worm hole attacks in MANETs

A Mobile Ad Hoc Network MANET is composed of a freely and mobility set of mobile nodes. They form a temporary dynamic wireless network without any infrastructure. Since the nodes act as both host and router in their communication, they act as a router provide connectivity by forwarding data packets among intermediate nodes to the destination. The routing protocol is used to grove their communication and connectivity as example, the Ad On-demand distance vector (AODV) routing protocol. However, due to the lack of security vulnerabilities of routing protocols and the absence of infrastructure, MANET is vulnerable to various security threats and attacks. This paper examines the impact of two types of attacks on AODV routing protocol using Network Simulator version 2 (NS2) environment. These attacks are Blackhole and Wormhole Attacks. The aim of both of them is to prevent data packets to reach the destination node and dropping all the traffic.

Effect of NTT on Performance of AODV in a Linear AD HOC Network

Wireless Ad Hoc Networks (WANETs) are predicted to be prevalent networks in coming future because of their infrastructure-less characteristics that result in self-organization, self-healing, and self-configuration of such networks. Routing means the process of selecting a path along which data can be transferred from source to destination that plays a significant role in the performance of ad hoc networks. There are many routing protocols developed for wireless ad hoc networks. One of such protocols, developed by C. E. Perkins, is Ad Hoc On-demand Distance Vector (AODV) routing protocol, which is a reactive routing protocol, AODV is used to establish route(s) between source node(s) and destination node(s) as and when routes are required. Performance of AODV routing protocol depends heavily on choice of values of a set of predefined attributes. One of such attributes of AODV is Node Traversal Time (NTT) which is supposed to play significant role in establishing route(s) between source node(s) and destination node(s). In this paper, we have investigated the performance of AODV in a linear wireless ad hoc network using different values of NTT using as well as without using Hello messages. The performance of the network has been measured using several metrics like Route Error Overhead, Routing Overhead, Normalized Routing Load, Average Hop Count, Total Number of Received Data Packets, Packet Delivery Ratio, Average End-to-End Delay and Throughput. It is observed that choice of value of NTT has a significant effect on establishment of route(s) between source node(s) and destination node(s) that eventually affects the performance of the linear wireless ad hoc network under consideration. The insights gained through this work could be useful in analysis of more realistic and complex networks.

Research on Zoning, Optimization, Stability, and Nonlinear Control of Wireless Network in Power Grid Communication

To explore the partition optimization and stability of telecommunication network under nonlinear control, a routing optimization algorithm for power control of distribution communication network is proposed, which is based on the Ad-hoc On-demand Distance Vector (AODV) routing optimization algorithm, based on the energy consumption model of wireless sensor network, the optimal routing mechanism for power control is constructed, and the optimal routing mechanism is used to select the route with low energy consumption to solve the problem of energy limitation of wireless sensor nodes. This paper aims at the network routing selection problem in the terminal information collection of the distribution network and designs the routing optimization algorithm of the wireless sensor network. Experimental results show that the model accuracy of the optimized model is 99.8%, the average residual error of the model is about 5.5[Formula: see text]nm, the model accuracy meets the requirements, and the method is effective. According to the confidence interval prediction results of wireless communication link reliability, a node power control system structure of wireless sensor network is proposed, and an optimal control algorithm of communication link quality and reliability of microgrid wireless sensor network based on fuzzy control is studied.