Hoc On-demand Multipath Distance Vector Research Articles

Wireless Body Area Routing Protocols Impact Analysis on Entity Mobility Models with Static Sink Node

The most important and emerging characteristic of Wireless Body Area Networks (WBANs), which differentiates them from other wired and wireless area networks, is mobility. Therefore, the routing protocols for WBAN are designed in such a way that they can deal with dynamic changes in topology and provide maximum throughput, packet delivery ratio, average end-to-end delay, and minimum energy consumption. Thus, achieving optimal values for every performance parameter becomes a big challenge. This work investigates the performance of three separate path discovery protocols, such as Destination-Sequenced Distance-Vector Routing (DSDV), Ad Hoc On-demand Distance Vector (AODV), and Ad Hoc On-demand Multipath Distance Vector Routing protocol (AOMDV), for two different mobility models with a fixed-positioned sink. During experimentation, the AOMDV routing protocol achieves a high packet delivery ratio (PDR), average end-to-end delay, and throughput as compared to other routing protocols.

Greedy Weight Matrix Topological Adaptive Ad Hoc On-demand Multipath Distance Vector Protocol for QOS Improvement in MANET

Greedy Weight Matrix Topological Adaptive Ad Hoc On-demand Multipath Distance Vector Protocol for QOS Improvement in MANET

Energy Efficient Routing Protocol in Sensor Networks Using Genetic Algorithm.

In this paper, we examine routing protocols with the shortest path in sensor networks. In doing this, we propose a genetic algorithm (GA)-based Ad Hoc On-Demand Multipath Distance Vector routing protocol (GA-AOMDV). We utilize a fitness function that optimizes routes based on the energy consumption in their nodes. We compare this algorithm with other existing ad hoc routing protocols including LEACH-GA, GA-AODV, AODV, DSR, EPAR, EBAR_BFS. Results prove that our protocol enhances the network performance in terms of packet delivery ratio, throughput, round trip time and energy consumption. GA-AOMDV protocol achieves average gain that is 7 to 22% over other protocols. Therefore, our protocol extends the network lifetime for data communications.

Penerapan Algoritma EA-SHORT pada Protokol Routing AOMDV untuk Menemukan Rute yang Handal Berbasis Energi di Jaringan MANET

Mobile Ad Hoc Network (MANET) is a stand-alone wireless network, consisting of several nodes that can move in all directions freely. The routing protocol used as the object of this study is Ad Hoc On-Demand Multipath Distance Vector (AOMDV). This research carries out an energy calculation process at a node that can be used as a new energy-based route by utilizing topology changes. Energy efficiency in the routing protocol can be done using the Energy-Aware SHORT (Self Healing and Optimizing Routing Techniques) method. The main purpose of the Energy-Aware SHORT (EA-SHORT) algorithm is to save energy on MANET, by extending the life of nodes and networks by routing packets through nodes that have enough remaining power and avoiding nodes that have low power. AOMDV performance will be compared with AOMDV which has been modified with EA-SHORT measured from the specified parameter values. Analysis results show that the application of the EA-SHORT algorithm in the efficiency of route search succeeded in improving performance. The results of throughput on EA-AOMDV increased by 13.904% for an area of ​​500x500 m2 and 13.905% at 1000x1000 m2. The packet delivery ratio increased by 0.91% and 2.273%. Average end-to-end delay decreased by 20.482% and 18.734%.

Elephant Herding Optimization Ad Hoc On-Demand Multipath Distance Vector Routing Protocol for MANET

Energy consumption always represents a challenge in the ad hoc networks which spurred the researchers to benefit from the bio-inspired algorithms and their fitness functions to evaluate nodes energy through the path discovery stage. In this paper we propose energy efficient routing protocol based on the well-known Ad Hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol and a bio-inspired algorithm called Elephant Herding Optimization (EHO). In the proposed EHO-AOMDV the overall consumed energy of nodes is optimized by classifying nodes into two classes, while paths are discovered from the class of the fittest nodes with sufficient energy for transmission to reduce the probability of path failure and the increasing number of dead nodes through higher data loads. The EHO updating operator updates classes based on separating operator that evaluates nodes based on residual energy after each transmission round. Experiments were conducted using Ns-3 with five evaluation metrics routing overhead, packet delivery ratio, average energy consumption, end-to-end delay and number of dead nodes and four implemented protocols the proposed protocol, AOMDV and two bio-inspired protocols ACO-FDRPSO and FF-AOMDV. Results indicated that the proposed EHO-AOMDV attained higher packet delivery ratio with less routing overhead, average energy consumption and number of dead nodes over the state of art while in the end-to-end delay AOMDV has outperformed the proposed protocol.

