Ad Hoc On-demand Distance Vector Routing Protocol Research Articles

Predictability of Aggregated Traffic of Gateways in Wireless Mesh Network with AODV and DSDV Routing Protocols and RWP Mobility Model

When evaluating the performance of routing protocols in wireless mesh network (WMN), we need deeper analysis from the aspect of network traffic complexity to show how traffic characteristics are influenced by routing protocols and node mobility. The predictability of network traffic can be used as one metric of complexity and can be analyzed by multi-scale entropy (MSE) method. With 20 different random waypoint (RWP) mobility scenarios and with destination sequenced distance vector (DSDV), a typical proactive protocol, and Ad hoc on-demand distance vector (AODV), a typical reactive protocol, the predictabilities of aggregated traffic of gateway in WMN are analyzed using MSE method to show how different routing protocols bear different mobility scenarios. The MSE results show that the aggregated traffic of gateway with DSDV is more difficult to be predicted than that with AODV for different mobility scenarios. The maxspeed parameter of RWP dominates the traffic predictability for AODV. Both of the pause time and the maxspeed parameters, have great influence on the traffic predictability for DSDV. The reasons lie in the behaviors of routing protocols, i.e., AODV has up-to-date paths while DSDV does not.

COMPARATIVE REVIEW STUDY OF SECURITY OF ARAN AND AODV ROUTING PROTOCOLS IN MANETS

Mobile Ad-hoc networks are proposed because there are some areas where it is not possible to set up a network having fixed infrastructure, like in areas of emergency services, military operations, personal area networks, etc. Ad hoc network allows communication between wireless nodes with the help of their transmission ranges and routing protocols facilitate this communication among the nodes. But on these routing protocols variety of attacks are possible like- Eavesdropping, IP-spoofing, Blackhole, Denial of service attack, etc. By attacking the routing protocol attackers can access network traffic, can drop it or can modify it. To prevent these attacks many secure routing protocols like- SEAD, ARAN, SAODV, SRP, etc have been developed. In this paper security aspects of ARAN (Authenticated Routing for Adhoc Network routing protocol) has been analyzed with respect to a commonly used routing protocol AODV (Adhoc On-Demand Distance Vector) i.e. how much these two protocols are resistant to Blackhole and IP-Spoofing attack under GloMoSim-2.03 simulator.

Efficient Security Authentication Protocol in Wireless Sensor Networks

Wireless sensor networks consist of a network of autonomous sensors that can reconfigure themselves so as to sense the environment in the most significant manner. However, a significant challenge in the practical application of these networks exists in credible authentication and network security. This paper proposes a secure authentication protocol which is considered as a pro-active method, where a user is strongly verified before accessing the data, it is the modified Adhoc On-Demand Distance vector (AODV) Routing protocol that provides many security principles to the user such as checking sequence number, IP address and threshold values. The performance of proposed algorithm is compared with the existing alogorithm based on the following parameters such as Throughput, End to End delay and packet delivery ratio. The results shows that the proposed protocol possesses many advantages against the popular black hole attack. This work has been carried out using NS2 software and the result obtained testifies the effectiveness of the proposed protocol. Keyword: Authentication protocol, AES security, AODV routing protocol, Black hole attack, Wireless sensor network (WSN).

Energy-Efficiency based Analysis of Routing Protocols in Mobile Ad-Hoc Networks (MANETs)

mobile MANET (Mobile Ad-hoc Network) is an actively self organizing and self configuring network without the need of any centralized base station. This is a collection of various mobile nodes that is connected through a wireless medium forming rapidly changing topologies in the network. The MANETs are infrastructure less in nature and can be set up anytime, anywhere. In the MANETs, all the nodes are mobile and are battery operated. As because all the nodes in MANETs have limited battery resources and due to node mobility, multi hop routes are used over a changing network environment, so to limit the power consumption, to prolong the network lifetime and to improve the robustness of the system, energy efficient routing protocols are required. The design of efficient routing protocols is a fundamental problem in Mobile Ad-Hoc Network (MANET). Many routing protocols have been proposed in the literature, each one is based on different characteristics and properties in MANETs. Some of these respective protocols have been studied and their performances have been analyzed focusing on aspects like energy consumption, packet delivery fraction, network lifetime etc. In this paper, a performance comparison of the DSR (Dynamic Source Routing), AODV (Ad-Hoc on Demand Distance Vector) and DSDV (Destination Sequenced Distance Vector) routing protocols is evaluated on the basis of energy efficiency metrics by varying number of nodes, number of connections and pause time. Simulations are done using NS-2(version NS- 2.35). It has been verified through extensive simulations, which mostly represents a wide spectrum of network conditions that DSR delivers the better performance and needs smaller energy expenditure as that of algorithms AODV and DSDV but it is observed that DSDV prolongs the network lifetime better than the other two protocols and provides better load balancing capability.

