Hoc On-Demand Distance Vector Routing Research Articles

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.

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

Modified Adhoc On-Demand Distance Vector for Trust Evaluation And Attack Detection

Recently, Wireless Sensor Network (WSN) becomes most potential technologies for providing improved services to several data gathering and tracking applications. Because of the wireless medium, multi-hop communication, absence of physical protectivity, and accumulated traffic, WSN is highly vulnerable to security concerns. Therefore, this study explores a specific type of DoS attack identified as a selective forwarding attack where the misbehaving node in the network drops packet on a selective basis. It is challenging to determine if packet loss is caused by a collision in the medium access path, poor channel quality, or a selective forwarding assault. Identifying misbehaving nodes at the earliest opportunity is an acceptable solution for performing secure routing in such networks. As a result, in this study effort, we present a unique Modified Ad Hoc On-Demand Distance Vector (AODV) Routing protocol depending upon the One time password (OTP) method that employs the RSA algorithm. Finally, a trust evaluation process determines which approach is the most optimal. According to the simulation findings of the suggested routing protocol and comparison with existing routing protocols provided in this article, the proposed work is both efficient and cost-effective.

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.

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.

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.

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.

Mobile Ad Hoc networks intrusion detection system against packet dropping attacks

<span>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).</span>

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.

Enhanced-AODV Routing Protocol to Improve Route Stability of MANETs

Establishing and maintaining link stability in Mobile Ad hoc Networks (MANETs) is one of the key challenging issues. Topology changes in MANET because overhead traffic that leads to consuming extra energy of nodes as well as decreasing the performance of routing protocols. Thus, a comprise approach should be considered during the design of a routing scheme in MANETs to deal with challenges incurred by the mobility of the nodes. In this study, a simple efficient routing scheme called Enhanced_AODV (E-AODV) is proposed, aiming to enhance Ad Hoc On-Demand Distance Vector (AODV) routing protocol performance by constructing the most stable and reliable route from source to the destination node. In this routing scheme, the remaining lifetime of links and hop count are the metrics considered for calculating the Route Stability Factor (RSF) that can be utilized as a cost metric to establish the best route between source and destination node. The simulation results reveal that the proposed E-AODV routing scheme effectively outperforms the conventional AODV routing protocol and Stable and Bandwidth Aware Dynamic Routing Protocol (SBADR) in terms of packet delivery ratio, average network throughput, average end-to-end delay, and normalized routing overhead.

Self-Adaptive Framework for Rectification and Detection of Black Hole and Wormhole Attacks in 6LoWPAN

Internet network communication protocol version 6 low-power wireless personal area networks (6LoWPAN) is supposed to assist the gadgets with low-power wireless sensor network (WSN) and it furnishes the top model layer of the data transmission system. The 6LoWPAN is prone to the diversified attacks such as wormhole and black hole attacks, which might be very difficult to become aware of and defend. In a wormhole attack, the attacker listens to the facts over the networks, and in a black hole attack, the intruder reprograms the nodes to dam the data transmission. As an end result, any data datagram that enters the attacked region will end result in transmission failure with low flow network rate and excessive one-way delay. To come across and heal the attack, a self-adaptive framework is brought into the networks and the procedure of data transmission is enriched. In this work, the affected region is measured and rectified with the aid of using the proposed self-adaptive framework for Ad Hoc On-Demand Distance Vector (AODV) routing protocol network communication protocol. The overall performance of the network healing technique is investigated with the aid of using simulation and its miles diagnosed that the proposed framework suggests promising overall performance with the aid of using accomplishing excessive flow network rate and minimum delay.

Investigation of AODV Routing Protocol Using RDPA and UDPA


 
 
 The node deployment technique in Mobile Ad Hoc networks plays a vital role in the evaluation of a routing protocol. In this paper, the performance of Ad Hoc On-Demand Distance Vector (AODV) routing protocol has been investigated using Uniform and Random Disc Position Allocators offered by NS-3 as Initial Position Allocator as well as Next Position Allocator along with random waypoint mobility model. The simulation results exhibit that AODV routing protocol performs better in case of random disc position allocator as compared to uniform disc position allocator where performance metrics are taken as the Average End-to-End Delay, Throughput and Packet Delivery Ratio.
 
 
 
 
 
 
 
 

Cross Layer Approach and ANFIS based Optimized Routing in Wireless Multi-Hop Ad Hoc Networks