Ad Hoc On-Demand Multipath Distance Vector Based Routing in Ad-Hoc Networks

In this paper, Ad hoc on-demand distance vector (AOMDV) routing protocol has been analysed based on different performance parameters in different network scenarios. Performance parameters like normalized routing load, throughput, dropped packets, receiving packets, average delay. At different values of network connections, pause times, simulation times, and speed rates, we compared performance of AOMDV with Ad hoc on-demand distance vector, Destination-Sequenced Distance Vector, and Dynamic Source Routing routing protocols. For simulation work, network-simulator 2.35 has been used.

Ad Hoc On-demand Multipath Distance Vector Based Routing in Ad-Hoc Networks

Ad Hoc On-demand Multipath Distance Vector Based Routing in Ad-Hoc Networks

Using Improved Hilbert–Huang Transformation Method to Detect Routing-Layer Reduce of Quality Attack in Wireless Sensor Network

Denial of Service (DoS) attack is a serious threat to the security of Wireless Sensor Netwokr (WSN). Moreover, Reduce of Quality (RoQ) attack is a special DoS attack type. The RoQ attack is a potential DoS attack, it is simulator to normal traffic,so it is difficult to be detected by traditional detection method. Hilbert–Huang Transform (HHT) time–frequency analysis method can be used to analyze the non-linear signal generated by RoQ attack. However, mode mixing and false component are the challenge problems to analyze the RoQ attack by HHT method. Ensemble empirical mode decomposition (EEMD) method is used to eliminate the mode mixing problem. Correlated coefficient method is used to recognize the false components. In this paper, EEMD and correlated coefficient methods are combined to detect the weak signal generated by RoQ attack. Ad Hoc On-demand Multi-path Distance Vector routing protocol and random Routing REQuest flooding attack are simulated to implement RoQ attack in wireless sensor network by Network Simulator. Suitable white noises are added to original signal to detect the weak RoQ attack signal. Experiment results show that the improved HHT methods are highly effective to detect RoQ attack, when the standard deviation of white noise is 0.01 and the number of ensemble is 80, the detection results is best. When the correlated coefficient of intrinsic mode functions (IMFs) is greater than 0.2, the IMFs can be used to analyze and detect RoQ attack. To our knowledge, this is the first quantitative experiment and method research on the routing-layer RoQ attack detection in WSN.

Efficient Route Update and Maintenance for Reliable Routing in Large-Scale Sensor Networks

Reliable data transmissions are challenging in industrial wireless sensor networks as channel conditions change over time. Rapid changes in channel conditions require accurate estimation of the routing path performance and timely update of the routing information. However, this is not well fulfilled in existing routing approaches. Addressing this problem, this paper presents combined global and local update processes for efficient route update and maintenance, and incorporates them with a hierarchical proactive routing framework. While the global process updates the routing path with a relatively long period, the local process with a shorter period checks potential routing path problems. A theoretical modeling is developed to describe the processes. Through simulations, the presented approach is shown to reduce end-to-end delay up to 30 times for large networks, while improving packet reception ratio (PRR) in comparison with hierarchical and proactive routing protocols ROL/NDC, DSDV, and DSDV with IPv6 Routing Protocol for Low-Power and Lossy Networks’ Trickle algorithm. Compared with reactive routing protocols AODV and Ad Hoc On-demand Multipath Distance Vector, it provides similar PRR while reducing end-to-end delay over 15 times.

TAR: TOA–AOA Based Random Transmission Directed Localization

