Demand Distance Vector Research Articles

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.

Research of Security Routing Protocol for UAV Communication Network Based on AODV

With the rapid development of information technology and the increasing application of UAV in various fields, the security problems of unmanned aerial vehicle (UAV) communication network have become increasingly prominent. It has become an important scientific challenge to design a routing protocol that can provide efficient and reliable node to node packet transmission. In this paper, an efficient Digital Signature algorithm based on the elliptic curve cryptosystem is applied to routing protocol, and an improved security method suitable for on-demand routing protocol is proposed. The UAV communication network was simulated through the NS2 simulation platform, and the execution efficiency and safety of the improved routing protocol were analyzed. In the simulation experiment, the routing protocols of ad-hoc on demand distance vector (AODV), security ad-hoc on demand distance vector (SAODV), and improved security ad-hoc on demand distance vector (ISAODV) are compared in terms of the performance indicators of packet delivery rate, throughput, and end-to-end delay under normal conditions and when attacked by malicious nodes. The simulation results show that the improved routing protocol can effectively improve the security of the UAV communication network.

Competitive analysis of single and multi-path routing protocols in mobile Ad-Hoc network

<p>A Mobile Ad-hoc Network (MANET) refers to a dynamic and wireless network, which can be designed without an existing infrastructure as every node serves as a router. A MANET is a self-configuring system of mobile nodes that are connected wirelessly. Every node serves as a sink, as well as a router to send packets. The movement of the nodes is not restricted as they can move in any direction, and they have the ability to get organized into a network. Due to their free and independent movement, they do not have a fixed position; they often change positions. In this study, the Dynamic Source Routing (DSR) and Ad-hoc On Multipath Demand Distance Vector (AOMDV) protocols are compared using Network Simulator NS2.35. DSR is a reactive gateway discovery algorithm whereby the connection of a MANET mobile device is established only on demand. Basically, AOMDV was specially tailored for ad-hoc networks that are highly dynamic to respond to link failures and breakages in the network. It ensures that the paths for destinations are sustained, and it defines the new routing information using destination serial numbers to ensure loop freedom always while avoiding problems. More so, it is a protocol that is based on a timer that can discover ways through which the mobile nodes respond to link breakages and change in topology. A comparison of protocols has been carried out individually and jointly with the aim of evaluating their performance. The performance is measured in terms of End-to-End Delay, Packet Delivery Ratio, Packet Loss Ratio, and Routing Overhead Ratio. The performance of the routing protocols was done using two scenarios; when there is a change in the simulation time and when there is a change in the number of nodes.</p>

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.

Comparison of AODV and DSR in MANET’s

MANET acronym for Mobile Ad-hoc Network is a wireless network that is it operates without any physical fixed infrastructure and does not need any centralized access point. Mobile network is wireless in nature that is any node can be part of this network. Different routing protocols exist in a network like reactive, proactive and hybrid. They may be better in one network while nastiest in the other. In this paper we have made an effort for the comparison of the performance of AODV (Ad-hoc On Demand Distance Vector) and DSR (Dynamic source routing) on simulation tool like NS-2 on the basis of various parameters like packet delivery ratio, delay and average throughput.

Efficient and Reliable Communication to Reduce Broadcast Storm in Rural and Urban Scenario using RGHN and UGHN Protocol

In order to reduce overhead and to improve throughput an effective in Rural Group Head Node(RGHN) and Urban Group Head Node (UGHN) protocol can be implemented in the respective rural and urban scenarios. The first section deals with the efficient implementation of RGHN and UGHN protocols in VANET. In the next phase, working of RGHN in rural areas and UGHN protocol in urban areas are described and the performance analyzed. The developed protocol RGHN and UGHN needs comparison with the standard protocols under both the scenarios. The performance of the proposed protocol RGHN in rural scenario is compared with that of Dynamic Source Routing (DSR) and UGHN in urban scenario is compared with Ad-hoc On demand Distance Vector (AODV) shows the proposed technique providing a better result in terms of throughput, packet delivery ratio, delay and packet loss ratio in the network.

DRI Table Based Traffic-Behaviour Analysis Approach for Detection of Blackhole Attack

