Ad Hoc On-demand Distance Vector Research Articles

Fault Tolerance Mechanism for Internet of Things (IoT) by Solving Nature Inspired Computing Algorithm (NIC)

In clustering approach the sensor nodes are grouped to form a cluster. The nodes of a clustering network have low powered battery capability and limited processing capabilities. These nodes continuously exchange the data to cluster head which is in turn transforming the data to its base station. Few of these nodes in network may be faulty or may not support life time processing data due to its low power battery. All these sensor nodes measure the temperature, humidity, sound and pollution from environment and collected data is send to cloud for further processing. The fault tolerance mechanism of these nodes is solved by applying genetic algorithm by implementing chromosome technique to identify and avoid fault nodes in the network. This proposed research work increases detection of fault nodes in a network, increase network efficiency, lifetime and reach energy optimization results in Internet of Things (IoT) concept. The performance evaluation shows that the data accuracy in Genetic Algorithm (GA) is higher when compared with Direct Diffusion (DD) Algorithm and Ad-hoc on demand Distance Vector (AODV) Algorithm.

Novel AODV based service discovery protocol for MANETS

Service discovery is an inevitable process in most of the network. Mobile AdHoc network (MANET) being self-sustained and resource constrained, sharing of resources and service discovery is very essential. A service discovery protocol designed for a fixed network is not suitable for AdHoc network because of the constraint in the resources, mobility of nodes and the lack of centralized infrastructure. Therefore there arises a need to design protocols specific to MANET. A protocol designed for service discovery at the application layer in Mobile AdHoc Network would generate the same amount of control messages during service discovery as would a routing protocol during route discovery. To ease the network congestion it would be beneficial to integrate service discovery with route discovery. This would discover the services and route simultaneously. Therefore the AdHoc On-demand Distance Vector (AODV) routing protocol being a reactive routing protocol was modified to include service discovery so that as the services are discovered, a route to the service provider is also available. During service discovery if multiple servers are offering the same service, there arises a need to select the best one. We propose a ranking mechanism that selects an optimal server by considering the route and server specific metrics. We also propose an algorithm that performs service discovery by taking care of Expanding Ring Search of AODV protocol so as to be able to discover multiple servers. The proposed approach has been evaluated, and it was observed that the storage overhead is reduced by 50%, average Service Discovery Latency was reduced and the Service Discovery Ratio was improved by 16%.

An improved AODV routing security algorithm based on blockchain technology in ad hoc network

Ad hoc network is a special network with centerless and dynamic topology. Due to the free mobility of the nodes, routing security has been a bottleneck problem that plagues its development. Therefore, a multi-path QoS (quality of service) routing security algorithm based on blockchain by improving the traditional AODV (ad hoc on-demand distance vector) protocol (AODV-MQS) is proposed. Firstly, a chain of nodes is established in the network and the states of all nodes by making the intermediate nodes on the chain are saved. Secondly, the smart contract in the blockchain is set to filter out the nodes that meet the QoS constraints. Finally, two largest unrelated communication paths are found in the blockchain network through smart contract, one of which is the main path and the other is the standby path. Simulation experiments show that the performance of the proposed algorithm is better than other algorithms, especially in an unsafe environment.

A geographic routing protocol based on trunk line in VANETs

A Trunk Line Based Geographic Routing(TLBGR) protocol in Vehicular Ad-hoc Networks (VANETs) is proposed in this paper to solve the problem of data acquisition in the traditional trunk coordinated control system. Because of the characteristics of short communication time and high packet loss among vehicles, the vehicles entering the trunk lines can not transmit their information to the trunk coordinated control system stably. To resolve this problem, the proposed protocol uses the trunk lines’ traffic flow and the surrounding road network to provide a real-time data transmission routing scheme. It takes into account the data congestion problem caused by the large traffic flow of the main roads, which leads to the corresponding increase of the information flow of the section and the package loss, and the link partition problem caused by the insufficient traffic flow, which makes the vehicles have to carry and relay information thus increasing the transmission delay. The proposed TLBGR protocol can be divided into two stages: the next-intersection selection, and the next-hop selection in the chosen path between the current and next intersections. Simulation results show that, compared with other IoT routing protocols including Greedy Perimeter Stateless Routing (GPSR), Ad-hoc On Demand Vector (AODV), and Q-AODV, the TLBGR protocol has better performance in aspects of end-to-end delay, delivery rate, and routing cost under the scenario of urban traffic trunk lines. The TLBGR protocol can effectively avoid data congestion and local optimum problems, increase the delivery rate of data packets, and is therefore suitable for the routing requirements in this application scenario.

