Demand Distance Vector Routing Protocol 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.

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

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.

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.

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.

EPLAODV: Energy Priority and Link Aware Ad-hoc On-demand Distance Vector Routing Protocol for Post-disaster Communication Networks

In Mobile Ad-hoc Networks (MANETs) the major issue between nodes for data transfer is link quality. The majority of the MANET routing protocols try to maintain the link quality between nodes but still need improvement. This paper focuses on link quality between nodes in an ad hoc network in emergency scenarios through the design of the Energy Priority and Link Aware Ad-hoc On Demand Distance Vector (EPLAODV) routing protocol. EPLAODV improves the link quality between nodes through SNR. For performance analysis, the NS2.35 network simulator was used. Simulation time and traffic load were the major simulation parameters. From the simulation results, it is observed that EPLAODV performs better than AODV.

Trust framework for attack resilience in MANET using AODV

Mobile Ad-hoc network (MANET) is a collection of arbitrary moving autonomous nodes having routing capabilities. Theoretically, nodes are expected to cooperate with each other to facilitate communication with not directly connected nodes but in real scenario some of the nodes may be malicious. These compromised /malicious nodes may be part of the network or any other node trying to intrude in the network. A trust based framework is proposed in this paper to make the network resilient to malicious nodes. Trust is calculated using route request and route reply counter to make it simple and scalable. Ad Hoc On- Demand Distance Vector (AODV) routing protocol is used as the basic protocol. Performance analysis is done by varying malicious node density and calculating packet loss & average packet delay. It shows that the proposed framework along with trust calculating mechanism is giving better results as compared to basic routing protocol AODV in the presence of malicious nodes.

Impact of wormhole attack on AODV routing protocol in vehicular ad-hoc network over real map with detection and prevention approach

Vehicular Ad-hoc Network (VANET) is a subclass of Mobile Ad-hoc Network (MANET) which provides the safety measure and other different applications to the drivers of the vehicles. The goal of VANET is to fulfil the requirements of users on roadside area, which improves the safe and comfortable journey. Secure routing is the main issue in VANET. Dynamic topology and wireless networking makes the VANET vulnerable to numerous sorts of attacks. Wormhole is one of the extreme assaults in VANET. This type of attack disturbs the working of routing protocol such as Ad hoc On demand Distance Vector (AODV) routing protocol. The motivation of this research work is that by using proposed detection and prevention approach the VANET can be made more secure. The results show how the performance of AODV routing protocol is affected by wormhole. In this research paper the impact of wormhole attack is analysed in terms of throughput, packer delivery ratio, and end-to-end delay. An approach is also proposed to detect and prevent wormhole attack in VANET over a real map on different vehicle densities based on multipath concept.

Impact of wormhole attack on AODV routing protocol in vehicular ad-hoc network over real map with detection and prevention approach

Vehicular Ad-hoc Network (VANET) is a subclass of Mobile Ad-hoc Network (MANET) which provides the safety measure and other different applications to the drivers of the vehicles. The goal of VANET is to fulfil the requirements of users on roadside area, which improves the safe and comfortable journey. Secure routing is the main issue in VANET. Dynamic topology and wireless networking makes the VANET vulnerable to numerous sorts of attacks. Wormhole is one of the extreme assaults in VANET. This type of attack disturbs the working of routing protocol such as Ad hoc On demand Distance Vector (AODV) routing protocol. The motivation of this research work is that by using proposed detection and prevention approach the VANET can be made more secure. The results show how the performance of AODV routing protocol is affected by wormhole. In this research paper the impact of wormhole attack is analysed in terms of throughput, packer delivery ratio, and end-to-end delay. An approach is also proposed to detect and prevent wormhole attack in VANET over a real map on different vehicle densities based on multipath concept.

RANDOM-AODV: Efficient Adhoc on Demand Distance Vector Routing Protocol using Fuzzy Logic during Black Hole Attack

