Demand Distance Vector Routing Research Articles

Incremental Online Machine Learning for Detecting Malicious Nodes in Vehicular Communications Using Real-Time Monitoring

Detecting malicious activities in Vehicular Ad hoc Networks (VANETs) is an important research field as it can prevent serious damage within the network and enhance security and privacy. In this regard, a number of approaches based on machine learning (ML) algorithms have been proposed. However, they encounter several challenges due to data being constantly generated over time; this can impact the performance of models trained on fixed datasets as well as cause the need for real-time data analysis to obtain timely responses to potential threats in the network. Therefore, it is crucial for machine learning models to learn and improve their predictions or decisions in real time as new data become available. In this paper, we propose a new approach for attack detection in VANETs based on incremental online machine learning. This approach uses data collected from the monitoring of the VANET nodes’ behavior in real time and trains an online model using incremental online learning algorithms. More specifically, this research addresses the detection of black hole attacks that pose a significant threat to the Ad hoc On Demand Distance Vector (AODV) routing protocol. The data used for attack detection are gathered from simulating realistic VANET scenarios using the well-known simulators Simulation of Urban Mobility (SUMO) and Network Simulator (NS-3). Further, key features which are relevant in capturing the behavior of VANET nodes under black hole attack are monitored over time. The performance of two online incremental classifiers, Adaptive Random Forest (ARF) and K-Nearest Neighbors (KNN), are assessed in terms of Accuracy, Recall, Precision, and F1-score metrics, as well as training and testing time. The results show that ARF can be successfully applied to classify and detect black hole nodes in VANETs. ARF outperformed KNN in all performance measures but required more time to train and test compared to KNN. Our findings indicate that incremental online learning, which enables continuous and real-time learning, can be a potential method for identifying attacks in VANETs.

Modelling and modular supervisory control for the AODV routing protocol

The model of the Ad-hoc on Demand Distance Vector (AODV) routing protocol, being favorable in several wireless networks (Vehicular Ad-Hoc Networks (VANET), ZigBee etc.) is presented for a network with parametric number of nodes in the Ramadge Wonham (RW) framework of discrete event systems (DES). For a generic network, consisting of n nodes, the first goal is to introduce two specification rules, per node. The first rule guarantees the hierarchy of the requests of the nodes and the routing paths. The second rule offers a first level security regarding requests’ replies. The two rules are expressed as two regular languages. Each regular language is realized by a supervisor automaton. The two supervisor automata of each node compose the local controllers of a distributed supervisory control architecture controlling the total network. The physical realizability of the local controlled automaton is proved. Also, the nonblocking property and the satisfactory marked behavior of the total controlled automaton are proved. The complexity of the proposed distributed architecture is computed. To illustrate the effectiveness of the present control scheme, a four-node network simulation of the controlled automaton of the protocol is presented.

Quad-Interleaving Routing Algorithm for Performance Enhancement of Oil and Gas Pipeline Network Monitoring

The pipeline is one of the main modes oftransportation for the oil and gas industry that could be laid offshore and onshore. Pipeline transportation requires close monitoring as a failure in pipelines causes disruption of supply, loss of precious commodities and not to mention irreversible environmental damage will be an essential topic. The major issue in AODV and DSDV is when the network gets more extensive, which causes high packet traffic resulting in high packet loss, energy consumption and passive nodes. This research aims to establish a routing algorithm with better performance focusing on throughput, fairness index, delivery ratio and passive nodes and energy consumption. The study is confined to wireless sensor network simulation on Network Simulator Tool. A technique of quad-interleaving Ad-hoc On- demand Distance Vector (QAODV) routing algorithm has been developed where predefined Alpha, Beta, Charlie and Delta nodes will communicate with the nodes which belong to their family. The results of the developed routing protocol have been compared with standard AODV, DSDV and OLSR routing protocols. The developed routing algorithm has produced a massive improvement in the delivery ratio (25% more), throughput (44% more), passive nodes (71 less), fairness index (0.06 more) and energy consumption (0.22J less).

Secure and Light Weight Aodv (Slw-Aodv) Routing Protocol for Resilience Against Blackhole Attack in Manets