Background: The blackhole infection can affect the collaborative communication in mobile networks. It is man-in-middle attack that seizes and deflects the route and avoids packet-forwarding in the network. The occurrence of collaborative-blackhole reduces the trust and trustworthiness over the network. Objective: A probabilistic and weighted analysis based protocol is proposed in this research for detection of cooperative blackhole nodes and generating the preventing route over the network. The aim of the work is to improve the communication reliability. Methods: In this paper, the communication behaviour is analyzed under associated and probabilistic measures using Data Routing Information (DRI) table to discover the blackhole attack. It applies a dual check based on participation and communication constraints to estimate the node criticality. The evaluation is performed by neighbours and neighbour-on-neighbour nodes with weights and threshold specific decisions. These measures are evaluated through composite and integrated measures and presented as decision metrics. The parametric and probabilistic checks are conducted as a comprehensive evaluation within the proposed PSAODV (Probabilistic Secure Adhoc On Demand Distance Vector) protocol. Results: The simulation of PSAODV protocol is conducted in NS2 environment on various scenarios with mobility, density and traffic type variations. The scenarios are defined with a higher density of blackhole nodes within the network. The adaptive weights are identified by simulating the network with different weight combinations. These weights are employed within the PSAODV protocol to configure it with the maximum benefits. The analytical evaluations are taken against AODV and SAODV protocols and identified the performance enhancement in terms of Packet Delivery Ratio (PDR) Ratio, delay, attack detection ratio parameters. Conclusion: A significant improvement in attack detection is achieved by this proposed PSAODV protocol. The proposed protocol improved the reliability and effectiveness of mobile network.

ANALYSIS OF BLACK HOLE ATTACK DURING ROUTE DISCOVERY PHASE OF AODV IN MANET

MANET (Mobile ad hoc networks) is a collection of wireless mobile nodes dynamically forming an infrastructure less network. Several routing protocols are designed for routing of packets in MANET. One of them is AODV (Ad hoc on demand Distance Vector) protocol whose performance is better for higher mobile nodes. It is more vulnerable to black hole attack by the malicious node. Black hole attack is a network layer attack in MANET that tries to hamper the routing process. During route discovery phase it sends false reply to the nodes and dropped data packets. In this paper, first we have implemented black hole attack in AODV and then analyzed the impact of black hole attack under deferent metrics like throughput, packet delivery ratio and packet loss. Simulator NS-2.35 is used for implementation and result analysis.

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.

Multi-Route AODV Protocol in Association with Overhearing Concept for Routes Selection Based on Unified Norm Composed of the Steadiness, Traffic Load and Energy Coefficients for Nodes

Mobile Ad-hoc Network (MANET) considered as one of the major important neoteric directions of wireless networks that allows movable devices to communicate with each other’s at any time anywhere. The main distinctive feature of MANET is its operation does not depend on any type of centralized administration. Due to non-truancy of localized management, devices motion and MANET resources scarcity, routing design mechanisms becoming essential problem that faces MANET until yet. Therefore, this article focuses on performance enhancement for one of most notorious interactive routing schemes that is called Ad-hoc On Demand distance Vector (AODV). Where performance refinement for AODV has been achieved via modification of route creation and maintenance processes, conjunction with overhear concept and getting multiple routes for each source - destination pair, in such a way that reduce energy consumption of nodes, avoiding unnecessary control packets, getting a more stable paths among communication nodes and fulfillment of a balanced traffic load among nodes, leading to elongate life time of nodes. Hence, prolonging life time of network. The proposed algorithm is called, Steadiness, balanced Load and Energy efficient for Multiple paths of Overhear AODV (SLE-MOAODV), where route election depending on unified metric called efficiency factor of node (NEF), which composed of parameters of stabilization, traffic load and energy for node. Functioning appraisal and comparison among proposed algorithm (SLE-MOAODV) and original AODV was carried out utilizing network simulator NS2. Outcome of simulation proved that functioning of proposed scheme outdo the original AODV with regard to: ratio of successfully delivered packets, retard time, routing cost and spent energy of nodes.

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.

Performance Analysis of Routing Protocols for UAV Communication Networks

The design of routing protocol is an important and key problem in unmanned aerial vehicle (UAV) communication networks. In low altitude environment, UAV information transmission is a complex task. It is an important scientific challenge to design a routing protocol that can provide efficient and reliable node to node packet transmission. This paper develops a more realistic simulation environment based on OPNET 14.5, and performs performance tests and comparisons on four classic routing protocols: Ad Hoc on demand distance vector (AODV), dynamic source routing (DSR), optimized link state routing (OLSR), and geographic routing protocol (GRP). The performance parameters such as network delay, traffic received, data dropped and throughput are compared and analyzed. The experimental results indicate that different routing protocols can be adapted to different UAV communication network scenarios. Therefore, the quantitative results can provide pertinent reference for choosing the best routing protocol in different scenarios.

Assessing node mobility impact on routing performances in MANETs