However the black hole attack prevention has been proposed earlier but it is observed that the packet dropping increases constantly as the number of black hole attack are increased. The proposed work is making use of fuzzy logic. This mechanism allows the random node selection so it is supposed to maintain the packet delivery ratio. Results of this research show that the proposed mechanisms do not allow packet dropping on constant rate. Many studies are made that are simulating influence of attack made by .black .hole in the network based on .AODV. It has been observed that there is constant fall in the packet dropping ratio if number of malicious packet increases. This paper has represented the Black Hole attack over AODV routing when random node selection mechanism is applied. Proposed work is allowing selection of nodes on random basis. Such mechanism is supposed to improve the ratio of delivery of packet. Results of Simulation indicates the impact of black hole attack over packet delivery ratio , packet .loss .ratio, .Average .end to .end delivery, and .routing over head. Moreover the comparative analysis of .traditional and .proposed model is made considering packet delivery ratio.

Single and Multi-Type Controllers with Soft Computing Methods and Routing in Software Defined Network

The software defined networking topology is enabled for efficient configuration for monitoring and enhance the network performance. The multi-controller placement becomes very critical, and it can be rectified by the proposed approach. The comparison of single type and the multi controllers are discussed in this paper.The first paper is compared with the dragonfly algorithm, in this we have considered only multi POX controllers. So the latency difference depends on the iteration of the algorithm. Thus the latency is reduced in proposed algorithm. Similarly the second paper has compared with the existing algorithm of firefly, which states the multi type of controllers such as POX, NOX, BEACON and FLOODLIGHT, among that latency is calculated and compared. The selection criteria are varied according to its type. Hence the routing is carried out on the two controllers alike POX, and NOX, through ad hoc on demand distance vector routing protocol. Subsequently, the selected controllers specifically are placed and simulated in Pareto-based Optimal Controller placement (POCO) tool for the Internet 2 topology and network simulator(NS2). Finally the comparison results makes the proposed system is better than previous methods.

Performance of Energy Conservation Models, Generic, Micaz and Micamotes, using AODV Routing Protocol on a Wireless Sensor Network

Wireless Sensor Networks (WSN’s) have gained a considerable importance and are used for a variety of applications. In WSN, an arrangement of sensor nodes is done to sense and collect information from its nearby environment and to send it back to the base station using routing protocol. The biggest challenges are how to handle the routing problems and to optimize the energy consumption in WSN. In this paper, performance evaluation of three energy models, Generic, Micaz and Micamotes, is presented using Ad-Hoc On demand Distance Vector (AODV) routing protocol. The performance evaluation is done using several parameters: Throughput, Jitter, Average End-to-End Delay (AEED), Total Packets Received (TPR) and Energy consumption inthree modes (transmit, receive and idle). Based on the evaluation, it has been found that Micamotes energy model using AODV routing protocol consumes less energy by 80.46% and 428.57% in transmit mode , 102.94% and 335.6% in receive mode from Micaz and Generic energy models, respectively.

Fuzzy Logic Based Raodv Routing Protocol

Fuzzy Logic system comes as a very efficient and important tool that is used to make intelligent decisions when inadequate data is available. This research work is focused on the enhancement of Fuzzy based RAODV routing protocol. It is very efficient to select the optimal paths for data packet transmission between source and desitnation node and also increse the network life time. Fuzzy Logic control is generally designed on three fuzzy variables of energy, hop count and queue length which is also enhance the rule of Fuzzy logic to improve the lifetime of the network. Optimal paths are traced and selected which is depends on these fuzzy variables, used to improvise and enhance the process of Reverse Ad hoc on Demand Distance Vector (RAODV) routing protocol and also helpful to improve the lifetime of the network. NS2 Simulator are used to analyze the concert of RAODV and Fuzzy based Reverse Ad hoc on demand Distance Vector (FRAODV) routing protocol which is based on packet size and round time of network using the parameters of Packet delivery ratio, energy consumption and end to end delay , performance results shows that FRAODV is more accomplished and improves the lifetime of the network.