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

CORMAN: A Novel Cooperative Opportunistic Routing Scheme in Mobile Ad Hoc Networks

Abstract: The link quality variation of wireless channels has been a challenging issue in data communications until recent explicit exploration in utilizing this characteristic. The same broadcast transmission may be perceived significantly differently, and usually independently, by receivers at different geographic locations. Furthermore, even the same stationary receiver may experience drastic link quality fluctuation over time. The combination of link-quality variation with the broadcasting nature of wireless channels has revealed a direction in the research of wireless networking, namely, cooperative communication. Research on cooperative communication started to attract interests in the community at the physical layer but more recently its importance and usability have also been realized at upper layers of the network protocol stack. In this article, we tackle the problem of opportunistic data transfer in mobile ad hoc networks. Our solution is called Cooperative Opportunistic Routing in Mobile Ad hoc Networks (CORMAN). It is a pure network layer scheme that can be built atop off-the-shelf wireless networking equipment. Nodes in the network use a lightweight proactive source routing protocol to determine a list of intermediate nodes that the data packets should follow en route to the destination. Here, when a data packet is broadcast by an upstream node and has happened to be received by a downstream node further along the route, it continues its way from there and thus will arrive at the destination node sooner. This is achieved through cooperative data communication at the link and network layers. This work is a powerful extension to the pioneering work of ExOR. We test CORMAN and compare it to AODV, and observe significant performance improvement in varying mobile settings.

Automatic routing using multiple prefix labels

Abstract: We present Multi-label Automatic Routing (MAR), the first compact routing protocol that attains a low path stretch (ratio of selected path length to the optimal path length) while maintaining a low routing state for mobile networks. MAR is resilient to node movements in the network. In MAR, nodes assign themselves labels based on their location in the network through a distributed algorithm. Distributed Hash Tables (DHTs) for the node to label mappings are established in some anchor nodes. Once the labels are established, the routing is automatic based on the positional labels of the nodes and DHT lookups. This eliminates flooding completely. Unlike traditional routing protocols MAR does not need destinations-based routing tables. Hence, MAR has a small routing state. With the use of multiple labels per node, the average path length is close to the shortest path and there are multiple paths between source and destination nodes. In Qualnet simulations MAR shows a path stretch close to or better than traditional table-driven and on-demand protocols like OLSR and AODV. Simulation results also show shorter end-to-end delays due to the automatic routing. The delivery ratio of MAR is comparable to these traditional protocols but with a significantly lower network overhead.

USOR: An Unobservable Secure On-Demand Routing Protocol for Mobile Ad Hoc Networks

Abstract: Privacy-preserving routing is crucial for some ad hoc networks that require stronger privacy protection. A number of schemes have been proposed to protect privacy in ad hoc networks. However, none of these schemes offer complete unlinkability or unobservability property since data packets and control packets are still linkable and distinguishable in these schemes. In this paper, we define stronger privacy requirements regarding privacy-preserving routing in mobile ad hoc networks. Then we propose an unobservable secure routing scheme USOR to offer complete unlinkability and content unobservability for all types of packets. USOR is efficient as it uses a novel combination of group signature and ID-based encryption for route discovery. Security analysis demonstrates that USOR can well protect user privacy against both inside and outside attackers. We implement USOR on ns2, and evaluate its performance by comparing with AODV and MASK. The simulation results show that USOR not only has satisfactory performance compared to AODV, but also achieves stronger privacy protection than existing schemes like MASK.

Beyond traditional DTN routing: social networks for opportunistic communication

Abstract: This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward socialbased routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance trade-offs from a multi-objective perspective is highlighted.

Energy Efficient Routing Protocols for Mobile Ad Hoc Networks

Abstract: In mobile ad hoc network nodes have limited battery power. If a node is used frequently for transmission or overhearing of data packets, more energy is consumed by that node and after certain amount of time the energy level may not be sufficient for data transmission resulting in connection failure. In this paper, we have considered three routing protocols-Dynamic Source Routing (DSR) & Minimum Maximum Battery cost Routing (MMBCR), Ad hoc OnDemand Distance Vector Routing Protocol (AODV) and studied their performances in terms of network lifetime for the same network scenario. Simulations are carried out using NS2. Finally from the simulation results we have concluded that MMBCR gives more network lifetime by selecting route with maximum battery capacity thereby outperforming DSR.