Performance Comparison of Mobile Ad Hoc Network Routing Protocols

Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find optimized routes from source to the destination and prominent among them are Dynamic Source Routing (DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV) routing protocols. The performance comparison of these protocols should be considered as the primary step towards the invention of a new routing protocol. This paper presents a performance comparison of proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility speed, number of nodes and data rate. The comparison results show that AODV performs optimally well not the best among all the studied protocols.

A trust-based AODV routing protocol for improved QoS in mobile ad-hoc networks

In mobile ad hoc networks (MANETs), nodes (mobile devices) are located in a self organised way without any infrastructure forming a temporary network. Each node in a MANET moves independently in any direction, thus the network’s topology change rapidly in an unpredictable manner. Wireless nodes try to communicate to the destination using the intermediate nodes. In such situation, MANET is vulnerable to both internal and external attacks caused by malicious nodes present in the network. In this paper we implement an approach based upon trust to provide security to ad hoc on-demand distance vector (AODV) protocol, which helps AODV to detect the compromised nodes. This proposed approach is able to detect the compromised nodes and isolates it from the network. The reliability of the trusted AODV routing protocol is evaluated by implementing black hole attack and the performance is calculated in terms of metrics like packet delivery ratio, throughput and average packet drop. The proposed model increases the packet delivery ratio, throughput and results in reduced packet drop. The evaluation of trusted AODV with black hole attack has been done with the help of QualNet 5.0 simulator.

Feasibility study of DSDV and AODV routing protocols in mobile sensor networks

In recent years, mobile sensor networks (MSNs) have become a hot area of research, in which sensor nodes are mobile. The proper selection of a routing protocol in a MSN is very important because network performance is significantly influenced by the routing protocol. In this paper, the feasibility of the two routing protocols in MSNs is studied and discussed with respect to network performance. The two protocols are destination sequence distance vector (DSDV) and ad hoc on demand distance vector (AODV) routing protocols and they are popularly used in mobile ad hoc networks. Our simulation study shows that the two routing protocols can be effectively used in MSNs and AODV is more reliable with affordable burden compared to DSDV.

Path Reecovery in 6LoWPAN Routing Protocol

6LoWPAN has become a new technology to provide the Internet connectivity to the traditional wireless sensor network (WSN). In order to route the delivered packet from originator to destination nodes, the simplified Ad-hoc On- Demand Distance Vector (AODV) routing protocol for 6LoWPAN with 6LoWPAN Ad-Hoc On-Demand Distance Vector Routing (LOAD) has been introduced. However, the conceptual LOAD routing protocol has yet proposed any path recovery mechanism in 6LoWPAN. In this paper, an originator recognition (OR) path recovery mechanism is proposed for the 6LoWPAN LOAD-based routing protocol. In this proposed mechanism, the participated nodes will memorize the originator address attached within data packet during the data transmission. When a link break happens on destination path, the LOAD protocol message will be amended by inserting an identity key, which is a memorial of originator address, in the generated route error (RERR) message before transmitted towards the originator for the failure notification. This identity key is then used by the originator to initialize path recovery in order to retransmit the failed data packet to the unreachable destination node. Instead of using MAC address in the LOAD routing protocol, IP address is used in the proposed Originator Recognition (OR) path recovery mechanism (OR-LOAD) routing protocol which is designed for the global routing. The proposed OR-LOAD routing protocol has been examined under noisy 6LoWPAN environment in Qualnet simulator. Its performance is then evaluated and compared to AODV routing protocol in terms of packet delivery ratio and average energy consumption. The simulation results show that the proposed OR-LOAD outperforms AODV with packet delivery ratio of 19.4%, and with comparable average energy consumption in both routing protocols.

An Innovative Approach to Detect the Gray-Hole Attack in AODV based MANET