A fault tolerant routing scheme for advanced metering infrastructure: an approach towards smart grid

The wireless sensor network is gaining significant attention because of its ubiquitous deployability nature. In general, the role of the wireless sensor network is remarkable in smart city applications for data sensing, collecting, and transmitting. Advanced metering infrastructure is an automatic system for the reading of electricity consumption by individual users. The reading of data from meters normally communicated over a wireless medium. Apart from collecting and sensing, routing is one of the major attributes in the AMI network. Successful communication is possible when the link and node are in the proper state. In this paper, we propose a fault-tolerant routing mechanism named Grid Topological Routing scheme to provide an efficient route in case of encountering a faulty path. The simulation shows better performance against the Routing Protocol for Low-Power and Lossy Networks and Ad-Hoc On-Demand Vector algorithm in terms of power consumption and packet delivery ratio. This model is explicitly designed for the smart grid in India.

Performance evaluation of AODV over CSMA and TSCH

AODV (Ad hoc On‐Demand Distance Vector) is a well‐known routing protocol for wireless networks. Recently, Time Slotted Channel Hopping (TSCH) was proposed as a MAC layer protocol, specified in the IEEE 802.15.4e standard. As MAC layer protocols can impact the performance of protocols in the layers above, we examine the performance of AODV over TSCH and compare it with CSMA. We investigate using different metrics, such as latency, packet delivery rate, and energy consumption. We implemented AODV, as defined by the RFC 3561, using the embedded systems operational system Contiki‐NG, a well established platform for Low power and Lossy Networks (LLNs), and the Internet of things (IoT). Our results, running on the Cooja platform, show that TSCH can greatly improve the performance of AODV, achieving a packet delivery rate of almost 100%. Moreover, our results also show that TSCH consumes less energy than CSMA.

Hybrid AODV: An Efficient Routing Protocol for Manet Using MFR and Firefly Optimization Technique

A MANET is a category of ad hoc protocol that could vary positions and track itself on the flutter. It utilizes wireless connections that are attached to several networks. They include wirelessly in a self-configured, self-healing network while not having permanent communication linked in a collection of mobile networks. The network topology of nodes typically varies in MANET, and nodes are free to stir errantly and independently as a router as they accelerate traffic to more nodes within the network. Ad hoc on-demand distance vector (AODV) was employed for node selection to attain the shortest path strategy in existing techniques. In the proposed system, the hybrid AODV (HAODV) technique incorporates the MFR (Most Forward within Radius) technique to detect the shortest path routing algorithm. The MFR method was deployed for selecting the neighbor node, while HAODV was deployed to find the shortest path. To find the shortest path based on the updating equation, the Firefly algorithm is also implemented into the Hybrid AODV. The proposed work’s performance is calculated by different network parameters like the end to end delay, average routing overhead, throughput, and packet delivery ratio. After comparing AODV and DSR algorithms, the proposed algorithm (HAODV) shows improvement in packet delivery ratio, end-to-end delay, Routing overhead, and throughput.

Performance Evaluation of Mobility Models over UDP Traffic Pattern for MANET Using NS-2