A process algebra for wireless mesh networks

Abstract: We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery.

Prevention of Black Hole Attack in MANET

Abstract: An ad hoc network is a collection of mobile nodes that dynamically form a temporary network. It operates without the use of existing infrastructure. One of the principal routing protocols used in ad hoc networks is AODV (ad hoc on demand distance vector) protocol. This is anticipated to offer a range of flexible services to mobile and nomadic users by means of integrated homogeneous architecture. Energy constrained node, low channel bandwidth, node mobility, high channel error rates, channel variability and packet loss are some of the limitations of MANETs. The security of the AODV protocol is compromised by a particular type of attack called 'Black Hole attack'. Black hole attack is one of the security threat in which the traffic is redirected to such a node that actually does not exist in the network. In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. This paper shows simulation results, provides fast message verification, identifies black hole and discovers the safe routing and avoiding the black hole attack.

Automated analysis of AODV using UPPAAL

Abstract: This paper describes an automated, formal and rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, a popular protocol used in wireless mesh networks. We give a brief overview of a model of AODV implemented in the UPPAAL model checker. It is derived from a process-algebraic model which reflects precisely the intention of AODV and accurately captures the protocol specification. Furthermore, we describe experiments carried out to explore AODV's behaviour in all network topologies up to 5 nodes. We were able to automatically locate problematic and undesirable behaviours. This is in particular useful to discover protocol limitations and to develop improved variants. This use of model checking as a diagnostic tool complements other formal-methods-based protocol modelling and verification techniques, such as process algebra.

A Novel Approach for GrayHole and BlackHole Attacks in Mobile Ad Hoc Networks

Abstract: Due to wireless communication, dynamic topology, limited resources and lack of centralized administration, MANETs are vulnerable to various types of DoS attacks on network layer. In Gray hole and Black hole attacks malicious nodes deliberately disrupt data transmission in the network by sending incorrect routing information. It is a challenge to keep the communication route free from such attackers. In this paper, we propose a scheme for Ad-hoc On-demand Distance Vector (AODV) protocol, in which an intermediate node detects the malicious node sending false routing information, routing packets are used not only to pass routing information, but also to pass information about malicious nodes. The proposed scheme not only detects but also removes malicious node by isolating it, to make safe and secure communication.

Implementation and Analysis of Routing Attacks in MANETs

Abstract: From the security perspective Mobile Ad hoc Networks (MANETs) are amongst the most challenging research areas and one of the key reasons for this is the ambiguous nature of insider attacks in these networks. In recent years, many attempts have been made to study the intrinsic attributes of these insider attacks but the focus has generally been on the analysis of one or very few particular attacks, or only the survey of various attacks without any performance analysis. Therefore, a major feature that research has lately lacked is a detailed and comprehensive study of the effects of various insider attacks on the overall performance of MANETs. In this paper we investigate, in detail, some of the most severe attacks against MANETs namely the blackhole attack, sinkhole attack, selfish node behavior, RREQ flood, hello flood, and selective forwarding attack. A detailed NS-2 implementation of launching these attacks successfully using Ad hoc On-Demand Distance Vector (AODV) routing protocol has been presented and a comprehensive and comparative analysis of these attacks is performed. We use packet efficiency, routing overhead, and throughput as our performance metrics. Our simulation- based study shows that flooding attacks like RREQ flood and hello flood drastically increase the routing overhead of the protocol. Route modification attacks such as sinkhole and blackhole are deadly and severely affect the packet efficiency and bring down the throughput to unacceptable ranges.

Destination-Sequenced Distance Vector (DSDV) Routing Protocol Implementation in ns-3

Abstract: Routing protocols are a critical aspect to performance in mobile wireless networks The development of new protocols requires testing against well-known protocols in various simulation environments In this paper we present an overview of several well-known MANET routing protocols and the implementation details of the DSDV routing protocol in the ns-3 network simulator We analyse DSDV routing performance under various scenarios and compare its performance with the other protocols implemented in ns-3, AODV and OLSR Our results verify the implementation of DSDV and show performance comparable to that of OLSR

A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks

