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

Ad Hoc Networking

Abstract: Ad hoc networks are to computing devices what Yahoo Personals are to single people: both help individuals communicate productively with strangers while maintaining security. Under the rules of ad hoc networking--which continue to evolve--your mobile phone can, when placed in proximity to your handheld address book, establish a little network on its own and enable data sharing between the two devices. In Ad Hoc Networking, Charles Perkins has compiled a series of technical papers about networking on the fly from a variety of laboratories and experts. The collection explains the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity. In this treatment, ad hoc networking covers a broad swath of situations. An ad hoc network might consist of several home-computing devices, plus a notebook computer that must exist on home and office networks without extra administrative work. Such a network might also need to exist when the people and equipment in normally unrelated military units need to work together in combat. Though the papers in this book are much more descriptive of protocols and algorithms than of their implementations, they aim individually and collectively at commercialization and popularization of mobile devices that make use of ad hoc networking. You'll enjoy this book if you're involved in researching or implementing ad hoc networking capabilities for mobile devices. --David Wall Topics covered: The state-of-the-art in protocols and algorithms to be used in ad hoc networks of mobile devices that move in and out of proximity to one another, to fixed resources like printers, and to Internet connectivity. Routing with Destination-Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad hoc On-Demand Distance Vector (AODV), and other resource-discovery and routing protocols; the effects of ad hoc networking on bandwidth consumption; and battery life.

A survey of secure mobile Ad Hoc routing protocols

Abstract: Several routing protocols have been proposed in recent years for possible deployment of mobile ad hoc networks (MANETs) in military, government and commercial applications. In this paper, we review these protocols with a particular focus on security aspects. The protocols differ in terms of routing methodologies and the information used to make routing decisions. Four representative routing protocols are chosen for analysis and evaluation including: Ad Hoc on demand Distance Vector routing (AODV), Dynamic Source Routing (DSR), Optimized Link State Routing (OLSR) and Temporally Ordered Routing Algorithm (TORA). Secure ad hoc networks have to meet five security requirements: confidentiality, integrity, authentication, non-repudiation and availability. The analyses of the secure versions of the proposed protocols are discussed with respect to the above security requirements.

Interference-Minimized Multipath Routing with Congestion Control in Wireless Sensor Network for High-Rate Streaming

Abstract: High-rate streaming in WSN is required for future applications to provide high-quality information of battlefield hot spots. Although recent advances have enabled large-scale WSN to be deployed supported by high-bandwidth backbone network for high-rate streaming, the WSN remains the bottleneck due to the low-rate radios used and the effects of wireless interferences. First, we propose a technique to evaluate the quality of a pathset for multipath load balancing, taking into consideration the effects of wireless interferences and that nodes may interfere beyond communication ranges. Second, we propose an interference- minimized multipath routing (I2MR) protocol that increases throughput by discovering zone-disjoint paths for load balancing, requiring minimal localization support. Third, we propose a congestion control scheme that further increases throughput by loading the paths for load balancing at the highest possible rate supportable. Finally, we validate thepath-set evaluation technique and also evaluate the I2MR protocol and congestion control scheme by comparing with AODV protocol and node-disjoint multipath routing (NDMR) protocol. Simulation results show that I2MR with congestion control achieves on average 230% and 150% gains in throughput over AODV and NDMR respectively, and consumes comparable or at most 24% more energy than AODV but up to 60% less energy than NDMR.

Prevention of Co-operative Black Hole Attack in MANET

