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

A survey of secure wireless ad hoc routing

Abstract: Ad hoc networks use mobile nodes to enable communication outside wireless transmission range. Attacks on ad hoc network routing protocols disrupt network performance and reliability. The article reviews attacks on ad hoc networks and discusses current approaches for establishing cryptographic keys in ad hoc networks. We describe the state of research in secure ad hoc routing protocols and its research challenges.

AODV routing protocol implementation design

Abstract: To date, the majority of ad hoc routing protocol research has been done using simulation only. One of the most motivating reasons to use simulation is the difficulty of creating a real implementation. In a simulator, the code is contained within a single logical component, which is clearly defined and accessible. On the other hand, creating an implementation requires use of a system with many components, including many that have little or no documentation. The implementation developer must understand not only the routing protocol, but all the system components and their complex interactions. Further, since ad hoc routing protocols are significantly different from traditional routing protocols, a new set of features must be introduced to support the routing protocol. In this paper we describe the event triggers required for AODV operation, the design possibilities and the decisions for our ad hoc on-demand distance vector (AODV) routing protocol implementation, AODV-UCSB. This paper is meant to aid researchers in developing their own on-demand ad hoc routing protocols and assist users in determining the implementation design that best fits their needs.

Black hole attack in mobile Ad Hoc networks

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 compared 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 times at a minimum cost of the delay in the networks.

Cross-layering in mobile ad hoc network design

Abstract: Mobile ad hoc network researchers face the challenge of achieving full functionality with good performance while linking the new technology to the rest of the Internet. A strict layered design is not flexible enough to cope with the dynamics of manet environments, however, and will prevent performance optimizations. The MobileMan cross-layer architecture offers an alternative to the pure layered approach that promotes stricter local interaction among protocols in a manet node.

Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy

Abstract: Recent availability of small inexpensive low power GPS receivers and techniques for finding relative coordinates based on signal strengths, and the need for the design of power efficient and scalable networks, provided justification for applying position based routing methods in ad hoc networks. A number of such algorithms were developed in last few years, in addition to few basic methods proposed about fifteen years ago. This article surveys known routing methods, and provides their taxonomy in terms of a number of characteristics: loop-free behavior, distributed operation (localized, global or zonal), path strategy (single path, multi-path or flooding based), metrics used (hop count, power or cost), memorization (memoryless or memorizing past traffic), guaranteed delivery, scalability, and robustness (strategies to handle the position deviation due to the dynamicity of the network). We also briefly discuss relevant issues such as physical requirements, experimental design, location updates, QoS, congestion, scheduling node activity, topology construction, broadcasting and network capacity.

MOCA : MObile Certificate Authority for Wireless Ad Hoc Networks

Abstract: An authentication service is one of the the most fundamental building blocks for providing communication security. In this paper, we present the MOCA (MObile Certificate Authority) key management framework designed to provide authentication service for ad hoc wireless networks. MOCA is a distributed certificate authority (CA) based on threshold cryptography. We present a set of guidelines for a secure configuration of threshold cryptography to maintain strong security. MOCA utilizes a carefully selected set of mobile nodes to function as a collective certificate authority while the MOCA nodes are kept anonymous. Equipped with a novel routing protocol designed to support the unique communication pattern for certification traffic, MOCA achieves high availability without sacrificing security. Both the security of the framework and the operational performance is evaluated with rigorous analysis and extensive simulation study.

Performance evaluation of routing protocols for ad hoc wireless networks

Abstract: A mobile ad hoc network is a collection of autonomous mobile nodes that communicate with each other over wireless links. Such networks are expected to play an increasingly important role in future civilian and military settings, being useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable and movement of communicating parties is possible. However, since there is no stationary infrastructure such as base stations, mobile hosts need to operate as routers in order to maintain the information about the network connectivity. Therefore, a number of routing protocols have been proposed for ad hoc wireless networks. In this paper, we study and compare the performance of the following routing protocols AODV, PAODV (preemptive AODV), CBRP, DSR, and DSDV. A variety of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. Our results indicate that despite its improvement in reducing route request packets, CBRP has a higher overhead than DSR because of its periodic hello messages while AODV's end-to-end packet delay is the shortest when compared to DSR and CBRP. PAODV has shown little improvements over AODV.

AntHocNet: An ant-based hybrid routing algorithm for mobile ad hoc networks