This paper aimed at the detection of blackhole attacks and proposed a new method called as Secure and Light Weight Adhoc On demand Distance Vector Routing (SLW-AODV). SLW-AODV is an extended version of the traditional AODV routing protocol. The proposed SLW-AODV ensures resilience for both blackhole and cooperative blackhole attacks. It employs a simple Challenge, Response and Confirm (CRC) strategy with chaotic maps for the identification of both blackhole and cooperative blackhole attacks. SLW-AODV identifies the attacked nodes at both route discovery and data forwarding process. For experimental validation, we have conducted extensive simulations and the performance is validated through Packet Delivery Ratio, Throughput and Average end-to-end delay. The obtained performance metrics shows an outstanding performance than the state-of-the art methods.

Neighbour Node Ratio AODV (NNR-AODV) Routing Protocol for Wormhole Attack Detection in Manets

This paper aimed at the detection of wormhole attack and proposed a new method called as Neighbour Node Ratio Adhoc On demand Distance Vector Routing (NNR-AODV). NNR-AODV is an extended version of the traditional AODV routing protocol. The proposed NNR-AODV calculates the neighbour node count for every node and based on that it will decide whether the wormhole is present or not. Furthermore, NNR-AODV is able to detect both external and internal wormhole attacked nodes. Also, NNR-AODV derived a Neighbor node Threshold value which is based on the cumulative distances between nodes present in the wormhole attack. For experimental validation, we have accomplished an extensive simulation and the performance is measured through Number of bogus links, Detection rate, False positive Rate, Packet delivery ratio and Packet loss ratio. The obtained results have shown superior performance in the detection of wormhole attacks than the existing methods.

Black‐hole attack and counter measure in ad hoc networks using traditional routing optimization

SummaryAd hoc networks have constraints like energy, memory, computation power, and communication range which makes the nodes vulnerable for attacks. In this article, black hole attack detection mechanism is carried out on traditional ad hoc on demand distance vector routing (AODV) protocol. Initially the proposed work proceeded with black‐hole attack configured on conventional AODV protocol. Black‐hole node will give route reply with highest sequence number to entice the sender to create a route through it. By using intruder detection system threshold mechanism, the black‐hole nodes are identified and isolated. In this article, maximal destination sequence number is estimated by using linear regression technique. Performance comparison is carried out with normal, black hole based and black hole detected routing mechanisms. The simulation findings show that that incorporated method enhances network performance by improving QoS under black hole attack.

Fitness Sorted Red Deer-Cat Swarm Optimization-based Autonomous QoS-aware Multicast Communication System in MANET

A mobile ad hoc network (MANET) is a set of autonomous mobile devices connected by wireless links in a distributed manner and without a fixed infrastructure. Mobile Ad-Hoc Networks (MANETs) is considered as an infrastructure-less and constant self-configured network of wireless devices. Here, multicast has emerged as an efficient tool for communication. Recently, distinct research works have been studied in wireless MANETs for designing multicast routing protocols. Multicasting is a procedure used for allowing the users to send the same messages simultaneously to a set of users. Though, it suffers from different problems regarding implementation in ad-hoc networks owing to its shorter battery lifetime, and lack of bandwidth dynamic nature of the mobile devices. Hence, the main aim of this paper is to propose a new QoS-aware multi-cast routing protocol in MANET using the hybrid meta-heuristic algorithm. The proposed routing protocol will focus on the development of a hybrid meta-heuristic-based “reliable neighbor nodes selection” scheme over the Multicast Ad-Hoc on Demand Distance Vector routing protocol (MAODV) protocol. The “reliable neighbor nodes selection” is accomplished by Fitness sorted Red Deer-Cat Swarm Optimization (FRD-CSO) algorithm focusing on the constraints like energy model, mobility model, and reliability pair factor. Once the optimal node selection is performed, the proposed QoS-aware protocol is validated by the route discovery mechanism and route reply process. The simulation has been performed to show the efficiency of the designed multicast routing over other multicast routing protocols that demonstrates the noteworthy enhancement in terms of diverse performance measures.

Efficient Ad Hoc On Demand Distance Vector Routing Protocol Based on Route Stability in MANETs

Efficient Ad Hoc On Demand Distance Vector Routing Protocol Based on Route Stability in MANETs