Abstract: A mobile ad hoc network (MANET) is an autonomous network that consists of mobile nodes that communicate with each other over wireless links. In the absence of a fixed infrastructure, nodes have to cooperate in order to provide the necessary network functionality. One of the principal routing protocols used in Ad hoc networks is AODV (Ad hoc On demand Distance Vector) protocol. The security of the AODV protocol is compromised by a particular type of attack called ‘Black Hole’ attack In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. To reduce the probability it is proposed to wait and check the replies from all the neighboring nodes to find a safe route. Our approach to combat the Black hole attack is to make use of a ‘Fidelity Table’ wherein every participating node will be assigned a fidelity level that acts as a measure of reliability of that node. In case the level of any node drops to 0, it is considered to be a malicious node, termed as a ‘Black hole’ and is eliminated. Computer simulation using GLOMOSIM shows that our protocol provides better security and also better performance in terms of packet delivery than the conventional AODV in the presence of Black holes with minimal additional delay and Overhead.

Securing AODV: the A-SAODV secure routing prototype

Abstract: Mobile ad hoc networks pose new kinds of security problems, caused by their nature of collaborative and open systems and by limited availability of resources. In this article, we consider a Wi-Fi connectivity data link layer as a basis and focus on routing security. We discuss our implementation of the secure AODV protocol extension, which includes tuning strategies aimed at improving its performance. Namely, we propose an adaptive mechanism that tunes SAODV behavior. Moreover, we analyze our adaptive strategy and another technique that delays the verification of digital signatures. This article sums up the experimental results we collected in the prototype design, implementation, and tuning.

Performance Comparison of Wireless Mobile Ad-Hoc Network Routing Protocols

Abstract: Summary The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc Ondemand Distance Vector (AODV), Destination-Sequenced Distance-Vector Routing protocol (DSDV), Dynamic Source Routing Protocol (DSR), and Optimum Link State Routing (OLSR). Despite the popularity of those protocols, research efforts have not focused much in evaluating their performance when applied to variable bit rate (VBR). In this paper we present our observations regarding the performance comparison of the above protocols for VBR in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. Our studies have shown that reactive protocols perform better than proactive protocols. Further DSR has performed well for the performance parameters namely delivery ratio and routing overload while AODV performed better in terms of average delay.

(p,q)-Epidemic routing for sparsely populated mobile ad hoc networks

Abstract: This paper considers (p, q )-Epidemic Routing, a class of store-carry-forward routing schemes, for sparsely populated mobile ad hoc networks. Our forwarding scheme includes Two-Hop Forwarding and the conventional Epidemic Routing as special cases. In such forwarding schemes, the original packet is copied many times and its packet copies spread over the network. Therefore those packet copies should be deleted after a packet reaches the destination. We analyze the performance of (p, q)-Epidemic Routing with VACCINE recovery scheme. Unlike most of the existing studies, we discuss the performance of (p, q)-Epidemic Routing in depth, taking account of the recovery process that deletes unnecessary packets from the network.

Reference point group mobility and random waypoint models in performance evaluation of MANET routing protocols

Abstract: Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols plays an important role. We compare the performance of two prominent on-demand routing protocols for mobile ad hoc networks: dynamic source routing (DSR), ad hoc on-demand distance vector routing (AODV). A detailed simulation model with medium access control (MAC) and physical layer models is used to study the interlayer interactions and their performance implications. We demonstrate that even though DSR and AODV share similar on-demand behavior, the differences in the protocol mechanisms can lead to significant performance differentials. In this paper, we examine both on-demand routing protocols AODV and DSR based on packet delivery ratio, normalized routing load, normalized MAC load, average end-to-end delay by varying the node density, network loading, and mobility variations for reference point group mobility and random waypoint models. This framework aims to evaluate the effect of mobility models on the performance of mobile ad hoc networks (MANETs) routing protocols. Our results show that the protocol performance may vary drastically across mobility models and performance rankings of protocols may vary with the mobility models used. This effect can be explained by the interaction of the mobility characteristics with the connectivity graph properties.

Performance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point Mobility Model