Abstract: In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and maintain good routes in such networks. Especially reliability and efficiency are important concerns. AntHocNet is based on ideas from Ant Colony Optimization. It consists of both reactive and proactive components. In a reactive path setup phase, multiple paths are set up between the source and destination of a data session, and during the course of the communication session, ants proactively test existing paths and explore new ones. In simulation tests we show that AntHocNet can outperform AODV, one of the most important current state-of-the-art algorithms, both in terms of end-to-end delay and packet delivery ratio.

AntHocNet: An Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks

Abstract: In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and maintain good routes in such networks. Especially reliability and efficiency are important concerns. AntHocNet is based on ideas from Ant Colony Optimization. It consists of both reactive and proactive components. In a reactive path setup phase, multiple paths are set up between the source and destination of a data session, and during the course of the communication session, ants proactively test existing paths and explore new ones. In simulation tests we show that AntHocNet can outperform AODV, one of the most important current state-of-the-art algorithms, both in terms of end-to-end delay and packet delivery ratio.

A trust model based routing protocol for secure ad hoc networks

Abstract: Security issues have been emphasized when mobile ad hoc networks (MANETs) are employed into military and aerospace fields. We design a novel secure routing protocol for MANETs. This protocol TAODV (Trusted AODV) extends the widely used AODV (ad hoc on-demand distance vector) routing protocol and employs the idea of a trust model to protect routing behaviors in the network layer of MANETs. In the TAODV, trust among nodes is represented by opinion, which is an item derived from subjective logic. The opinions are dynamic and updated frequently as our protocol specification: if one node performs normal communications, its opinion from other nodes' points of view can be increased; otherwise, if one node performs some malicious behaviors, it is ultimately denied by the whole network. A trust recommendation mechanism is also designed to exchange trust information among nodes. The salient feature of TAODV is that, using trust relationships among nodes, there is no need for a node to request and verify certificates all the time. This greatly reduces the computation overheads. Meanwhile, with neighbors' trust recommendations, a node can make objective judgement about another node's trustworthiness to maintain the whole system at a certain security level.

Peer-to-peer file-sharing over mobile ad hoc networks

Abstract: Current peer-to-peer file-sharing systems mostly work on wired networks Mobile ad hoc network is characterized as multihop wireless communications between mobile devices Five routing approaches with different complexity are proposed to enable peer-to-peer file-sharing over mobile ad hoc networks The complexity of the proposed approaches is evaluated and compared It is concluded that the cross-layer protocols perform better than simply overlaying peer-to-peer searching protocol on mobile ad hoc networks

A study on the feasibility of mobile gateways for vehicular ad-hoc networks

Abstract: Development in Wireless LAN and Cellular technologies has motivated recent efforts to integrate the two. This creates new application scenarios that were not possible before. Vehicles with Wireless LAN radios can use other vehicles with both Wireless LAN and Cellular radios as mobile gateways and connect to the outside world. We aim to study the feasibility of such global connectivity from the road through simulation of the underlying connectivity characteristics for varying traffic and gateway densities. The connectivity results suggest that each vehicle should be able to connect to at least one gateway for a majority of time. The average path lifetimes are found to be good enough many traditional Internet applications like FTP and HTTP. The effectiveness of the AODV wireless ad-hoc routing protocol over this scenario is evaluated and shown to perform well for the densities considered. However, the routes created by AODV can break very frequently due to the dynamic nature of mobility involved. We introduce a couple of prediction based routing protocols to minimize these route breakages and thus improve performance. These protocols take advantage of some deterministic characteristics of the mobility model to better predict route breakages and take preemptive action.

Outdoor experimental comparison of four ad hoc routing algorithms

Abstract: Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorrect picture of algorithm performance. In this paper, we report on an outdoor comparison of four different routing algorithms, APRL, AODV, ODMRP, and STARA, running on top of thirty-three 802.11-enabled laptops moving randomly through an athletic field. This comparison provides insight into the behavior of ad hoc routing algorithms at larger real-world scales than have been considered so far. In addition, we compare the outdoor results with both indoor ("tabletop") and simulation results for the same algorithms, examining the differences between the indoor results and the outdoor reality. Finally, we describe the software infrastructure that allowed us to implement the ad hoc routing algorithms in a comparable way, and use the same codebase for indoor, outdoor, and simulated trial runs.

Group and swarm mobility models for ad hoc network scenarios using virtual tracks