The wireless arena has been experiencing exponential growth in nowadays. Wireless devices are now playing an everincreasingly important role in our lives. an ad hoc network might consist of several home-computing devices, including notebooks, handheld PCs, and so on. Each node will be able to communicate directly with other nodes that reside within range of transmission. For communicating with nodes that reside besides this range, the node needs to use intermediate nodes to relay messages hop by hop. Gray hole is a node that can switch from behaving correctly to behaving like a black hole that is it is actually an attacker and it will act as a normal node. So we can’t identify easily the attacker since it behaves as a normal node. Every node maintains a routing table that stores the next hop node information which is a route packet to destination node In this paper we proposed an innovative approach for the detection of the dangerous grayhole attack. The proposed algorithm is implemented on a very popular on demand routing protocol known as AODV (Ad hoc On demand Distance Vector) routing protocol. The beauty of this proposed algorithm is that it not only identifies the grayhole attacker node but also confirm it as well. The algorithm is divided into two phases: Noting Phase and the Confirmation phase. To simulate the effect of the proposed work the popular NS 2(Network Simulator 2) is used. General Terms Mobile Adhoc Networks, Routing protocols, Active attacks, Passive attacks, Reactive Routing protocol, Algorithm.

Enhancing Quality of Service in ERS- AODV for Mobile Ad Hoc Networks

A MANET is a wireless network which operates by themselves without centralized administration. Each node in MANET operates as an end system and a router for all other nodes in the network. The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route the traffic. Reactive routing protocols are favoured in MANET’s because they generate fewer overheads in network. These protocols suffer due to network flooding in route discovery process. Expanding ring search in terms of early detection of destination cause quality of service to fluctuate randomly. Performance degradation due to quality of service is a bottleneck to fulfill stability and reliability in MANET’s. In this paper, a scheme is introduced for controlling the broadcasting of RREQ information focusing on improved quality of service in AODV (Ad hoc on Demand Distance Vector) routing protocol. This is achieved by monitoring the TTL start, TTL increment and TTL threshold values of network and choosing optimum values of TTL suitable to network designed that accounts for reliability and quality of service during route discovery process. It is simulated using OPNET 14.5 with fixed node density.

Investigation of routing reliability of vehicular ad hoc networks

In intelligent transportation systems, the cooperation between vehicles and the road side units is essential to bring these systems to fruition. Vehicular ad hoc networks (VANETs) are a promising technology to enable the communications among vehicles on one hand and between vehicles and road side units on the other hand. However, it is a challenging task to develop a reliable routing algorithm for VANETs due to the high mobility and the frequent changes of the network topology. Communication links are highly vulnerable to disconnection in VANETs; hence, the routing reliability of these ever-changing networks needs to be paid special attention. In this paper, we propose a new vehicular reliability model to facilitate the reliable routing in VANETs. The link reliability is defined as the probability that a direct communication link between two vehicles will stay continuously available over a specified time period. Furthermore, the link reliability value is accurately calculated using the location, direction and velocity information of vehicles along the road. We extend the well-known ad hoc on-demand distance vector (AODV) routing protocol to propose our reliable routing protocol AODV-R. Simulation results demonstrate that AODV-R outperforms significantly the AODV routing protocol in terms of better delivery ratio and less link failures while maintaining a reasonable routing control overhead.

Energy Consumption and Control Response Evaluations of AODV Routing in WSANs for Building-Temperature Control

The main objective of this paper is to investigate the effects of routing protocols on wireless sensor and actuator networks (WSANs), focusing on the control system response and the energy consumption of nodes in a network. We demonstrate that routing algorithms designed without considering the relationship between communication and control cannot be appropriately used in wireless networked control applications. For this purpose, an ad-hoc on-demand distance vector (AODV) routing, an IEEE 802.15.4, and a building-temperature control system are employed for this exploration. The findings from our scenarios show that the AODV routing can select a path with a high traffic load for data transmission. It takes a long time before deciding to change a new route although it experiences the unsuccessful transmission of packets. As a result, the desirable control target cannot be achieved in time, and nodes consume more energy due to frequent packet collisions and retransmissions. Consequently, we propose a simple routing solution to alleviate these research problems by modifying the original AODV routing protocol. The delay-threshold is considered to avoid any congested connection during routing procedures. The simulation results demonstrate that our solution can be appropriately applied in WSANs. Both the energy consumption and the control system response are improved.