Abstract: Reliable routing of packets in a Mobile Ad Hoc Network (MANET) has always been a major concern. The open medium and the susceptibility of the nodes of being fault-prone make the design of protocols for these networks a challenging task. The faults in these networks, which occur either due to the failure of nodes or due to reorganization, can eventuate to packet loss. Such losses degrade the performance of the routing protocols running on them. In this paper, we propose a routing algorithm, named as learning automata based fault-tolerant routing algorithm (LAFTRA), which is capable of routing in the presence of faulty nodes in MANETs using multipath routing. We have used the theory of Learning Automata (LA) for optimizing the selection of paths, reducing the overhead in the network, and for learning about the faulty nodes present in the network. The proposed algorithm can be juxtaposed to any existing routing protocol in a MANET. The results of simulation of our protocol using network simulator 2 (ns-2) shows the increase in packet delivery ratio and decrease in overhead compared to the existing protocols. The proposed protocol gains an edge over FTAR, E2FT by nearly 2% and by more than 10% when compared with AODV in terms of packet delivery ratio with nearly 30% faulty nodes in the network. The overhead generated by our protocol is lesser by 1% as compared to FTAR and by nearly 17% as compared to E2FT when there are nearly 30% faulty nodes.

Malicious AODV: Implementation and Analysis of Routing Attacks in MANETs

Abstract: From the security perspective Mobile Ad hoc Networks (MANETs) are amongst the most challenging research areas and one of the key reasons for this is the ambiguous nature of insider attacks in these networks. In recent years, many attempts have been made to study the intrinsic attributes of these insider attacks but the focus has generally been on the analysis of one or very few particular attacks, or only the survey of various attacks without any performance analysis. Therefore, a major feature that research has lately lacked is a detailed and comprehensive study of the effects of various insider attacks on the overall performance of MANETs. In this paper we investigate, in detail, some of the most severe attacks against MANETs namely the blackhole attack, sinkhole attack, selfish node behavior, RREQ flood, hello flood, and selective forwarding attack. A detailed NS-2 implementation of launching these attacks successfully using Ad hoc On-Demand Distance Vector (AODV) routing protocol has been presented and a comprehensive and comparative analysis of these attacks is performed. We use packet efficiency, routing overhead, and throughput as our performance metrics. Our simulationbased study shows that flooding attacks like RREQ flood and hello flood drastically increase the routing overhead of the protocol. Route modification attacks such as sinkhole and blackhole are deadly and severely affect the packet efficiency and bring down the throughput to unacceptable ranges.

The Black-Hole Node Attack in MANET

Abstract: The black hole problem is one of the security attacks that occur in mobile ad hoc networks (MANETs). We present two possible solutions. The first is to find more than one route to the destination. The second is to exploit the packet sequence number included in any packet header. Computer simulation shows that in comparison to the original ad hoc on demand distance vector (AODV) routing scheme, the second solution can verify 75% to 98% of the route to the destination depending on the pause time at a minimum cost of the delay in the networks. The main objective of this paper is to analyze black hole attack in MANET and its solutions.

Quality of experience-based routing in multi-service wireless mesh networks

Abstract: We develop an optimization framework for Quality of Experience (QoE)-based routing in multi-service Wireless Mesh Networks (WMNs). The framework takes into account the heterogeneous requirements of different services delivered over a WMN, such that the overall end-user QoE is maximized under given resource constraints. We propose a novel QoE-aware double reinforcement learning strategy for dynamically computing the most efficient routes to deliver the flows of each service type. Comprehensive NS-2-based simulations demonstrate the substantial performance gains that our approach enables over conventional routing techniques such as AODV, with significant improvement over video quality.

A Node-Disjoint Multipath Routing Method Based on AODV Protocol for MANETs

Abstract: Frequent link failures are caused in mobile ad-hoc networks due to node's mobility and use of unreliable wireless channels for data transmission. Due to this, multipath routing protocols become an important research issue. In this paper, we propose and implement a node-disjoint multipath routing method based on AODV protocol. The main goal of the proposed method is to determine all available node-disjoint routes from source to destination with minimum routing control overhead. With the proposed approach, as soon as the first route for destination is determined, the source starts data transmission. All the other backup routes, if available, are determined concurrently with the data transmission through the first route. This minimizes the initial delay caused because data transmission is started as soon as first route is discovered. We also propose three different route maintenance methods. All the proposed route maintenance methods are used with the proposed route discovery process for performance evaluation. The results obtained through various simulations show the effectiveness of our proposed methods in terms of route availability, control overhead, average end-to-end delay and packet delivery ratio.