The current study presents the simulative study and evaluation of MANET mobility models over UDP traffic pattern to determine the effects of this traffic pattern on mobility models in MANET which is implemented in NS-2.35 according to various performance metri (Throughput, AED (Average End-2-end Delay), drop packets, NRL (Normalize Routing Load) and PDF (Packet Delivery Fraction)) with various parameters such as different velocities, different environment areas, different number of nodes, different traffic rates, different traffic sources, different pause times and different simulation times . A routing protocol.…was exploited AODV(Adhoc On demand Distance Vector) and RWP (Random Waypoint), GMM (Gauss Markov Model), RPGM (Reference Point Group Model) and MGM (Manhattan Grid Model) mobility models above CBR traffic sources. The results of Reference Point Group Model simulation illuminate that routing protocol performance is best with RPG mobility model than other models.

EFFICIENCY ANALYSIS OF AODV, DSDV, DSR ROUTING PROTOCOLS

MANET stands for Mobile Ad-Hoc Network, they consist of mobile nodes that offer a routable networking environment in the link layer. The nodes are connected wirelessly in a self-healing, self-configured network that have no fixed infrastructure or centralized management. Routing in MANET’s is a very inconvenient process as wireless links in this network are highly prone to error and go down frequently because of the mobility of nodes. Therefore, it is a highly researched topic around the world, and to overcome such difficulty many routing protocols have been suggested around the world to improve its efficiency. Some protocols used in this paper are Ad-hoc On-demand Distance Vector (AODV), Destination Sequenced Distance Vector (DSDV), and Dynamic Source Routing. This paper hopes to summarize all the recent work done on MANET Routing protocols and the network simulator tool.

PUSR: Position Update Secure Routing protocol for MANET

Mobile ad hoc network is a self-organizing wireless network, which is formed by the wireless mobile devices without any centralized infrastructure. The mobile nodes in the network are mainly affected by the inherent characteristics such as unpredictable network topology and open wireless medium. Especially, the presence of selfish nodes in the network creates the packet loss and affects an entire communication system. In this paper, the hash function with position updating algorithm is proposed in the Ad hoc On-Demand Distance Vector (AODV) routing protocol for improving the security against the selfish nodes. The AODV routing protocol is used to transmit the data packets from the source to the destination. Therefore, the Prevention of Selfish Node using Hash Function (PSNHF) with position update algorithm is proposed for minimizing the packet loss through the network. The performances of proposed AODV-PSNHF method are analysed in terms of energy consumption, throughput, Packet Delivery Ratio (PDR), packet loss and normalized routing load. In addition, the AODV-PSNHF method is compared with the existing trust-aware ad-hoc routing protocol (T2AR). The selfish node identification using hash function and positioning update using AODV-PSNHF method provides reliable and secure data transmission under selfish nodes and shows better performance in terms of throughput, packet delivery ratio and packet loss. For 2% of malicious nodes the PDR of the AODV-PSNHF method is 89%, it is 9% higher when compared to the T2AR protocol whose PDR% is only 80% for the same.

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.

Mobile ad-hoc network routing protocols of time-critical events for search and rescue missions

The most important experiences we discovered from several disasters are that cellular networks were vulnerable, and the loss of the communication system may have a catastrophic consequence. Mobile ad-hoc networks (MANETs) play a significant role in the construction of campus, resident, battlefield and search/rescue region. MANET is an appropriate network for supporting a communication where is no permanent infrastructure. MANET is an effective network that uses to establishing urgent communication between rescue members in critical situations like, disaster or natural calamities. The sending and receiving data in MANET is depending on the routing protocols to adapt the dynamic topology and maintain the routing information. Consequently, This paper evaluates the performance of three routing protocols in MANET: ad-hoc on-demand distance vector (AODV), destination sequenced distance vector (DSDV), and ad-hoc on-demand multipath distance vector (AOMDV). These protocols are inherent from different types of routing protocols: single-path, multi-path, reactive and proactive mechanisms. The NS2 simulator is utilized to evaluate the quality of these protocols. Several metrics are used to assess the performance of these protocols such: packet delivery ratio (PDR), packet loss ratios (PLR), throughput (TP), and end-to-end delay (E2E delay). The outcomes reveal the AOMDV is the most suitable protocol for time-critical events of search and rescue missions.

Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks

