Showing papers on "Ad hoc On-Demand Distance Vector Routing published in 2013"

Flexible, Portable, and Practicable Solution for Routing in VANETs: A Fuzzy Constraint Q-Learning Approach

Abstract: Vehicular ad hoc networks (VANETs) have been attracting interest for their potential uses in driving assistance, traffic monitoring, and entertainment systems. However, due to vehicle movement, limited wireless resources, and the lossy characteristics of a wireless channel, providing a reliable multihop communication in VANETs is particularly challenging. In this paper, we propose PFQ-AODV, which is a portable VANET routing protocol that learns the optimal route by employing a fuzzy constraint Q-learning algorithm based on ad hoc on-demand distance vector (AODV) routing. The protocol uses fuzzy logic to evaluate whether a wireless link is good or not by considering multiple metrics, which are, specifically, the available bandwidth, link quality, and relative vehicle movement. Based on an evaluation of each wireless link, the proposed protocol learns the best route using the route request (RREQ) messages and hello messages. The protocol can infer vehicle movement based on neighbor information when position information is unavailable. PFQ-AODV is also independent of lower layers. Therefore, PFQ-AODV provides a flexible, portable, and practicable solution for routing in VANETs. We show the effectiveness of the proposed protocol by using both computer simulations and real-world experiments.

Mobile Ad-Hoc Networks (MANET)

Abstract: MANET-Performance Optimization And Issues Akhilesh K. Sharma Mobile Ad-hoc networks are used in many places, especially for the military and flood affected areas are having major concern with the mobile adhoc networks, for establishing the connection with the affected areas. There are several issues are explained and discussed in this book to establish the connection in optimized way. Several routing protocols have been proposed for MANET which can be classified as proactive, reactive and hybrid routing protocols. All of these protocols use blind flooding mechanism for the purpose of broadcasting of route request and route reply messages. This Blind flooding leads to a severe broadcast redundancy causing contention and collision in the network. This book will highlight all the points related to these issues. Key Features : 1. Use of NS-2 Simulator for better understanding of the moving environment of moving Nodes. 2. GUI programming & Sample code to build and simulate the nodes protocols and to change the performance related variables. 3. Topics to cover different topological and network study. 4. Techniques like DSDV, CGSR, AODV etc. for demonstration with examples.

Investigation of routing reliability of vehicular ad hoc networks

Abstract: 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.

Performance comparison of the RPL and LOADng routing protocols in a Home Automation scenario

Abstract: RPL, the routing protocol proposed by IETF for IPv6/6LoWPAN Low Power and Lossy Networks has significant complexity. Another protocol called LOADng, a lightweight variant of AODV, emerges as an alternative solution. In this paper, we compare the performance of the two protocols in a Home Automation scenario with heterogenous traffic patterns including a mix of multipoint-to-point and point-to-multipoint routes in realistic dense non-uniform network topologies. We use Contiki OS and Cooja simulator to evaluate the behavior of the ContikiRPL implementation and a basic non-optimized implementation of LOADng. Unlike previous studies, our results show that RPL provides shorter delays, less control overhead, and requires less memory than LOADng. Nevertheless, enhancing LOADng with more efficient flooding and a better route storage algorithm may improve its performance.

A Novel Solution to Handle DDOS Attack in MANET

Abstract: Distributed Denial of Service (DDoS) attacks in the networks needs to be prevented or handled if it occurs, as early as possible and before reaching the victim. Dealing with DDoS attacks is difficult due to their properties such as dynamic attack rates, various kinds of targets, big scale of botnet, etc. Distributed Denial of Service (DDoS) attack is hard to deal with because it is difficult to distinguish legitimate traffic from malicious traffic, especially when the traffic is coming at a different rate from distributed sources. DDoS attack becomes more difficult to handle if it occurs in wireless network because of the properties of ad hoc network such as dynamic topologies, low battery life, multicast routing, frequency of updates or network overhead, scalability, mobile agent based routing, and power aware routing, etc. Therefore, it is better to prevent the distributed denial of service attack rather than allowing it to occur and then taking the necessary steps to handle it. This paper discusses various the attack mechanisms and problems due to DDoS attack, also how MANET can be affected by these attacks. In addition to this, a novel solution is proposed to handle DDoS attacks in mobile ad hoc networks (MANETs).

Forwarding methods in data dissemination and routing protocols for vehicular Ad Hoc networks

Abstract: Intermittent connectivity, abrupt changes in network topology and low reception rate are the most important properties that distinguish VANET (vehicular ad hoc networks) from other types of ad hoc networks. To optimize reliability and time criticality metrics in data communication protocols for VANET, novel ideas are needed. In this article, we present a tutorial on methods (at the network layer), encountered in recent literature, for small and large scale routing protocols, and geocasting (broadcasting, data dissemination, and warning delivery) protocols.