Mobile ad hoc networks are non-dependent on any wired infrastructure and provide exceptional benefits during typical situations like conference, fair/exhibition, disaster recovery and emergency rescue operations. But these networks have to deal with several open issues, since they are battery operated and the dynamic topology can change due to mobility. Thus, multi-hop wireless ad hoc networking needs an energy efficient routing protocol that discovers/maintains routes to any other member node in the network, minimizing computation/communication overhead and battery power consumption. An adaptive neuro fuzzy inference system (ANFIS) based ad hoc routing approach has not been investigated before. In this paper, an ANFIS and cross layer approach-based energy efficient routing protocol for wireless multi-hop networks is proposed and its performance is compared with the Ad Hoc On-demand Distance Vector (AODV) Routing Protocol and fuzzy based AODV, using the network simulator ns2. Using remaining battery power, hop count and link stability as the input variables, the ANFIS module computes the optimum path cost, as the output. The proposed ANFIS based approach produces better results when compared using the metrics: average throughput, packet delivery ratio, average end-to-end delay in packet delivery between source and destination and average routing overhead.

Improving the AODV Route Recovery Mechanism Using PSO in WSN

Objective: The conventional Ad Hoc On-Demand Distance Vector (AODV) routing algorithm, route discovery methods pose route failure resulting in data loss and routing overhead. In the proposed method, needs significant low energy consumption while routing from one node to another node by considering the status of node forwards the packet. So that while routing it avoids unnecessary control overhead and improves the network performance. Methods: Particle Swarm Optimization (PSO) algorithm is a nature- inspired, population-based algorithm. Particle Swarm Optimization (PSO) is a Computational Intelligence technique which optimizes the objective function. It works by considering that every member of the swarm contributes in finding the ideal solution by keeping a track of their own best known location and the best-known location of the group and keeps updating them whenever there is a change and hence minimizes the objective fitness function. The fitness function which we considered here is the Node lifetime, Link Lifetime and available Bandwidth. If these parameters are with good then status of node will be strong and hence routing of packet over those nodes will reduce delay and improves network performance. Result: To verify the feasibility and effectiveness of our proposal, the routing performance of AODV and PSO-AODV is compared with respect to various network metrics like Network Lifetime, packet delivery ratio and routing overhead and validated the result by comparing both routing algorithm using Network Simulator 2. The results of the PSO-AODV has outperformed the AODV in terms of low energy, less end to end delay and high packet delivery ratio and less control overhead. Conclusion: Here we proposed to use Particle Swarm Optimization in order to obtain the more suitable parameters for the decision making. The existing AODV protocol was modified to make a decision to recover from route failure; at the link failure predecessor node implementing PSO based energy prediction concept and using weights for each argument considered in the decision function. The fitness values for each weight were found through PSO basic form. We observed that the PSO showed satisfactory behaviour improvement than the performance of AODV for all metrics on the investigated scenarios.

Discovery Routing Time Speed Comparison of AODV, OLSR and ZRP protocols on MANET

Mobile Ad hoc Network (MANET) is a wireless network that contains a collection of nodes without infrastructure and interconnected to communicate. MANET works dynamically when a group of nodes moves spontaneously, so the network topology can change quickly and cannot be predicted. It causes changes in wireless network topology according to existing conditions. The node functions in determining the route to be selected. Ad Hoc networks have limited transmission range, so routing is needed to send data over the network. The problem with mobile nodes is that routing must provide a path when the node changes. The speed of a node obtaining information is affected by the routing protocol used in the network. Each routing protocol has different capabilities in network speed, so the discovery routing time for each routing is also different. The selected routing protocols are Ad Hoc On-Demand Distance Vector (AODV), Optimized Link-state (OLSR), and Zone Routing Protocol (ZRP). The study will conduct a comparative analysis of ad hoc network initialization speeds on AODV, OLSR, and ZRP routing protocols. The parameter tested is the speed of routing discovery. After the data is collected, an analysis is carried out by looking at the routing discovery speed of each routing protocol. The test results show that each of the routing protocols examined, the AODV routing protocol, has a faster routing discovery time than the OLSR and ZRP routing protocols.

Preventing Collaborative Black Hole Attack in IoT Construction Using a CBHA–AODV Routing Protocol