With the development of wireless technology, two basic wireless network models that are commonly used, known as infrastructure and wireless ad hoc networks (WANETs), have been developed. In the literature, it has been observed that channel contention is one of the main reasons for packet drop in WANETs. To handle this problem, this paper presents a routing protocol named CCBR (Channel Contention Based Routing). CCBR tries to determine a least contended path between the endpoints to increase packet delivery ratio and to reduce packet delay and normalized routing overhead. Moreover, throughout the active data section, each intermediate node computes its channel contention value. If an intermediate node detects an increase in channel contention, it notifies the source node. Then the source node determines another least contended route for transmission. The advantages of CCBR are verified in our NS2-based performance study, and the results show that CCBR outperforms ad hoc on-demand distance vector (AODV) in terms of packet delivery ratio, end-to-end delay, and routing overhead by 4% to 9%.

Performance Improvements of AODV by Black Hole Attack Detection Using IDS and Digital Signature

In mobile ad hoc networks (MANETs), mobile devices connect with other devices wirelessly, where there is no central administration. They are prone to different types of attacks such as the black hole, insider, gray hole, wormhole, faulty node, and packet drop, which considerably interrupt to perform secure communication. This paper has implemented the denial‐of‐service attacks like black hole attacks on general‐purpose ad hoc on‐demand distance vector (AODV) protocol. It uses three approaches: normal AODV, black hole AODV (BH_AODV), and detected black hole AODV (D_BH_AODV), wherein we observe that black holes acutely degrade the performance of networks. We have detected the black hole attacks within the networks using two techniques: (1) intrusion detection system (IDS) and (2) encryption technique (digital signature) with the concept of prevention. Moreover, normal AODV, BH_AODV, and D_BH_AODV protocols are investigated for various quality of service (QoS) parameters, i.e., packet delivery ratio (PDR), delay, and overhead with varying the number of nodes, packet sizes, and simulation times. The NS2 software has been used as a simulation tool to simulate existing network topologies, but it does not contain any mechanism to simulate malicious protocols by itself; therefore, we have developed and implemented a D_BH_AODV routing protocol. The outcomes show that the proposed D_BH_AODV approach for the PDR value delivers around 40 to 50% for varying nodes and packets. In contrast, the delay decreases from 300 to 100 ms and 150 to 50 ms with an increase in the number of nodes and packets, respectively. Furthermore, the overhead changes from 1 to 3 for various nodes and packet values. The outcome of this research proves that the black hole attack degrades the overall performance of the network, while the D_BH_AODV enhances the QoS performance since it detects the black hole nodes and avoids them to establish the communication between nodes.

ANN Based Novel Approach to Detect Node Failure in Wireless Sensor Network

A wireless sensor network (WSN) consists of several tiny sensor nodes to monitor, collect, and transmit the physical information from an environment through the wireless channel. The node failure is considered as one of the main issues in the WSN which creates higher packet drop, delay, and energy consumption during the communication. Although the node failure occurred mostly due to persistent energy exhaustion during transmission of data packets. In this paper, Artificial Neural Network (ANN) based Node Failure Detection (NFD) is developed with cognitive radio for detecting the location of the node failure. The ad hoc on-demand distance vector (AODV) routing protocol is used for transmitting the data from the source node to the base station. Moreover, the Mahalanobis distance is used for detecting an adjacent node to the node failure which is used to create the routing path without any node failure. The performance of the proposed ANN-NFD method is analysed in terms of throughput, delivery rate, number of nodes alive, drop rate, end to end delay, energy consumption, and overhead ratio. Furthermore, the performance of the ANN-NFD method is evaluated with the header to base station and base station to header (H2B2H) protocol. The packet delivery rate of the ANN-NFD method is 0.92 for 150 nodes that are high when compared to the H2B2H protocol. Hence, the ANN-NFD method provides data consistency during data transmission under node and battery failure.