Detection of malicious attack in MANET a behavioral approach

Abstract: Topology of MANET is dynamic in nature due to this characteristic in this network build routing mechanism more convoluted and anxious and consequently nodes are more vulnerable to compromise and are predominantly susceptible to denial of service attack (DoS) assail launched by malicious nodes or intruders [6].Reactive routing for instance AODV is more trendy than table driven routing exploit flooding to find out route. Attackers used this conception to initiate DoS attack akin to flooding; black hole and gray hole are the branded attack in MANET. In this paper we have projected a novel automatic security mechanism using SVM to defense against malicious attack occurring in AODV. Proposed method uses machine learning to categorize nodes as malicious. This system is far further resilient to the context changes general in MANET's, such as those due to malicious nodes changing their misbehavior patterns over time or quick changes in environmental factors, for instance the movement speed and communication range. This paper introduced new proposed algorithm for detection of attacks in Ad-hoc networks based on SVM behavioral routing protocols to detect MANET attacks. In this technique we have used the PMOR, PDER, and PMISR as metrics to evaluate the QoS of a link and into prediction of attacks.

Original Article: Dynamic congestion detection and control routing in ad hoc networks

Abstract: In mobile ad hoc networks (MANETs), congestion can occur in any intermediate node, often due to limitation in resources, when data packets are being transmitted from the source to the destination. Congestion will lead to high packet loss, long delay and waste of resource utilization time. The primary objective of congestion control is to best utilize the available network resources and keep the load below the capacity. The congestion control techniques to deal with TCP have been found inadequate to handle congestion in ad hoc networks, because ad hoc networks involve special challenges like high mobility of nodes and frequent changes of topology. This paper proposes a method for dynamic congestion detection and control routing (DCDR) in ad hoc networks based on the estimations of the average queue length at the node level. Using the average queue length, a node detects the present congestion level and sends a warning message to its neighbors. The neighbors then attempt to locate a congestion-free alternative path to the destination. This dynamic congestion estimate mechanism supporting congestion control in ad hoc networks ensures reliable communication within the MANET. According to our simulation results, the DCDR showed better performance than the EDOCR, EDCSCAODV, EDAODV and AODV routing protocols.

MR-AODV: A Solution to Mitigate Blackhole and Grayhole Attacks in AODV Based MANETs

Abstract: Role of ad-hoc networks has become vital in ubiquitous computing. Ad-hoc On-demand Distance Vector (AODV) is such a routing protocol which is susceptible to a variety of security threats against ad-hoc networks. Black hole and Gray hole attacks are such attacks that drop significant number of packets by performing packet forwarding misbehavior and breach the security to cause denial of service in Mobile Ad-hoc Networks (MANETs). In this paper, we discuss our previous work, R-AODV, to detect and isolate multiple Black hole and Gray hole nodes during route discovery process and propose a modified version to improve the performance of MANET. We analyze the proposed solution and evaluate its performance using Network Simulator-2 (NS-2) under different network parameters.

Secure Route Discovery for preventing black hole attacks on AODV-based MANETs

Abstract: Mobile Ad-hoc Networks (MANETs) allow mobile hosts to initiate communications with each other over a network without an established infrastructure or a central network authority. Because of this, MANETs have dynamic topologies because nodes can easily join or leave the network at any time. From a security design perspective, MANETs are vulnerable to various types of malicious attacks. As are result, Ad-hoc On-demand Distance Vector (AODV), which is one of the standard MANET protocols, can be attacked by malicious nodes. A black hole attack is one type of malicious attack that can be easily employed against data routing in MANETs. A black hole node replies to route requests rapidly with the shortest path and the highest destination sequence number. The black hole node does not have an active route to a specified destination associated with it and it drops all of the data packets that it receives. This paper proposes a mechanism that provides Secure Route Discovery for the AODV protocol (SRD-AODV) in order to prevent black hole attacks. This mechanism requires the source node and the destination node to verify the sequence numbers in the Route Request (RREQ) and Route Reply (RREP) messages, respectively, based on defined thresholds before establishing a connection with a destination node for sending the data. The simulation results using the Network Simulator 2 (NS2) demonstrate an improvement in the ratio of packet delivery for three different environments using our mechanism as compared to the standard AODV protocol.

On-demand routing protocols for cognitive radio ad hoc networks