Abstract: Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols plays an important role. We compare the performance of two prominent on-demand routing protocols for mobile ad hoc networks: Dynamic Source Routing (DSR), Ad Hoc On-demand distance Vector Routing (AODV). A detailed simulation model with MAC and physical layer models is used to study the interlayer interactions and their performance implications. We demonstrate that even though DSR and AODV share similar on-demand behavior, the differences in the protocol mechanisms can lead to significant performance differentials. In this paper we examine two on demand routing protocols AODV and DSR based on packet delivery ratio, normalized routing load, normalized MAC load, average end to end delay by varying the number of sources, speed and pause time.

On ant routing algorithms in ad hoc networks with critical connectivity

Abstract: This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating and storing food. The effectiveness of the heuristic algorithm is supported by mathematical proofs and demonstrated by a comparison with the well-known Ad hoc On Demand Distance Vector (AODV) algorithm. The differences and the similarities of the two algorithms have been highlighted. Results obtained by a theoretical analysis and a simulation campaign show that DAR allows obtaining some important advantages that makes it a valuable candidate to operate in ad hoc networks and the same method helps in the selection of the algorithm parameters. Since the approach aims at minimizing complexity in the nodes at the expenses of the optimality of the solution, it results to be particularly suitable in environments where fast communication establishment and minimum signalling overhead are requested. These requirements are typical of ad hoc networks with critical connectivity, as described in the paper. Thus the performance of the proposed algorithm are shown in ad hoc networks with critical connectivity and compared to some existing ad hoc routing algorithms.

On routing with guaranteed delivery in three-dimensional ad hoc wireless networks

Abstract: We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node υ's routing decision only depends on knowledge of the labels of the source and destination nodes, of the subgraph induced by nodes within distance k of υ, and of the neighbour of υ from which the message was received. We model a three-dimensional ad hoc network by a unit ball graph, where nodes are points in R3, and nodes u and υ are joined by an edge if and only if the distance between u and v is at most one. The question of whether there is a simple local routing algorithm that guarantees delivery in unit ball graphs has been open for some time. In this paper, we answer this question in the negative: we show that for any fixed k, there can be no k-local routing algorithm that guarantees delivery on all unit ball graphs. This result is in contrast with the two-dimensional case, where 1-local routing algorithms that guarantee delivery are known. Specifically, we show that guaranteed delivery is possible if the nodes of the unit ball graph are contained in a slab of thickness 1/√2. However, there is no k-local routing algorithm that guarantees delivery for the class of unit ball graphs contained in thicker slabs, i.e., slabs of thickness 1/√2+Ɛ for some Ɛ > 0. The algorithm for routing in thin slabs derives from a transformation of unit ball graphs contained in thin slabs into quasi unit disc graphs, which yields a 2-local routing algorithm. We also show several results that further elaborate on the relationship between these two classes of graphs.

BRA: a bidirectional routing abstraction for asymmetric mobile ad hoc networks

Abstract: Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenons. Unfortunately, routing protocols for mobile ad hoc networks typically work well only in bidirectional networks. This paper first presents a simulation study quantifying the impact of asymmetric links on network connectivity and routing performance. It then presents a framework called BRA that provides a bidirectional abstraction of the asymmetric network to routing protocols. BRA works by maintaining multi-hop reverse routes for unidirectional links and provides three new abilities: improved connectivity by taking advantage of the unidirectional links, reverse route forwarding of control packets to enable off-the-shelf routing protocols, and detection packet loss on unidirectional links. Extensive simulations of AODV layered on BRA show that packet delivery increases substantially (two-fold in some instances) in asymmetric networks compared to regular AODV, which only routes on bidirectional links.

Performance Comparison of On-Demand and Table Driven Ad Hoc Routing Protocols Using NCTUns

Abstract: The main aim of any ad-hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an efficient communication path between any two nodes with minimum routing overhead and bandwidth consumption. The design problem of such a routing protocol is not simple since an ad hoc environment introduces new challenges that are not present in fixed networks. A number of routing protocols have been proposed for this purpose like Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Destination- Sequenced Distance Vector (DSDV). In this paper, we study and compare the performance of the following three routing protocols AODV, DSR and DSDV. NCTUns 4.0 is used to study the relative performance of the routing protocols according to different criteria. The notable point of our analysis is that, it is based on varying number of nodes in the ad hoc network.