Abstract: The mobility model is one of the most important factors in the performance evaluation of a mobile ad hoc network (MANET). Traditionally, the random waypoint mobility model has been used to model the node mobility, where the movement of one node is modeled as independent from all others. However, in reality, especially in large scale military scenarios, mobility coherence among nodes is quite common. One typical mobility behavior is group mobility. Thus, to investigate military MANET scenarios, an underlying realistic mobility model is highly desired. In this paper, we propose a "virtual track" based group mobility model (VT model) which closely approximates the mobility patterns in military MANET scenarios. It models various types of node mobility such as group moving nodes, individually moving nodes as well as static nodes. Moreover, the VT model not only models the group mobility, it also models the dynamics of group mobility such as group merge and split. Simulation experiments show that the choice of mobility model has significant impact on network performance.

Clustering algorithms for ad hoc wireless networks

Abstract: An ad hoc network is a multihop wireless communication network supporting mobile users without any existing infrastructure To become commercially successful, the technology must allow networks to support many users A complication is that addressing and routing in ad hoc networks does not scale up as easily as in the Internet By introducing hierarchical addresses to ad hoc networks, we can effectively address this complication Clustering provides a method to build and maintain hierarchical addresses in ad hoc networks Here, we survey several clustering algorithms, concentrating on those that are based on graph domination In addition, we describe results that show that building clustered hierarchies is affordable and that clustering algorithms can also be used to build virtual backbones to enhance network quality of service

Attack Analysis and Detection for Ad Hoc Routing Protocols

Abstract: Attack analysis is a challenging problem, especially in emerging environments where there are few known attack cases. One such new environment is the Mobile Ad hoc Network (MANET). In this paper, we present a systematic approach to analyze attacks. We introduce the concept of basic events. An attack can be decomposed into certain combinations of basic events. We then define a taxonomy of anomalous basic events by analyzing the basic security goals.

An intrusion detection tool for AODV-based ad hoc wireless networks

Abstract: Mobile ad hoc network routing protocols are highly susceptible to subversion. Previous research in securing these protocols has typically used techniques based on encryption and redundant transmission. These techniques prevent a range of attacks against routing protocols but are expensive to deploy on energy-constrained wireless devices. Experience in securing wired networks has demonstrated that, in addition to intrusion prevention techniques, it is useful to deploy intrusion detection techniques as a second line of defense. In this paper, we discuss some of the threats to wireless ad hoc networks, and, specifically, some attacks against the AODV routing protocol. We also present a tool aimed at real-time detection of these attacks. The tool monitors network packets to detect local and distributed attacks within its radio range. Experiments show that the tool provides effective intrusion detection functionality while using only a limited amount of resources.

A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks

Abstract: Given a graph G = (V, E), a dominating set D is a subset of V such that any vertex not in D is adjacent to at least one vertex in D. Efficient algorithms for computing the minimum connected dominating set (MCDS) are essential for solving many practical problems, such as finding a minimum size backbone in ad hoc networks. Wireless ad hoc networks appear in a wide variety of applications, including mobile commerce, search and discovery, and military battlefield. In this chapter we propose a new efficient heuristic algorithm for the minimum connected dominating set problem. The algorithm starts with a feasible solution containing all vertices of the graph. Then it reduces the size of the CDS by excluding some vertices using a greedy criterion. We also discuss a distributed version of this algorithm. The results of numerical testing show that, despite its simplicity, the proposed algorithm is competitive with other existing approaches.

A Survey on Mobile Ad Hoc Wireless Network

Abstract: This paper presents a coherent survey on ad hoc wireless networks, with the intent of serving as a quick reference to the current research issues in ad hoc networking. It starts with a background on the origin and development stages of ad hoc network, then summaries the characteristics, capabilities, applications and design constraints of ad hoc network fully distinguishing it from traditional networks. The paper discuses a broad range of research issues such as Routing, Medium Access, Multicasting, Quality of service, TCP performance, Energy, Security and Bluetooth, outlining the major challenges which have to be solved before widespread deployment of the technology is possible. Through this survey it would be seen that Ad ho c Networking presence an interesting research area inheriting the problems of wireless and mobile communications in their most difficult form.

Distributed power control for energy efficient routing in ad hoc networks

Abstract: In this paper, distributed power control is proposed as a means to improve the energy efficiency of routing algorithms in ad hoc networks. Each node in the network estimates the power necessary to reach its own neighbors, and this power estimate is used both for tuning the transmit power (thereby reducing interference and energy consumption) and as the link cost for minimum energy routing. With reference to classic routing algorithms, such as Dijkstra and Link State, as well as more recently proposed ad hoc routing schemes, such as AODV, we demonstrate by extensive simulations that in many cases of interest our scheme provides substantial transmit energy savings while introducing limited degradation in terms of throughput and delay.

LLS: a locality aware location service for mobile ad hoc networks