Abstract: Cognitive radio ad hoc networks (CRAHNs) are a class of cognitive radio networks. In recent years, they have gained popularity, and routing protocols have been proposed. Above all, the protocols based on on-demand routing are considered favorable in the literature. It is mainly because the accomplishments of ad hoc on-demand distance vector (AODV) routing and dynamic source routing (DSR) in mobile ad hoc networks have lead to a number of adaptations of both protocols to suit CRAHNs. In this paper, we review the on-demand routing protocols applicable for CRAHNs, which are based on AODV, DSR, and hybrid protocols. After explaining their basic principles, we qualitatively compare the protocols in terms of inherent characteristics and performance. This paper further addresses the pros and cons of routing protocols and discusses research challenges and open issues.

Effect of Black Hole Attack on MANET Routing Protocols

Abstract: Due to the massive existing vulnerabilities in mobile ad-hoc networks, they may be insecure against attacks by the malicious nodes. In this paper we have analyzed the effects of Black hole attack on mobile ad hoc routing protocols. Mainly two protocols AODV and Improved AODV have been considered. Simulation has been performed on the basis of performance parameters and effect has been analyzed after adding Black-hole nodes in the network. Finally the results have been computed and compared to stumble on which protocol is least affected by these attacks.

QoS Evaluation of VANET Routing Protocols

Abstract: Traffic jams and traffic accidents have become a major concern in current society. VANET (vehicle ad hoc network) is an emerging attractive application to solve such problems. Quality of service (QoS) in VANET becomes a hot topic own to its increasing challenge about unique features, such as limited transporting distance, high mobility, and poor link quality. The main goal of this paper is to analyze the main quality criteria among popular routing protocols with an integrated VANET test bed. Typical topology-based routing protocols are reviewed. To study QoS performance of different protocols, evaluating models of frame loss ratio, PSNR and connectivity probability are illustrated. Three typical routing protocols: DSDV, AODV and GPSR are chosed to testify the QoS according to the statistics result of video transmission over VANET testbed. QoS performance is analyzed under several conditions of different distance of routing data transmission and vehicles’ arriving rate. Test results show that Pro-active protocol is not suitable for high mobility VANET, and Position-based hybrid protocol is more suitable for video transmission over VANET than Re-active protocol. Comparing with other research, the result shows that our model is better and more efficient for the evaluation platform.

An Improvement over AODV Routing Protocol by Limiting Visited Hop Count

Abstract: The AODV protocol is based on the minimum delay path as its route selection criteria, regardless of the paths load. This issue leads to unbalanced load dissemination in the network and the energy of the nodes on the shortest path deplete earlier than others. We proposed an improved AODV protocol with limited TTL (Time to Live) of RREP packet in which the route reply (RREP) packet of AODV is modified to limite TTL information of nodes. Experiments have been carried out using network simulator software (NS2). Simulation results show that our proposed routing protocol outperforms regular AODV in terms of packet delivery rate, good put, throughput, and jitter.

Sequence numbers do not guarantee loop freedom: AODV can yield routing loops

Abstract: In the area of mobile ad-hoc networks and wireless mesh networks, sequence numbers are often used in routing protocols to avoid routing loops. It is commonly stated in protocol specifications that sequence numbers are sufficient to guarantee loop freedom if they are monotonically increased over time. A classical example for the use of sequence numbers is the popular Ad hoc On-Demand Distance Vector (AODV) routing protocol. The loop freedom of AODV is not only a common belief, it has been claimed in the abstract of its RFC and at least two proofs have been proposed. AODV-based protocols such as AODVv2 (DYMO) and HWMP also claim loop freedom due to the same use of sequence numbers. In this paper we show that AODV is not a priori loop free; by this we counter the proposed proofs in the literature. In fact, loop freedom hinges on non-evident assumptions to be made when resolving ambiguities occurring in the RFC. Thus, monotonically increasing sequence numbers, by themselves, do not guarantee loop freedom.

A novel approach for detecting and eliminating cooperative black hole attack using advanced DRI table in Ad hoc Network

Abstract: Ad hoc Network is a self organized autonomous network that consists of mobile nodes which communicate with each other over wireless links .Wireless ad hoc networks are not well protected against the attack of malicious nodes due to security vulnerabilities in the routing protocols. One of the common attacks in MANETs is the Black hole Attack, in which malicious node falsely claiming it to have the fresh and shortest path to the destination and then drops all the receiving packets. If this malicious node work together as a group then the damage will be very serious. This type of attack is known as Cooperative Black Hole attack. We proposed a mechanism to mitigate single black hole attack as well as cooperative black hole attack to discover a safe route to the destination by avoiding attacks. In this paper we proposed an approach for better analysis and improve security of AODV, which is one of the popular routing protocols for MANET. Our scheme is based on AODV protocol which is improved by deploying Advanced DRI table with additional check bit. The Simulation on NS2 is carried out and the proposed scheme has produced results that demonstrate the effectiveness of the mechanism in detection and elimination of the attack and maximizing network performance by reducing the packet dropping ratio in network.