ODTPC: On-demand Transmission Power Control for Wireless Sensor Networks

Abstract: Development of efficient transmission power control algorithms providing both high energy efficiency and good link quality is the current major focus in wireless sensor networks research. In the paper, we propose an efficient transmission power control algorithm for wireless sensor networks, namely, the on-demand transmission power control (ODTPC) algorithm. This new algorithm attempts to reduce the initialization overhead in determining the optimal transmission power level while providing good link qualities. Our testbed experiment results show that ODTPC consumes much less energy than previous transmission power control algorithms (PCBL ( D. Son,et al.) and ATPC (S. Lin, et al.)) and is easily implemented with routing protocols like AODV (C. Perkin, and E. Royer) and Directed Diffusion (C. Intanagonwiwat, et al.).

Neighbour coverage: A dynamic probabilistic route discovery for mobile ad hoc networks

Abstract: Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput.

Routing in Large-Scale Buses Ad Hoc Networks

Abstract: A disruption-tolerant network (DTN) attempts to route packets between nodes that are temporarily connected. Difficulty in such networks is that nodes have no information about the network status and contact opportunities. The situation is different in public bus networks because the movement of buses exhibits some regularity so that routing in a deterministic way is possible. Many algorithms use a contacts oracle that provides the exact meeting times and durations between all nodes. However, in a real vehicular environment, an oracle is not always accurate, and deterministic routing gives poor results. In this paper, we present BLER, a routing algorithm that achieves effective routing in a buses environment. BLER, compared to other algorithms, performs routing at bus line level instead of bus level; it uses specific bus lines information to achieve good performances. We evaluate BLER on real traces of the bus network of Shanghai, and compare it to other routing algorithms. Performances provide good results for this kind of DTNs.

Wormhole Attack Detection in Wireless Sensor Networks

Abstract: The nature of wireless ad hoc and sensor networks make them very attractive to attackers. One of the most popular and serious attacks in wireless ad hoc networks is wormhole attack and most proposed protocols to defend against this attack used positioning devices, synchronized clocks, or directional antennas. This paper analyzes the nature of wormhole attack and existing methods of defending mechanism and then proposes round trip time (RTT) and neighbor numbers based wormhole detection mechanism. The consideration of proposed mechanism is the RTT between two successive nodes and those nodes’ neighbor number which is needed to compare those values of other successive nodes. The identification of wormhole attacks is based on the two faces. The first consideration is that the transmission time between two wormhole attack affected nodes is considerable higher than that between two normal neighbor nodes. The second detection mechanism is based on the fact that by introducing new links into the network, the adversary increases the number of neighbors of the nodes within its radius. This system does not require any specific hardware, has good performance and little overhead and also does not consume extra energy. The proposed system is designed in ad hoc on-demand distance vector (AODV) routing protocol and analysis and simulations of the proposed system are performed in network simulator (ns-2). Keywords—AODV, Wormhole attacks, Wireless ad hoc and

Inter-domain routing for mobile ad hoc networks

Abstract: Inter-domain routing is an important component to allow interoperation among heterogeneous network domains operated by different organizations. Although inter-domain routing has been well supported in the Internet, there has been relatively little support to the Mobile Ad Hoc Networks (MANETs) space. In MANETs, the inter-domain routing problem is challenged by: (1) dynamic network topology due to mobility, and (2) diverse intra-domain ad hoc routing protocols. In this paper, we discuss how to enable inter-domain routing among MANETs, and to handle the dynamic nature of MANETs. We first present the design challenges for inter-domain routing in MANETs, and then propose a framework for inter-domain routing in MANETs.

A multipath AODV routing protocol in mobile ad hoc networks with SINR-based route selection