Black-Hole and Wormhole Attack in Routing Protocol AODV in MANET

Abstract: Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a “Black Hole” and “Wormhole” attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors’ and making them communicate through the wormhole link.

A comparison of MANET routing protocols on airborne tactical networks

Abstract: In highly dynamic airborne networks, multi-hop routing becomes increasingly difficult due to high mobility, intermittent links and link quality, and the need to scale. Traditionally, airborne tactical networks have leveraged existing MANET proactive, reactive, and hybrid routing protocols with modifications for cross-layer information, to provide multihop routing. Although there has been some success with utilizing these protocols individually in airborne networks, a proper comparison of all types of MANET routing protocols at scale, with mobility patterns associated with airborne tactical networks, is lacking. In this paper, we compare a variety of proactive and reactive MANET routing protocols such as AODV, OLSR and OSPF-MDR, under relative node velocities and mobility patterns associated with airborne networks. Specifically, we evaluate each protocol in terms of routing overhead traffic, end-to-end message completion rate, and end-to-end delay, to examine performance vs. tradeoff.1

LOADng: Towards AODV Version 2

Abstract: The Ad hoc On-demand Distance-Vector routing protocol (AODV) was published in 2003 by the IETF, as experimental RFC 3561. This routing protocol was one of four routing protocols, developed by the IETF for use in mobile ad hoc networks (MANETs) -- with the other being DSR, TBRPF and OLSR. As operational experiences with these protocols accumulated, the IETF set forth on standardization of OLSRv2, a successor to OLSR, and DYMO -- with DYMO being the intended successor to DSR and AODV. Alas, while there was traction for and standardization of OLSRv2, interest in, development, standardization, and use of DYMO in MANETs slowly withered. AODV did, however, attract interest for routing in Low-power Lossy Networks (LLNs) due to its limited state requirements. Since 2005, several proposals for simplifying and adapting AODV specifically for LLNs emerged, in 2011 and 2012 with the use of one such adaptation of AODV in the G3-PLC standard for power line communications in smart grids, and with efforts within the IETF emerging towards a single LOADng specification, as next version of AODV. This paper presents this development -- from AODV, as specified in RFC3561 -- to LOADng. While the basic operation remains unchanged, LOADng presents simplifications, and additional features and flexibilities are introduced. This paper studies the impact of these changes "from AODV to LOADng", and observes that LOADng unites simplification, flexibility and performance improvements.

Combined Reactive-Geographic routing for Unmanned Aeronautical Ad-hoc Networks

Abstract: As a result of high mobility of Unmanned Aerial Vehicles (UAVs), designing a good routing protocol is challenging for Unmanned Aeronautical Ad-hoc Networks (UAANETs). Geographic-based routing mechanisms are seen to be an interesting option for routing in UAANETs due to the fact that location information of UAVs is readily available. In this paper, a combined routing protocol, called the Reactive-Greedy-Reactive (RGR), is presented for UAANET applications, which combines the mechanisms of the Greedy Geographic Forwarding (GGF) and reactive routing. The proposed RGR employs location information of UAVs as well as reactive end-to-end paths in the routing process. Simulation results show that RGR outperforms existing protocols such as Ad-hoc On-demand Distance Vector (AODV) in search UAANET missions in terms of delay and packet delivery ratio, yet its overhead is similar to traditional mechanisms.

An Improved GPSR Routing Strategy in VANET

Abstract: As a special type of mobile Ad hoc network, VANET has increasingly become an attractive technology in terms of safety driving and comfortable network services provided to vehicular users However, high mobility of vehicular nodes in VANET makes network topology changing frequently, and this makes route unavailability and causes high data packet loss Therefore, many researchers have focused on proposing or improving VANET routing protocols in order to provide more efficient and reliable routing solutions In this paper, taking vehicle density, moving direction and speed into consideration, a new routing strategy based on GPSR routing protocol is proposed Compared with the existed ones, it has three differences: 1) The special Hello Packet is designed with the functionality of setting precisely one-hop neighboring vehicles within the transmission range of the current node; 2) Set priority on the current vehicle's one-hop neighbors and select the next hop forwarder that may not be closest to the destination, the distance and velocity are taken into consideration 3) Take the "Quorum" as a buffer and reforward the data packet to solve the local maximum problem VanetMobiSim is used to build the simulation scenario and the performance of the proposed routing strategy is compared with GPSR and AODV on network simulator NS2 The results indicate that the improved GPSR routing strategy presented in the paper has better performance on packet delivery ratio, routing overhead