Energy Factor Based Routing Algorithm for Lifetime Enhancement in Mobile Ad-Hoc Networks

Energy consumption and dissipation of mobile nodes is considered as one of the significant aspect affecting the entire lifetime of Mobile Ad-Hoc Networks (MANETs), as the nodes depends on limited battery power. In addition, spatial and temporal characteristics of mobile nodes also make energy imbalance in the network. Towards this, there are several studies that emphasis on improving the network lifetime and reliability by altering the existing MANET routing protocols. In this paper, an Energy Factor based Ad-Hoc On Demand Distance Vector routing algorithm (EF-AODV) is proposed in MANETs for lifetime enhancement. The proposed technique includes two algorithms by leveraging the cross layer paradigm. Firstly, proposed EF-AODV dynamically chooses intermediate nodes based on battery power, and mobility of the nodes in the direction of destination. Secondly, for uniform energy consumption, we calculate the energy factor at each intermediate mobile node by considering the sleep and ideal states of the nodes along with mobility. Further, the energy factor is considered as a key metric to obtain the optimal path from the source to the destination to balance the energy disparity in the network, leading to reduced delay in packet transmission. The path with highest energy factor value is selected for networking of data packets. Upon extensive simulation using Network Simulator (NS-2.34), we illustrate that the proposed EF-AODV outperforms over existing ad-hoc routing approaches under the various performance metrics.

On-demand based wireless with hybrid cryptography in MANET

The self-configuring ability of nodes in Mobile Adhoc Network (MANETs) made it popular among critical applications like military use or natural emergency recovery. Most of the proposed protocols assume that all nodes in the network are cooperative, and do not address any security issue. To adjust such trend, it is vital to address its potential security issues. The main objective of this paper is to define the path for security and to further improve delay, energy, throughput, routing overhead, packet delivery ratio and at the same time to create energy enhanced way with excellent security. In this paper, performance analysis of hybrid cryptography with reactive protocol Elliptic Curve Cryptography - Ad hoc On- Demand Distance Vector Routing (ECC-AODV) designed for MANET. In this design there is a two key encryption technique based on elliptic curve based theory that can be used to create faster, smaller, and more energetic and efficient cryptography. Network Simulator (NS2) is used to implement and test the proposed system.

Performance Analysis of MANET under Security Attacks

In Mobile Ad hoc Network (MANET), performance of the routing protocols is degraded by various network attacks such as black hole attack and rushing attack. Mostly all layers of mobile ad hoc networks are vulnerable to several attacks. Routing protocols used in mobile ad hoc networks are designed by considering that all the nodes are trustable in communication mode. MANET is less secure network due to its features like no centralized administration control and no infrastructure is required. In this paper, Ad hoc On Demand distance Vector (AODV) routing protocol is evaluated under rushing attack, black hole attack, and grayhole attack. Under multiple attacking, single attacking, and without attacking modes, performance of network has been evaluated. By varying the speed, network size, node density, and number of attacking nodes, four different network scenarios have been generated. Performance metrics are considered as average throughput, average end to end delay and packet delivery ratio. Network simulator 2 is used to simulate the attacks over AODV routing protocol. Results show that all the above attacks are responsible for the poor throughput, heavy dropping packets and higher end to end delays in the network. Throughput is degraded as the numbers of attacking nodes are increased. AODV is less affected by rushing attack as compared to black hole and grayhole attacks.

Enhancing Route lifetime in Vehicular Ad Hoc ‎Networks Based on Skellam Distribution Model

The emergence of smart cities and the need to use intelligent transportation systems has led to an increased reliance on vehicle ad hoc networks (VANET). The topology of VANET is highly dynamic, which results in a short effective routing time. This paper presents a two-stage algorithm to select a route that can sustain communication between vehicles for as long as possible while taking into account the variables that affect the VANET topology. The first stage uses Skellam distribution model to assess the connectivity probability of paths in ‎a 2d road network based on traffic-flow and the number of vehicles ‎joining and leaving the ‎network, accordingly, the path with the highest connectivity is chosen. In the second stage, the control packets sent only to vehicles on the selected path to detect routes between source and destination, thus reducing the overhead of control packets and increasing network stability. ‎ the algorithm adopts the principle of global evaluation to ‎estimate the lifetime ‎of the ‎detected ‎routes within the chosen path. ‎the route with the ‎best estimated ‎lifetime ‎is ‎chosen to be ‎the active route. ‎in the event of route failure, the validity of the next route in lifetime is confirmed to be adopted as the alternate route. The proposed algorithm was compared with both on-‎demand distance ‎vector routing protocol (AODV) protocol and the modified location-aided routing ‎‎(LAR) ‎protocol. The proposed algorithm showed greater network stability, higher performance in terms of longer lifetime route detection, less energy consumption and higher throughput.