Abstract: This paper proposes a multipath routing protocol called cross-layered multipath AODV (CM-AODV), which selects multiple routes on demand based on the signal-to-interference plus noise ratio (SINR) measured at the physical layer. Note that AODV (ad hoc on-demand distance vector) is one of the most popular routing protocols for mobile ad hoc networks. Each time a route request (RREQ) message is forwarded hop by hop, each forwarding node updates the route quality which is defined as the minimum SINR of serialized links in a route and contained in the RREQ header. Compared to the conventional multipath version of AODV protocol (which is called AOMDV), CM-AODV assigns the construction of multiple paths to the destination node and makes it algorithmically simple, resulting in the improved performance of packet delivery and the less overhead incurred at intermediate nodes. Our performance study shows that CMAODV significantly outperforms AOMDV in terms of packet delivery ratio and average end-to-end delay, but results in up to 45 percent less routing overhead.

Commanding mobile robots via wireless ad-hoc networks — A comparison of four ad-hoc routing protocol implementations

Abstract: Future applications of mobile robot teams or robot teleoperation require highly dynamic network topologies. One promising approach is the use of relay nodes in wireless ad-hoc networks which require special routing protocols to provide a transparent communication network to the user. This work tests and compares four different existing ad-hoc routing protocol implementations with respect to aspects of mobile robot teleoperation. The reactive routing protocols ad-hoc on-demand distance vector (AODV) and dynamic source routing (DSR), the proactive optimized link state routing (OLSR) and B.A.T.M.A.N. are used in test scenarios to command a mobile robot via an ad-hoc network of several communication relay nodes. For all four ad-hoc routing protocols, the route reestablishing behavior is observed. In particular the packet loss and the duration of route reestablishing during test runs with real hardware in an outdoor environment are analyzed.

Black hole attack prevention based on authentication mechanism

Abstract: The black hole attack is one of the security attacks that occur in Mobile Ad-hoc Networks (MANETs). In the attack, a malicious node exploits the routing protocol to advertise itself as having the shortest path to the node whose data packets it wants to intercept. In this paper, the black hole problem is addressed. An authentication mechanism, based on the hash function, the Message Authentication Code (MAC), and the Pseudo Random Function (PRF), is proposed for black hole prevention on top of Ad-hoc On-demand Distance Vector (AODV). The simulation results show the scheme provides fast message verification identifies black hole and discovers the safe routing avoiding the black hole attack.

SEAR: a secure efficient ad hoc on demand routing protocol for wireless networks

Abstract: Multi-hop routing is essential to the operation of wireless ad hoc networks. Unfortunately, it is very easy for an adversary to forge or modify routing messages to inflict severe damage on the underlying routing protocol. In this paper, we present SEAR, a Secure Efficient Ad hoc Routing protocol for ad hoc networks that is mainly based on efficient symmetric cryptography, with asymmetric cryptography used only for the distribution of initial key commitments. We show, through both theoretical examination and simulations, that SEAR provides better security with significantly less overhead than other existing secure AODV protocols.

Preventing Cooperative Black Hole Attacks in Mobile Ad Hoc Networks: Simulation Implementation and Evaluation

Abstract: A black hole attack is a severe attack that can be easily employed against routing in mobile ad hoc networks. A black hole is a malicious node that falsely replies for any route requests without having active route to specified destination and drops all the receiving packets. If these malicious nodes work together as a group then the damage will be very serious. This type of attack is called cooperative black hole attack. In [9], we proposed a solution to identifying and preventing the cooperative black hole attack. Our solution discovers the secure route between source and destination by identifying and isolating cooperative black hole nodes. In this paper, via simulation, we evaluate the proposed solution and compare it with other existing solutions in terms of throughput, packet loss percentage, average end-to-end delay and route request overhead. The experiments show that (1) the AODV greatly suffers from cooperative black holes in terms of throughput and packet losses, and (2) our solution proposed in [9] presents good performance in terms of better throughput rate and minimum packet loss percentage over other solutions, and (3) our solution proposed in [9] can accurately prevent the cooperative black hole attacks.