Regression-based trust model for mobile ad hoc networks

Abstract: The focus of this study is to propose a generalised trust-model over routing protocols in mobile ad hoc networks (MANETs). It is observed that the presence of malicious nodes is a critical factor affecting the network performance in an ad hoc network. The novelty in the approach is that the notion of trust can be easily incorporated into any routing protocol in MANETs. The vector auto regression based trust model is introduced to identify malicious nodes that launch multiple attacks in the network. The proposed trust model is incorporated over ad hoc on-demand distance vector (AODV) routing protocol and optimised link state routing (OLSR) protocol in MANETs. The performance evaluations show that by carefully setting the trust parameters, substantial benefit in terms of throughput can be obtained with minimal overheads. The computed trust and confidence values are introduced into the path computation process of the ad hoc routing protocols. It was observed that the nodes in the network were able to learn the malicious activities of their neighbours and hence, alternate trustworthy paths are taken to avoid data loss in the network, with trade-offs in end-to-end packet delay and routing traffic.

Performance Evaluation of Hybrid Routing Protocols in Mobile Ad Hoc Networks

Abstract: Mobile ad hoc network is a collection of wireless mobile nodes that creates a dynamically wireless network among them without using any fixed infrastructure. Nodes are mobile and free to move, independent of each other which makes routing much difficult. The routing protocols in MANET should be more dynamic so that they quickly respond to topological changes. In this paper simulation based experiments are performed to analyze the performance of Hybrid Routing Protocols ZRP, CBRP on the basis of Packet Delivery Ratio, End to End delay and Average Throughput. These results are compared with AODV, DSR and FSR routing protocols by varying number of nodes. The comparison shows that Hybrid routing Protocol for adhoc networks performs better as compared to AODV and DSR routing protocols.

Energy Efficient and Scalable Routing Protocol for Extreme Emergency Ad Hoc Communications

Abstract: In this paper, we firstly present an energy efficient (E2) and protocol independent mechanism for Mobile Ad-hoc Networks (MANETs) routing in disaster rescue operations. In such extreme emergency scenarios, protocols need to be energy efficient and scalable. We therefore proceed to integrate the E2 mechanism with the scalable ChaMeLeon (CML) protocol and consequently term it as E2CML. We support the E2 mechanism design using an energy consumption model for MANET nodes and use a packet delivery delay model to explain the scalability and energy efficiency of CML. Through the integration process of E2-CML, we primarily aim at satisfying the requirements for emergency MANETs (eMANETs), but also intend to demonstrate that the proposed mechanism is portable across popular protocols such as Optimized Link State Routing (OLSR) and Ad hoc On-Demand Vector (AODV). Finally, the paper presents simulation results to compare the improved routing performance of E2CML against both AODV and OLSR.

An improved AODV routing protocol for VANETs in city scenarios

Abstract: Vehicular Ad hoc Network (VANET) is a new communication paradigm that enables the communication between vehicles on the road network which falls in two categories: 1) Vehicle to Vehicle (V2V) and 2) Vehicle to Infrastructure (V2I). Various approaches of data dissemination in vehicular Network are used to inform vehicles about dynamic road traffic condition for achieving safe and efficient transportation system. Types of VANET applications and inherent characteristics such as unpredictable node density, fast movement of vehicles, constrained mobility make data dissemination quite challenging and general purpose ad hoc network routing protocols cannot work efficiently with it. In this paper, we propose a routing protocol IAODV (Improved AODV) that ensures giving timely and accurate information to drivers in V2V communication compare to AODV protocols in city scenarios of vehicular ad hoc networks. Proposed IAODV is defined as limited source routing up to two hops with backup route between source node and destination node. The performance of the proposed IAODV protocol is compared with basic AODV protocol in terms of Avg. End-to-End Delay, Packet Loss Ratio, Packet Delivery Ratio and Normalized Routing Load. Simulation results show that IAODV performs better than AODV protocol in given city scenarios of VANETs.