Mobile ad hoc network (MANET) plays a major role in enabling data communication in infrastructures-less areas. Network performance relies on the capacity of mobile nodes to process data packet and deliver it to the right destination at lower cost. Since nodes are free to move toward random destination, data delivery from a source to a destination might be disturbed due to frequent topology changes. Hence, mobility in mobile ad hoc network represents the main issue that should be addressed carefully while designing routing protocols. The purpose of this paper is to study the impact of node mobility on the performance of well-known routing protocols such as destination-sequenced distance vector (DSDV), dynamic source routing (DSR) and ad-hoc on demand distance vector (AODV). We assessed the efficiency of each protocol under high mobility environment using various values of speed and pause. Performance assessment is based on the conventional metrics such as latency, throughput, packet delivery ratio (PDR) and routing overhead. Moreover, we introduced two new metrics called path change factor (PCF) and route repair influence (RRI) for accuracy purpose. The study demonstrates that AODV has better performances in high mobility environment.

Assessing node mobility impact on routing performances in MANETs

Mobile ad hoc network (MANET) plays a major role in enabling data communication in infrastructures-less areas. Network performance relies on the capacity of mobile nodes to process data packet and deliver it to the right destination at lower cost. Since nodes are free to move toward random destination, data delivery from a source to a destination might be disturbed due to frequent topology changes. Hence, mobility in mobile ad hoc network represents the main issue that should be addressed carefully while designing routing protocols. The purpose of this paper is to study the impact of node mobility on the performance of well-known routing protocols such as destination-sequenced distance vector (DSDV), dynamic source routing (DSR) and ad-hoc on demand distance vector (AODV). We assessed the efficiency of each protocol under high mobility environment using various values of speed and pause. Performance assessment is based on the conventional metrics such as latency, throughput, packet delivery ratio (PDR) and routing overhead. Moreover, we introduced two new metrics called path change factor (PCF) and route repair influence (RRI) for accuracy purpose. The study demonstrates that AODV has better performances in high mobility environment.

Detection and Prevention of Manet using Hybrid SVM with Ann

Mobile Ad hoc Networks (MANET) have been exceptionally vulnerable against attacks because of the dynamic and self-configurable nature of its system foundation. This kind of wireless network is appropriate for temporary communication linked due to its nature of less-foundation and there is no any control of centralized manner. Design a routing mechanism that are security aware with higher QoS parameter is very competetive and the major tasks involved in ad hoc types of network as per the limited power resources and their dynamic routing topology. This paper mainly focused on the design of a secure and trusts based on-demand routing mechanism using Ad-hoc on demand distance vector (AODV) protocol to compute trust-based produces path initialed from source up to destination that will fulfill minimum two end-to-end QoS parameters of network. So here, the generalized AODV routing protocol has been extended from traditional routing mechanism to analyze the performance of this model with combination of artificial intelligence concept. The proposed ad hoc based routing mechanism is used to found possible routes that are prevented through trust adjacent position of security validation protocols and enhanced link optimized route computes on the basis of Artificial Neural Network (ANN) as an artificial intelligence algorithm for well-organized communication in MANET. In addition, this research demonstrates the effectiveness of bio inspired Firefly Algorithm (FFA) as an optimization approach with the consideration of several performance QoS metrics of network. The results have been measured in terms of throughput and PDR with SVM and ANN approach. It has been observed that the throughput and PDR measured using ANN approach is better compared to SVM approach an average of 0.755 PDR value has been obtained using ANN approach.

Survey on Performance of Multipath Routing Protocol in Wireless Sensor Network

As we know Wireless Sensor Network is the perfect solution for quick capturing, processing and transmission of critical data. Sensor nodes are often deployed in generous environment but nodes suffer from low battery power. So, energy efficiency and network life are main concerns in WSN. Zig Bee have low cost, low power consumption and is beneficial in wireless sensor networks by selecting adequate communication protocol. Routing protocols like AODV (Ad- hoc on demand distance vector routing), ZTR (Zig Bee tree routing), and STR (Shortcut tree routing) and ESTR (Extended Shortcut tree routing) are compared on the idea of various performance metrics like end to finish delay, routing overload, throughput, packet delivery ratio (PDR). The mathematical analysis and performance evaluation shows that ESTR achieves better performance as compared to other routing protocols. The overall evaluation shows that ESTR achieves better performance as compared to other routing protocols. But there are some limitations of ESTR method. Performance of packet delivery ratio of STR is less as compared to AODV. Performance of end to end delay of STR is poor as compared to AODV. Extended STR is proposed to represent new ZigBee network routing protocol with improved performance of Packet Delivery ratio (PDR) and delay against STR and AODV. We are introducing here Efficient Extended Shortcut Tree Routing method (ESTR) for further improvement of delays of ESTR method.