A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV

Abstract: We propose AWN (Algebra for Wireless Networks), a process algebra tailored to the modelling of Mobile Ad hoc Network (MANET) and Wireless Mesh Network (WMN) protocols. It combines novel treatments of local broadcast, conditional unicast and data structures. In this framework we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group. We give a complete and unambiguous specification of this protocol, thereby formalising the RFC of AODV, the de facto standard specification, given in English prose. In doing so, we had to make non-evident assumptions to resolve ambiguities occurring in that specification. Our formalisation models the exact details of the core functionality of AODV, such as route maintenance and error handling, and only omits timing aspects. The process algebra allows us to formalise and (dis)prove crucial properties of mesh network routing protocols such as loop freedom and packet delivery. We are the first to provide a detailed proof of loop freedom of AODV. In contrast to evaluations using simulation or model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, etc. Due to ambiguities and contradictions the RFC specification allows several interpretations; we show for more than 5000 of them whether they are loop free or not, thereby demonstrating how the reasoning and proofs can relatively easily be adapted to protocol variants. Using our formal and unambiguous specification, we find shortcomings of AODV that affect performance, e.g. the establishment of non-optimal routes, and some routes not being found at all. We formalise improvements in the same process algebra; carrying over the proofs is again easy.

A survey of routing protocols for VANET in urban scenarios

Abstract: Vehicular Ad hoc Network (VANET) is a subset of Mobile Ad hoc Networks (MANET), which forms wireless networks between vehicles. For better communication among these vehicles, an efficient routing protocol withstanding the dynamic topology of the vehicles plays a vital role. Routing in urban scenarios is highly challenging owing to irregularity in the distribution of vehicle nodes, their mobility pattern and obstacles in the propagation path. This paper focuses on the survey of various routing protocols proposed for VANETs in city environments.

Routing Metrics for Minimizing End-to-End Delay in Multiradio Multichannel Wireless Networks

Abstract: This paper studies how to select a path with the minimum expected end-to-end delay (EED) in a multiradio multichannel (MR-MC) wireless mesh network. While the existing studies mainly focus on the packet transmission delay due to medium access control (MAC), our new EED metric further takes into account the queuing delay at the MAC layer. In particular, in the MR-MC context, we develop a generic iterative approach to compute the multiradio achievable bandwidth (MRAB) for a path, taking the impact of inter-/intraflow interference and space/channel diversity into consideration. The MRAB is then combined with the EED to form the metric weighted end-to-end delay (WEED). As a byproduct of MRAB, a channel diversity coefficient is defined to quantitatively represent the channel diversity for a given path. Moreover, we design and implement a distributed WEED-based routing protocol for MR-MC wireless networks by extending the well-known AODV protocol. Extensive simulation results are presented to demonstrate the performance of EED/WEED-based routing, with comparison to some existing well-known routing metrics.

Load Balanced Routing Protocols for Ad Hoc Mobile Wireless Networks

Abstract: the collections of mobile nodes which can form randomly and dynamically for temporary basis network without need preexisting network infrastructure or any centralized controlled administration that nodes can be arbitrarily located and can move freely called Mobile ad hoc network. Because of some limitation at wireless link capacities can be excessive loads on the nodes. There are two major aspects for this -traffic and power consumption. So, unbalanced traffic may cause of more delay, packet dropping, and reducing packet delivery ratio. The work is the idea on view of balancing nodes on traffic in different routing protocol DSR, DSDV and AODV in a mobile ad hoc network. This analysis of this result obtained from a NS2 particular scenario.

Performance Analysis in Reactive Routing Protocols in Wireless Mobile Ad Hoc Networks Using DSR, AODV and AOMDV

Abstract: Selecting an appropriate routing protocol for steering data packets is a very important issue to evaluate the performance of wireless mobile ad hoc networks (MANETs). This selection can be difficult in different situations since in such networks there is no specific infrastructure and standard specifications for network development. In this paper we introduce several reactive routing protocols in the MANET and check some performance metrics such as throughput, end to end delay and packet delivery ratio in order to find the best routing protocol based on the enforced conditions in our network. It is observed that in a network with increased number of nodes to maximum 20 nodes, packet delivery ratio and throughput in DSR and AOMDV routing protocols are better than AODV while in checking end to end delay, AOMDV shows less delay than DSR and AODV.