Workers or labors who are working in construction sites are prone to severe risks such as death, injuries happened due to accidents, falls and stuck in between objects. Internet of things (IoT) based sensors can be utilized to monitor the behavior of workers when they are in danger zones/areas. To safeguard site workers, supervisors or site managers should monitor and alert them when they are in danger. Data will be routed from site worker to supervisor, during this routing process data is subjected to routing attacks such as black hole attack and so on, due to wireless transmission. This article addresses the problem of black hole attack that happens during the wireless transmission between nodes and the base station (BS) of IoT-based civil construction. The proposed solution Collaborative Black Hole Attack – Ad Hoc On-Demand Distance Vector routing protocol (CBHA-AODV) prevents the collaborative black hole attack by 87.72%.

Evaluating TCP performance of routing protocols for traffic exchange in street-parked vehicles based fog computing infrastructure

As most vehicles remain parked 95% of its time, this suggests that leveraging the use of On-board Units (OBUs) in parked vehicles would provide communication and computation services to other mobile and fixed nodes for delivery of services such as multimedia streaming, data storage and data processing. The nearby vehicles can form an infrastructure using IEEE 802.11p communication interface, facilitating communication, computation and storage services to the end users. We refer to this as a Vehicular Fog Computing (VFC) infrastructure. In this study, using NS-2 simulator, we investigate how six routing protocols consisting of two proactive routing protocols, Destination Sequence Destination Vector (DSDV) and Fisheye State Routing (FSR); two reactive routing protocols, Ad Hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR); and two geographic routing protocols, Distance Routing Effect Algorithm for Mobility (DREAM) and Location Aided Routing (LAR) perform when forwarding TCP traffic among the parked vehicles that form a VFC infrastructure in an urban street parking scenario. In order to reflect an urban street parking scenario, we consider a traffic mobility traces that are generated using SUMO in our simulation. To the best of our knowledge, this work is the first effort to understand how vehicle density, vehicle speed and parking duration can influence TCP in an urban street parking scenario when packet forwarding decision is made using proactive, reactive and geographic routing protocols. In our performance evaluation, positive results are observed on the influence of parking duration in parked vehicles as TCP performance in all routing protocols increases with longer parking duration. However, variable speed in parked vehicles and moving vehicles in an urban street parking scenario may not have significant influence on TCP performance, especially in case of reactive and proactive routing protocols. Further, our findings reveal that vehicle density in a VFC infrastructure can noticeably influence TCP performance. Towards the end of the paper, we delineate some important future research issues in order to improve routing performance in a street-parked vehicle based VFC infrastructure.

Modeling Displacement and Direction Aware Ad Hoc On-Demand Distance Vector Routing Standard for Mobile Ad Hoc Networks

The mobile ad hoc network (MANETs) is increasingly emerging wireless standards with the immense extent of applications. The MANET routing experiences disputes in terms of their autonomous nature and due to the presence of diverse routing schemes. The reactive routing standards are chosen due to minimized control overheads and expandability but they experience regular path breakdowns because of increased displacement of the nodes. For minimizing the connection breakdowns and to acquire a constant path a fresh reactive routing standard is designed based on hierarchy based displacements. The designed displacement and magnitude aware ad hoc on demand distance vector routing standard intends to address the displacements and magnitude features over the ad hoc networks. The DDC – AODV directs the path identification and path acknowledgment based on the displacement of the contributing nodes and their magnitudes. The NS2 offers two load assessment employing assessments to explore the consequences and benefits of DDC – AODV over the AODV standards.

Performance Evaluation of Secure Routing in Mobile Ad Hoc Network Using Ad Hoc on-Demand Distance Vector Routing Protocol

In modern era, MANET i.e., Mobile Ad-hoc Network is a very powerful, interactive tool and useful resource for transmission/communication in computer networks. About composition of MANET, a collection of mobile nodes have the potential of creating self-maintaining and self-configurable network without having any centralized infrastructure i.e., MANET is a self-organized network without any infrastructure. Nodes in the network require energy for transmission of data after collapse of energy a node become inactive and it can’t participate in the communication. Due to exhaustation of energy the network becomes unstable. An unstable network requires extra routing process for coin out a route. In future security of MANET is a major challenge for smooth and efficient data communication. There are many protocols in MANET but in this paper, we discussed AODV routing protocol for data communication. In this paper a new algorithm is designed i.e., modified AODV with security constraint. This paper also gives the comparative study of original AODV and modified AODV.