Performance evaluation of optimised protocol in MANET

Reliability being the major issue in efficient data transmission of real time applications in mobile ad hoc networks (MANET), this paper presents the design of a trustworthy routing protocol with delay optimisation and power competence for MANET. The scheme is based on the routing technique of ad hoc on demand distance vector routing (AODV) protocol which is a prominent reactive routing protocol of MANET. The key design methodology used in this research work is based on calculation of threshold value at every node regarding the power consumption rate of the node during processing, allowable delay at node with respect to the bounded delay and the packet processing rate. A cross layer approach of communication has been presented at the junction of data link layer and network layer in order to distribute the total route searching overhead for application specific packets among both the layers. The proposed protocol displays superior performance in terms of throughput, delay and more network life time when compared with conventional AODV protocol which can be derived from the simulation results of network simulator NS2.35.

A Novel Routing Protocol for Realistic Traffic Network Scenarios in VANET

The vehicular ad hoc network (VANET) has traditional routing protocols that evolved from mobile ad hoc networks (MANET). The standard routing protocols of VANET are geocast, topology, broadcast, geographic, and cluster‐based routing protocols. They have their limitations and are not suitable for all types of VANET traffic scenarios. Hence, metaheuristics algorithms like evolutionary, trajectory, nature‐inspired, and ancient‐inspired algorithms can be integrated with standard routing algorithms of VANET to achieve optimized routing performance results in desired VANET traffic scenarios. This paper proposes integrating genetic algorithm (GA) in ant colony optimization (ACO) technique (GAACO) for an optimized routing algorithm in three different realistic VANET network traffic scenarios. The paper compares the traditional VANET routing algorithm along with the metaheuristics approaches and also discusses the VANET simulation scenario for experimental purposes. The implementation of the proposed approach is tested on the open‐source network and traffic simulation tools to verify the results. The three different traffic scenarios were deployed on Simulation of Urban Mobility (SUMO) and tested using NS3.2. After comparing them, the results were satisfactory and it is found that the GAACO algorithm has performed better in all three different traffic scenarios. The realistic traffic network scenarios are taken from Dehradun City with four performance metric parameters including the average throughput, packet delivery ratio, end‐to‐end delay, and packet loss in a network. The experimental results conclude that the proposed GAACO algorithm outperforms particle swarm intelligence (PSO), ACO, and Ad‐hoc on Demand Distance Vector Routing (AODV) routing protocols with an average significant value of 1.55%, 1.45%, and 1.23% in three different VANET network scenarios.

A Routing Optimization Method Based on ACA for FANETs

Routing algorithm is an important factor and a key technology for Flying Ad hoc Networks (FANETs), which can safeguard FANET network communication. In FANETs, the fast-changing nature of FANET network topology makes the traditional Mobile Ad-hoc Networks (MANET) network routing algorithm not directly usable, which leads to challenges for the design of routing algorithms. In this paper, when the FANET nodes need to communicate, the route search program performs route search based on the ant colony algorithm, so as to obtain a stable route with high efficiency. Making use of NS3 for simulation of ACA, Dynamic Source Routing (DSR), and Ad hoc On demand Distance Vector Routing (AODV), the results of simulation show that ACA can improve FANET performance.

Reimbursement of sensor nodes and path optimization

In wireless sensor networks (WSNs) large numbers of sensor nodes are employed for various purposes. These sensors are placed in extreme condition where frequent monitoring of sensor health can’t be made. Hence there is a need for monitoring the integrity of sensor data and fault detection. The data delivered after the deadline is also useless. The proposed method brings about the need for checking the path delay for all nodes in the WSN. The faulty node is identified based on modified adhoc on demand distance vector routing protocol (mAODV). After spotting the faulty node it may be replaced with actor node to provide data within deadline. Delay time (DTA) algorithm is used to calculate path delay between source and destination. The fault recovery algorithm (FRA) is used to replace the faulty node with actor node.