Performance Analysis of AODV, AOMDV, DSR, DSDV Routing Protocols in Vehicular Ad Hoc Network

Abstract: Vehicular Ad Hoc Network (VANET) is appeared to be a new technology to integrate the susceptibility of vastly employed wireless networks to vehicles. The idea is to attain the ubiquitous connectivity for vehicles either through efficient vehicle-to-vehicle or vehicle-to-infrastructure communication that enables the Intelligent Transportation Systems (ITS). In order to design a suitable and efficient routing protocol in VANET, a comprehensive study on popular existing VANET routing protocols must be considered as a tangible need. In this paper, AODV, AOMDV, DSR, DSDV are exploited to be compared in terms of routing performance based on vehicle velocity and vehicle density.

Extensive Simulation Performance Analysis for DSDV, DSR and AODV MANET Routing Protocols

Abstract: Mobile Ad-hoc Network (MANET) is a compilation of independent wireless mobile nodes which animatedly forms a temporary network without use of any fixed infrastructure or centralized management. A major anxiety that affects such a network that characterized by dynamically changing topology is the performance, where routing with robustness performance is one of the key challenges in deploying MANET. In this work we concentrate on routing protocols which are widely used in MANET, Destination Sequenced Distance vector (DSDV), Dynamic Source Routing(DSR) and Ad hoc On demand Distance Vector(AODV) routing protocols that are widely simulated in this paper using different scenarios in terms of different Traffic types, constant bit rate(CBR), variable bit rate(VBR) then combining both classes in one scenario to scrutinize the impact of this combination. Routing protocols are analyzed against several performance metrics, Average energy consumption, Average throughput, Normalized routing load (NRL), packet delivery fraction(PDF) and total dropped packets(TDP). Combined traffic results pronounce that DSR and AODV exhibit better behaviors overall the performance metrics examined.

Simulation-Based Performance Evaluation of Routing Protocols in Vehicular Ad-hoc Network

Abstract: A Vehicular Ad-hoc Network (VANET) is a collection of wireless vehicle nodes forming a temporary network without using any centralized Road Side Unit (RSU) VANET protocols have to face high challenges due to dynamically changing topologies and symmetric links of networks A suitable and effective routing mechanism helps to extend the successful deployment of vehicular ad-hoc networks An attempt has been made to compare the performance of two On-demand reactive routing protocols namely AODV and DSR which works on gateway discovery algorithms and a geographical routing protocol namely GPSR which works on an algorithm constantly geographical based updates network topology information available to all nodes in VANETs for different scenarios Comparison is made on the basis of different metrics like throughput, packet loss, packet delivery ratio and end-to-end delay using SUMO and NS2 simulator In this paper we have taken different types of scenarios for simulation and then analysed the performance results

Gossiping-Based AODV for Wireless Sensor Networks

Abstract: Wireless sensor networks have been widely used in many different applications and in the future they will play an increasingly important role. Since these networks have no fixed infrastructure and are usually distributed over large areas, the use of routing protocols is indispensable. However, when the number of nodes within an area increases, the communication interferences and collisions increase significantly, thus reducing the network performance. In this paper, we first introduce a new measurable quantity, the "node concentration", in contrast to the standard network density. Then, the performance of the AODV (Ad-hoc On-demand Distance Vector) routing protocol is evaluated with respect to the variation in node concentration. Finally, we propose an enhancement of AODV, called CG-AODV, by introducing a "node concentration-driven gossiping" approach for limiting the flooding of control packets. The simulation results demonstrate that CG-AODV provides significant improvements in terms of packet delivery ratio and path discovery delay.

Design and evaluation of GBSR-B, an improvement of GPSR for VANETs

Abstract: Wireless vehicular communications are a key technology to provide drivers with novel services such as collision avoidance, safety warnings and real-time traffic information. Other services are high-speed toll collection, infotainment and wireless ubiquitous connectivity. It is clear that vehicular communications will be a cornerstone of the future transport systems which will significantly change our daily lives. Vehicular ad hoc networks (VANETs) have rapidly emerged and raised novel research challenges such as the design of network protocols adapted to the specific features of VANETs, e.g. the high speed of vehicles. Also, the design of realistic simulation frameworks is an important goal to speed up the development of VANETs. This paper presents the design and evaluation of GBSR-B, a routing protocol based on GPSR that seeks to improve the performance of VANETs over urban scenarios. Our proposal includes a novel algorithm to select the optimal next-hop forwarding node. This paper also presents an alternative to the perimeter mode used in GPSR. We compare our proposal GBSR-B to GPSR and AODV using the network simulator NCTUns 6.0, showing better results in terms of packet losses.