Abstract: Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication sessions between mobile nodes whose location is unknown. A location service for ad hoc networks is a distributed algorithm that allows any source node s to know the location of any destination node t, simply by knowing t's network identifier.A location service has a locality aware lookup algorithm if the cost of locating destination t from source s is proportional to the cost of the minimal cost path between s and t. A location service has a locality aware publish algorithm if the cost of updating the location service due to a node moving from x to y is proportional to the distance between x and y.In this paper we present LLS, the first location service for the Unit Disk Graph model whose lookup and publish algorithms have worst case locality guarantees and average case locality awareness efficiency for any source destination pair.

Group communications in mobile ad hoc networks

Abstract: Efficient support of group communications is critical for most ad hoc network applications. However, manet group communications issues differ from those in wired environments because the wireless communications medium has variable and unpredictable characteristics, and the signal strength and propagation fluctuate with respect to time and environment. We provide an overview of group communications issues such as protocol design, state maintenance, and performance. We also discuss representative protocols and examine related issues such as reliability, power conservation, quality of service, security, and areas requiring additional research.

Scaling laws for capacity and delay in wireless ad hoc networks with random mobility

Abstract: We study the asymptotic throughput capacity and delay in mobile ad hoc networks following the 2-hop relaying algorithm proposed by Grossglauser and Tse (2001). We assume the nodes to be uniformly distributed on a sphere, and consider two canonical mobility models: the Brownian mobility model (BMM), and the random way-point mobility model (RWMM). We show that for an ad hoc network formed by n mobile nodes the delay scales as O (log/sup 2/n//spl sigma//sup 2/(n)) under the BMM, and, /spl Theta/ (1/r(n)v(n)) under the RWMM, where /spl sigma//sup 2/(n) is the variance parameter of the BMM, v(n) is the average speed of nodes under the RWMM, and r(n) is the communication radius of the nodes.

Broadcasting and Activity Scheduling in AD HOC Networks

Abstract: In this chapter, area-based methods are reclassified within other groups, whereas neighbor-knowledge methods are divided into clustering-based, selecting forwarding neighbors, and internal-node-based methods. We present a comprehensive taxonomy of broadcasting schemes with the one-to-all model in mind (the other models can similarly be considered).

Analyzing control traffic overhead versus mobility and data traffic activity in mobile Ad-Hoc network protocols

Abstract: This paper proposes a general, parameterized model for analyzing protocol control overhead in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols. Our analytical model is validated by comparisons with simulations, both taken from literature and made specifically for this paper. For example, our model predicts linearity of control overhead with regard to mobility as observed in existing simulations results. We identify the model parameters for protocols like AODV, DSR and OLSR. Our model then allows accurate predictions of which protocol will yield the lowest overhead depending on the node mobility and traffic activity pattern.

Ad Hoc Wireless Networking

Abstract: A Lifetime-Optimizing Approach to Routing Messages in Ad-hoc Networks.- Improving TCP Performance in Mobile Ad hoc Networks.- Energy Efficient Approaches in Wireless Networking.- Position Based Routing Algorithms For Ad Hoc Networks: A Taxonomy.- Location Discovery in Ad-hoc Wireless Sensor Networks.- Ad Hoc Wireless Networks: From Theory to Protocols.- Applications of Computational Geometry in Wireless Networks.- Channel-Adaptive Ad Hoc Routing.- A Survey of Wireless Security in Mobile Ad Hoc Networks: Challenges and Available Solutions.- Location Related Issues in Mobile Network Systems.- Power-Conserving Algorithms and Protocols in Ad Hoc Networks.- Secure Communication in Adverse Mobile Ad Hoc Networks.- The Role of Proactivity in Wireless and Ad Hoc Networks.- Hybrid Routing: The Pursuit of an Adaptable and Scalable Routing Framework for Ad Hoc Networks.- Scalability of Routing in Ad Hoc Networks: Principles and Practice.

Performance comparison of ad hoc wireless network routing protocols

Abstract: In recent years many protocols for ad hoc wireless networks have been developed but very little information is available on the performance of these protocols. After describing the desirable characteristics of an ad hoc network routing protocol this paper provides an overview of four existing ad hoc wireless routing protocols, which are distance sequence distance vector (DSDV), ad hoc on demand distance vector (AODV), dynamic source routing (DSR) and temporally ordered routing algorithm (TORA). The performance comparison of these four protocols is based on simulations performed using network simulator-2. The performance parameters analyzed are the mobility rate, network load and network size. The paper describes all the parameters used for the simulations in detail and then compares each routing protocol's simulation results before arriving at a conclusion as to which is the best one for ad hoc networks.