This paper presents time-of-arrival (TOA) and angle-of-arrival (AOA) based random transmission directed localization (RTDL) technique. This technique can be applied in ad hoc networks, especially suitable for network with low frequency range in the wireless network. In this work, localization Error during node communication in wireless network would be optimized via TOA---AOA across multiple nodes and can focus on estimating the attackers' physical location in the network. In the proposed method using Ad hoc Mobile Distance Vector (AOMDV), we assume two categories of nodes: those equipped with known vector position of the omni-direction antenna (base-nodes) and those equipped with unknown vector position of the omni-direction antenna (target-nodes). All nodes are capable of communicating with other nodes. Base-nodes are capable of positioning (TOA---AOA estimation) the other nodes located in their coverage area. The system estimates the error rate of distance between the nodes, by measuring TOA---AOA based RTDL at an appropriate number of nodes. In the proposed system, we determine the Reliable Shortest Routing in Ad Hoc On-Demand Multipath Distance Vector Routing Protocol (AOMDV). This paper depicts the capability of the proposed method to considerably reduce the localization error and effectively determine the attacker's nearest location in the network.

Energy Aware Ad Hoc On-Demand Multipath Distance Vector Routing

The current disjoint path Ad hoc On-Demand Multi- path Distance Vector (AOMDV) routing protocol does not have any energy-awareness guarantees. When AOMDV is used in wireless sensor networks (WSNs) energy is an important consideration. To enhance the AOMDV protocol an extra energy metric is added along with the hop count metric. This Energy aware or EA-AOMDV improves path selection using a trade-off between energy and hop count, thus giving more longevity to WSNs. EA-AOMDV is compared to the current AOMDV routing protocol to prove its worth in the context of WSNs. It is found that EA-AOMDV leads to better WSN energy-awareness in resource constrained WSNs.

Fault Tolerant Multi-Criteria Multi-Path Routing in Wireless Sensor Networks

The Ad Hoc On-Demand Multi-Path Distance Vector (AOMDV) routing protocol allows the transport of data along one or more paths in wireless sensor networks (WSNs). The path chosen is based on a single shortest path hop count metric. The data on some WSNs is mission critical, for example, military and health care applications. Hence, fault tolerance in WSNs is becoming increasingly important. To improve the fault tolerance of WSNs in lossy environments, this work adds to the AOMDV routing protocol as it incorporates an additional packet loss metric. This Multi-criteria AOMDV or M-AOMDV is evaluated using the ns2 simulator. Simulations show that M- AOMDV maintains relatively low packet loss rates when the WSN is experiencing loss.

Ad Hoc On-Demand Multipath Distance Vector Routing Protocol Based on Node State

To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’s performance in selecting main path. In route discovery process, the routing update rule calculates the node weight of each path and sorts the path weight by descending value in route list, and we choose the path which has the largest path weight for data transmission. NS-AOMDV also uses the technology of route request (RREQ) packet delay forwarding and energy threshold to ease network congestion, limit the RREQ broadcast storm, and avoid low energy nodes to participate in the establishment of the path. The results of simulation show that NS-AOMDV can effectively improve the networks’packets delivery rate, throughput and normalized routing overhead in the situation of dynamic network topology and heavy load.

Performance analysis and comparison of AODV and AOMDV routing protocols

Mobile Ad Hoc network is a self-organizing network in which routing protocols play an important role.The authors described the features of Ad Hoc On-Demand Distance Vector Routing(AODV)protocol and Ad Hoc On-Demand Multipath Distance Vector Routing(AOMDV)protocol and evaluated their performance through a variety of test scenes and different Media Access Control(MAC)protocols in NS2.The experimental results show that AOMDV protocol provides better performance than AODV protocol in terms of average delay and route discovery frequency,and worse performance in terms of packet delivery ratio and normalized rooting load.

CROSS-LAYERED MAC AND MULTIPATH ROUTING PROTOCOLS IN MULTI-HOP WIRELESS MOBILE NETWORKS

In this paper, we propose a multipath routing scheme for wireless mobile networks which extends the Ad Hoc On-demand Multipath Distance Vector (AOMDV) routing protocol, by introducing a novel load-balancing approach to concurrently distribute the traffic among the multiple paths. The traffic-path allocation scheme is based on cross-layer measurements of path statistics reflecting the size and congestion level of each path. In order to provide an efficient support to the proposed routing scheme at the MAC layer, we also study the composition effect of a IEEE 802.11-based enhanced MAC forwarding mechanism called Fast Forward (FF), used to reduce the effects of self-contention among frames at the MAC layer. The protocol framework has been modelled and extensively simulated for a large set of metrics and scenarios. Simulation results provide guidelines for multi-hop communication solutions under both static and mobile scenarios and different traffic loads.