Enhancing the Efficiency of MANETs by Improving the On-demand Routing Protocols and QoSmetrics

A Mobile Ad Hoc Network represents a system of wireless mobile nodes that can freely and dynamically selforganize into arbitrary and temporary network topologies, allowing people and devices to seamlessly communicate without any pre-existing communication architecture. The growth of real time multimedia application in such environments, has drawn a lot of attention to wireless networks that support quality of service (QoS). In this work, the QoS metrics, delay and link life time (LLT) of the path are dynamically calculated. Based on these values the routing decisions are made. Here the multipath routing protocol is taken as the base protocol. The proposed algorithm finds the multiple QoS routes only, based on the QoS metrics and stores only those paths in the routing table. The route is selected based on the integrated QoS metric and is used to transmit the data. The base protocol used is multipath AODV(Ad Hoc On demand Distance Vector ) routing protocol. The proposed protocol may take extra time during route discovery process to compute the additional QoS parameters, but this time is compensated by having only QoS paths for data transmission. A few patents on the QoS Routing for MANETS have been reviewed.The simulator NS-2.34 is used to simulate and compare the performance of the protocols in terms of the QoS metrics such as end-to-end delay, PDR in the MANET. Keywords: Mobile Ad Hoc Network (MANET), Quality of Service (QoS), Destination Sequence Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad Hoc On demand Distance Vector (AODV), LLT (Link Life Time), RLT (Route Life Time), PLTR (Percentage Life Time Ratio), TCP (Transmission Control Protocol), CBR (Constant Bit Rate), PDR (Packet Delivery Ratio).

Comparative Analysis of Original AODV and AODV-DOR Routing Protocols in Mobile Ad-hoc Networks

An ad hoc network is a group of movable wireless nodes that wants to share or exchange the information without any fixed infrastructure or centralized control. Ad hoc network is a selfconfiguring network of movable devices which may be connected by a wireless links. The union of these mobile devices forms an arbitrary topology. Due to very high dynamic environment nature of MANET, routing is a very crucial task for measuring the performance. A number of protocols have been familiarized to be rectified the routing mechanism which can find the path between any source host to destination host within the network. This paper focuses on the most popular and widely used Ad hoc On-demand Distance Vector (AODV) reactive MANETs routing protocol with two different flag settings. This paper provides the performance (Average End to End Delay and Packet Delivery Ratio) comparisons of original AODV and AODV-DOR (AODV with destination only reply) in different network conditions. For our simulation we used discrete event simulator known as Network Simulator version 2.35

Performance Analysis of Energy Aware AODV Routing Protocol for IEEE 802. 15. 4 Enabled WSN

In the present scenario, wireless network is being widely used in the area where infrastructure based telecommunication system are unavailable. The mobile adhoc network is the infrastructure-less mobile network which has no fixed infrastructure and the nodes can be connected dynamically in an arbitrary manner. The sensor networks are incarnated from ad-hoc networks in which nodes have sensing capability. There are several communication protocols available for wireless sensor networks such as Ad hoc On demand Distance Vector (AODV), Dynamic Source Routing (DSR), Dynamic Destination Sequenced Distance Vector (DSDV). AODV is an on demand dynamic routing protocol that uses sequence number to determine the timeliness of each packet and to prevent loops. The main advantage of this protocol is to establish routes on demand and destination sequence numbers are available for finding the latest route to the destination. However, nodes in sensor networks are usually powered by batteries, which provide a limited amount of energy since sensor nodes have limited battery power. Hence it is required to develop energy efficient routing protocols to optimize the performance of the network. In this paper, Energy Aware AODV (EAODV) routing protocol for IEEE 802.15.4 enabled WSN is developed to improve the performance of the network. The energy aware AODV protocol for IEEE 802.15.4 enabled WSN is done by incorporating the residual energy in the RREQ message of the existing AODV protocol. Further, the performance metrics such as delivery ratio and delay are determined and analyzed for various simulation times and coverage area.

Comprehensive Evaluation of AODV, DSR, GRP, OLSR and TORA Routing Protocols with varying number of nodes and traffic applications over MANETs