VANET's Mobility Models and Overtaking: An Overview

Abstract: The most important feature of vehicular ad hoc networks (VANETs) is the high mobility of nodes, which makes the mobility model one of the most important parameters that should be carefully selected when evaluating any protocol. To correctly and faithfully evaluate protocols in a simulation study, the model should be as realistic as possible. Earlier models used in general mobile ad hoc networks (MANETs), such as the random waypoint, are unsuitable for the VANET application, where the nodes do not move freely in the open area, but on the existing routes that are constrained by many parameters (route intersections, stop and traffic light signals, the presence of other vehicles in front the vehicle, etc.). Some new models taking into account these features have been recently proposed. In this paper we provide an overview of the mobility models newly proposed in literature, which can be used for simulating VANET. Afterwards, we will present our mobility simulator that mimics many of the recent models. Finally, we use this simulator to illustrate the impact of the overtaking on mobility and subsequently on the performance results, a parameter neglected by all the previous simulation studies.

PACONET: imProved Ant Colony Optimization Routing Algorithm for Mobile Ad Hoc NETworks

Abstract: Mobile ad hoc networks (MANETS) are infrastructureless network consisting of mobile nodes, with constantly changing topologies, that communicate via a wireless medium. Therefore, routing is a challenging issue in MANETs. Recently, nature inspired algorithms have been explored as means of finding an efficient solution to this routing problem. In this paper, we develop an improved routing algorithm for MANETs based on ant colony optimization (ACO) inspired by real ants. The performance of the routing algorithm is evaluated through simulation and is compared to an existing well known MANET routing protocol, ad hoc on-demand distance vector (AODV). Several performance metrics are considered in different scenarios with varying mobility levels and traffic load.

Stable and Energy Efficient Routing for Mobile Adhoc Networks

Abstract: Mobile ad hoc networking is a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Although lots of research has been done on supporting QoS in the Internet and other networks, but they are not suitable for mobile Ad hoc networks and still QoS support for such networks remains an open problem. In this paper, a new scheme has been proposed for achieving QoS in terms of packet delivery, multiple connections, better power management and stable routes. It offers quick adaptation to distributed processing, dynamic linking, low processing overhead and loop freedom at all times. The proposed scheme has been incorporated using AODV protocol and by extensive simulation the performance has been studied, and it is clearly shown that the proposed scheme performs very well for different network scenarios.

Bypass AODV: improving performance of ad hoc on-demand distance vector (AODV) routing protocol in wireless ad hoc networks

Abstract: Bypass-AODV, a local recovery protocol, is proposed to enhance the performance of AODV routing protocol by overcoming several inherited problems such as unnecessary error recovery invocations, newly non-optimal reconstructed routes, high packet drop ratios, and high routing overheads. Bypass-AODV uses cross-layer MAC-notification to identify mobility-related link break, and then setup a bypass between the broken-link end nodes via an alternative node while keeps on the rest of the route. Therefore, Bypass-AODV enhances resource utilization by avoiding unnecessary error recovery cycles and consequently increases the network throughput. On the other hand, Bypass-AODV enhances route reliability; it avoids dropping packets by transmitting them over the constructed bypass. The simulation results show that when running 1-TCP connection, Bypass-AODV performs better than AODV. In particular, this behavior is rapidly changed with increasing the physical distance between the TCP connection end nodes beyond 2 hops. For example, when number of hops is equal to 6, goodput is enhanced by more than 100% compared to AODV for a 1-TCP connection and about 24% for multiple TCP connections. Further, the ratio of packet drop is reduced from 16% to 2%. Moreover, considering the hop count, the Bypass-AODV shows less sensitivity to the ongoing number of TCP connections.