Wireless Sensor Network Path Optimization Using Sensor Node Coverage Area Calculation Approach

The proposed work is based on the path optimization approach for wireless sensor network (WSN). Path optimization is achieved by using the NSG 2.1 Tool, TCL Script file and NS2 simulator to improve the quality of service (QoS). Path optimization approach finds best suitable path between sensor nodes of WSN. The routing approach is not only the solution to improve the quality but also improves the WSN performance. The node cardinally is taken under consideration using the ad-hoc on demand distance vector routing protocol mechanism. Ad hoc approach emphasize on sensor nodes coverage area performance along with simulation time. NSG 2.1 Tool calculates the sensor node packet data delivery speed which can facilitate inter-node communication successfully. An experimental result verified that the proposed design is the best possible method which can escape from slow network response while covering maximum sensor nodes. It achieves coverage support in sensor node deployment. The result outcomes show best path for transferring packet from one sensor node to another node. The coverage area of sensor node gives the percentage of average coverage ratio of each node with respect to the simulation time.

A New Secure Ad-Hoc on Demand Distance Vector Routing Protocol to Ensure Less Power Consumption in Mobile Ad-Hoc Network

Current time represents the era of communication technology and in this revolution MANET is widely used and act as a key star for data communication in real life decisive scenario for e.g., disaster management, traffic control, military services etc. MANET is infrastructureless data communication network comprising of mobile nodes. For MANET it requires secure and energy efficient framework for the underlying routing protocol. To meet the need of efficient data communication in MANET, an Energy Efficient and Secure AODV (EES-AODV) protocol is proposed. In the projected routing protocol, first the order of network nodes happen dependent on energy and afterward encryption has been done. Simulation of projected protocol is performed for such as Average Delay, PDR and Throughput. Simulated results shows that modified AODV gives optimized performance and provides a more secure and energy aware protocol.

Performance Improvement in Conventional AODV Using Energy Efficient Manifold Route Discovery Scheme

The decentralized network formed without any assistance of the fixed infrastructure and just by the employing the volunteering mobile or the portable devices that work in a cooperative manner along with the other devices that are clubbed in the network are inbuilt with the capacity of providing a best data conveyance facility utilizing the unicast, multicast and the broadcast methods of the routing strategies. Despite the capabilities of these type of networks, it faces difficulties in devising a strategy of routing according to the dynamic nature of the distributed network. The reactive type or the on demand routing are highly used over the proactive way of routing in the decentralized network as the performance of the former is better compared to the latter. As the mobile device employed are capable are moving from its position irrespective of time, and they behave as the route and as well as the end node or the initiating node. The important factors to be considered while forming the route is the power required for transmission and the current position of the nodes, this is quiet tedious. The study in the paper provides the importance of the on demand routing distance vector routing for the distributed network that are linked in a adhoc manner and analysis all the existing on demand distance vector routing strategies and form a new manifold route discovery scheme to improve the conventional_AODV. The method devised to improve the conventional_AODV proves to be efficient when simulated using the NS-3 on the basis of the packet delivery rate, load balancing and the energy usage.

Energy Efficiency in Ad-Hoc On Demand Distance Vector and Dynamic Source Routing Protocols Using High Energy First Algorithm for Mobile Ad-Hoc Networks

The main issue that occurs in battery powered applications in Mobile Ad Hoc networks (MANETs) is energy efficiency. Routing protocols are mainly based on energy related parameters which are used to extend the lifetime of networks. In most of the situations Shortest path routing protocols are used in MANETs which do not consider the energy awareness. Hence power failure of the nodes affect the life time of the network. In this paper we focus on Energy efficiency in Ad-hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocol by using High Energy First (HEF) algorithm to overcome the shortcomings that occur in MANETs due to increase in node density. Simulations are performed using NS-2 and we have compared the performance of AODV and DSR using HEF with the performance of existing DSR and AODV to prove the maximization of lifetime of the network. Simulation results show that the proposed protocols with HEF are efficient than the existing protocols.