АНАЛИЗ ПРОИЗВОДИТЕЛЬНОСТИ ПРОТОКОЛОВ РЕАКТИВНОЙ МАРШРУТИЗАЦИИ В VANET НА БАЗЕ NS3

Since importance of improving of Intelligent Transportation System (ITS) always follow modern trends by using new wireless communication technologies, the trend of latest research topics is focusing on Vehicular Ad Hoc Network (VANET). VANET networks play a vital role in ITS due to their increasing importance for the building of ITS. VANET is a subclass of mobile ad-hoc networks (MANET). VANET depends on wireless technologies to establish communication between moving vehicles (nodes). An appropriate and efficient routing protocol helps to successful exchange data between mobility nodes in vehicular ad-hoc networks. VANET has a lot of similar features to MANETs such as finite bandwidth, self-arrangement, self-administration, and unstable network topology. Except it has some important features of its characteristic such as very high node mobility, delay restrictions, and frequent network outages. For this reason, routing in VANET networks is much more complex than routing in MANET networks. The purpose of this study - to evaluate the performance of protocols AODV (Ad hoc On-Demand Distance Vector) and DSR (Dynamic Source Routing) and their impact on the performance of networks VANET. This paper differs in that it analyses the impact of network size at a large number of nodes, and different vehicle speeds on network performance metrics like packet delivery ratio, throughput, average delay, overhead and packet loss ratio and assessing the level of network performance at realistic mobility scenarios for the movement of vehicles in the street generated by Bonnmotion tool. Also, the simulation is carried out in NS-3 simulator to create VANET network topology and routing protocols.

Energy efficient hierarchical based fish eye state routing protocol for flying Ad-hoc networks

<span>Flying Ad-hoc networks are emergent area in Ad-hoc networks evolved from MANETs and VANETs. Small unmanned aerial vehicles (UAVs) are used in FANETs applications and these small UAVs have limited resources while efficiently utilization of these resources is most critical task in real time monitoring of FANETs application. Network consumes its resources in path selection process and data routing from source to destination. Selecting of efficient routing protocol to utilize all available resources played vital role in extending network life time. In this article fisheye state routing (FSR) protocol is implemented in FANET and compare networks performance in term of channel utilization, link utilization vs throughput and packet delivery ratio (PDR) with distance sequence distance vector (DSDV), optimized link state routing (OLSR), adhoc on demand distance vector (AODV), dynamic source routing (DSR) and temperary ordered routing protocol (TORA). Experimental analysis slows that FSR is good in term of PDR (16438 packets delivered), channel utilization (89%) and link vs throughput from the rest of routing protocols after addressing of these problems UAVs resources are efficiently utilized (energy).</span>

Retracted] 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.

Mobility‐Aware Routing Algorithm for Mobile Ad Hoc Networks

Mobile ad hoc network (MANET) is a group of wireless mobile nodes that create a temporary network without the help of any central administration or standard support services. Mobility of nodes determines the overall performance of MANET networks. High mobility of nodes causes frequent changes in the network topology, and this leads to link breakage and increases reinitiating of the route discovery process. MANETs commonly use broadcasting techniques for route discovery process. However, it can cause redundant rebroadcasts, packet collisions, and channel contention. The main objective of this paper is to design and develop the mobility‐aware routing algorithm (MARA) to enhance the performance of the routing protocol in MANETs. The proposed scheme allows mobile nodes to rebroadcast or discard received broadcasted messages. The decision is based on the combination of node speed, distance between nodes, and residual energy of nodes. These parameters are considered both in route request and route reply process to reduce the chance of link breakage and broadcast storm problems. The proposed algorithm has been evaluated based on the performance metrics: packet delivery ratio, average end‐to‐end delay, throughput, and routing overhead. We have used network simulator NS‐2 V‐2.35. The simulation results revealed that MARA outperforms ad hoc on‐demand distance vector (AODV), mobility and direction aware (MAD), and mobility and energy‐aware (MAE) routing protocols.