Wireless Technology is at its peak when we talk about research and innovation. This field has become a hub of invention of new theories and structures. Mobile Ad-hoc Network is a special point of focus for the researchers. MANET is a collection of wireless mobile nodes which forms a dynamic temporary network without using any existing infrastructure. In recent time the market of mobile devices, laptops, hand held and portable devices is at its zenith so communication between such devices is an important issue. Routing is an essential part in the success of communication among these mobile structures. Routing protocols play an important role for finding an efficient and reliable route from source to destination. In the literature, there are numerous MANET routing protocols aiming to find the most suitable path from source to destination. In this paper, a comprehensive simulation based performance study and analysis is performed on various types of routing protocols over MANET. Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Temporally-Ordered Routing Algorithm (TORA), Optimized Link State Routing (OLSR) and Geographic Routing Protocol (GRP) has been considered for investigation in this paper based on OPNET simulation. Moreover the performance of these routing protocols will be measured on the basis of throughput, delay, load and data dropped metrics.

Review on security issues of AODV routing protocol for MANETs

Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure, Instead, hosts rely on each other to keep the network connected. One main challenge in the design of these networks is their vulnerability to security attacks. In this Survey, we study the threats an ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. Routing protocols, which act as the binding force in these networks, are a common target of these nodes. Ad-hoc On Demand Distance Vector (AODV) is one of the widely used routing protocols that is currently undergoing extensive research and development. AODV is based on distance vector routing, but the updates are shared not on a periodic basis but on an as per requirement basis. The control packets contain a hop count and sequence number field that identifies the freshness of routing updates. As these fields are mutable, it creates a potential vulnerability that is frequently exploited by malicious nodes to advertise better routes. Similarly, transmission of routing updates in clear text also discloses vital information about the network topology, which is again a potential security hazard. This research addresses the problem of securing Mobile Ad Hoc Networks routing protocols. In this survey we examine different routing protocols and various types of routing security attacks. We also perform a survey in search for different routing security schemes that have been proposed to prevent and/or detect these attacks, and point out their advantages and drawbacks.

Routing Discovery Algorithm Using Parallel Chase Packet

On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been proposed to control the simple flooding technique. Ideally, the broadcast of route request or the route discovery process must be stopped as soon as the destination node is found. This will free the network from many redundant packets that may cause network collision and contention. In this paper, chasing packet technique is used with standard AODV routing protocol to end the fulfilled route requests. The chase packet is initiated by the source node and is broadcasted in parallel with route request packet. As soon as the destination is found the chase packet starts its work by trying to catch and discard the route request in early stages before it broadcasts further in the network. Performance evaluation is conducted using simulation to investigate the performance of the proposed scheme against the existing approach that uses chase packet technique such as Traffic Locality Route Discovery Algorithm with Chase (TLRDA-C). Results reveal that the proposed scheme minimizes end-to-end packet delays and achieves low routing request overhead.

A Multipath AODV in Wireless Networks

This paper proposes a multipath AODV routing protocol, where the routing information is obtained from the multiple paths which the routing messages go through. The AODV (Ad-hoc On-demand Distance Vector) routing algorithm is one of the most widely used routing protocols in wireless ad-hoc networks which are composed of mobile nodes. We improve the AODV routing algorithm by investigating the weakness of it and modifying the existing AODV. AODV, which obtains the routing information by the route discovery procedure, a node may not have all the routing information. So when it needs to send packets, it may have to initiate the route discovery procedure and delay the delivery of the packets. The proposed routing protocol increases the reliability in routing packets by using multiple paths from a source to a destination. It performs well in a small-size wireless ad-hoc network and reduces the number of control messages when a link is broken.

A Study on the Vulnerability of AODV Routing Protocol to Resource Consumption Attack

A Mobile Ad Hoc Network (MANET) is one of the up-to-date technologies supporting communication of mobile devices. It consists of an open environment that comprises a set of mobile, decentralized, and self-organized nodes. MANET is harder to be secured than the other types of static networks. There are many types of attacks that could paralyze the life of the mobile nodes in MANET. One of the most dangerous attacks is the Denial of Service attack (DoS), which in turn could be performed through the Resource Consumption Attack (RCA) over Ad-hoc On demand Distance Vector (AODV) routing protocol. This paper analyzes and studies the RCA effecting factors on AODV performance metrics namely throughput and end-to-end delay under varying the number of connections between the source and the destination and number of RCA attackers number.Keywords: MANET, Resource Consumption Attack, Denial of Service attack, AODV routing protocol.