Showing papers on "Ad hoc On-Demand Distance Vector Routing published in 2002"
01 Jan 2002
TL;DR: A survey of mobility models that are used in the simulations of ad hoc networks and illustrates how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.
4,618 citations
23 Sep 2002
TL;DR: a secure on-demand routing protocol for ad hoc networks that can be used to connect ad-hoc networks to each other without disrupting existing networks.
Abstract: An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents a large number of types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.
1,829 citations
12 Nov 2002
TL;DR: This work details security threats against ad hoc routing protocols, specifically examining AODV and DSR, and proposes a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected.
Abstract: Most recent ad hoc network research has focused on providing routing services without considering security. We detail security threats against ad hoc routing protocols, specifically examining AODV and DSR. In light of these threats, we identify three different environments with distinct security requirements. We propose a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected. Our protocol, authenticated routing for ad hoc networks (ARAN), is based on certificates and successfully defeats all identified attacks.
1,641 citations
Book•
01 Jan 2002
TL;DR: This book discusses the design and implementation of Ad Hoc Wireless Media Access Protocols, and discusses the challenges and opportunities presented by this technology in the rapidly changing environment of mobile telecommunications.
Abstract: About The Author. Preface. Acknowledgments. Quotes & Words of Wisdom. 1. Introduction to Wireless Networks. Evolution of Mobile Cellular Networks. Global System for Mobile Communications (GSM). General Packet Radio Service (GPRS). Personal Communications Services (PCSs). Wireless LANs (WLANS). Universal Mobile Telecommunications System (UMTS). IMT2000. IS-95, cdmaOne and cdma2000 Evolution. Organization of this Book. 2. Origins Of Ad Hoc: Packet Radio Networks. Introduction. Technical Challenges. Architecture of PRNETs. Components of Packet Radios. Routing in PRNETs. Route Calculation. Pacing Techniques. Media Access in PRNETs. Flow Acknowledgments in PRNETs. Conclusions. 3. Ad Hoc Wireless Networks. What Is an Ad Hoc Network? Heterogeneity in Mobile Devices. Wireless Sensor Networks. Traffic Profiles. Types of Ad Hoc Mobile Communications. Types of Mobile Host Movements. Challenges Facing Ad Hoc Mobile Networks. Conclusions. 4. Ad Hoc Wireless Media Access Protocols. Introduction. Problems in Ad Hoc Channel Access. Receiver-Initiated MAC Protocols. Sender-Initiated MAC Protocols. Existing Ad Hoc MAC Protocols. MARCH: Media Access with Reduced Handshake. Conclusions. 5. Overview of Ad Hoc Routing Protocols. Table-Driven Approaches. Destination Sequenced Distance Vector (DSDV). Wireless Routing Protocol (WRP). Cluster Switch Gateway Routing (CSGR). Source-Initiated On-Demand Approaches. Ad Hoc On-Demand Distance Vector Routing (AODV). Dynamic Source Routing (DSR). Temporally Ordered Routing Algorithm (TORA). Signal Stability Routing (SSR). Location-Aided Routing (LAR). Power-Aware Routing (PAR). Zone Routing Protocol (ZRP). Source Tree Adaptive Routing (STAR). Relative Distance Microdiversity Routing (RDMAR). Conclusions. 6. Associativity-Based Long-Lived Routing. A New Routing Paradigm. Associativity-Based Long-Lived Routing. ABR Protocol Description. Conclusions. 7. Implementation Of Ad Hoc Mobile Networks. Introduction. ABR Protocol Implementation in Linux. Experimentation and Protocol Performance. Important Deductions. Conclusions. 8. Communication Performance of Ad Hoc Networks. Introduction. Performance Parameters of Interest. Route Discovery (RD) Time. End-to-End Delay (EED) Performance. Communication Throughput Performance. Packet Loss Performance. Route Reconfiguration/Repair Time. TCP/IP-Based Applications. Conclusions. 9. Energy Conservation: Power Life Issues. Introduction. Power Management. Advances in Device Power Management. Advances in Protocol Power Management. Power Conservation by Mobile Applications. Periodic Beaconing On Battery Life. Standalone Beaconing. HF Beaconing with Neighboring Nodes. Comparison of HF Beaconing with and without Neighbors. LF Beaconing with Neighboring Nodes. Comparison of LF Beaconing with and without Neighbors. Deductions. Conclusions. 10. Ad Hoc Wireless Multicast Routing. Multicasting in Wired Networks. Multicast Routing in Mobile Ad Hoc Networks. Existing Ad Hoc Multicast Routing Protocols. ABAM: Associativity-Based Ad Hoc Multicast. Comparisons of Multicast Routing Protocols. Conclusions. 11. TCP Over Ad Hoc. Introduction to TCP. Versions of TCP. Problems Facing TCP in Wireless Last-Hop. Problems Facing TCP in Wireless Ad Hoc. Approaches to TCP over Ad Hoc. Conclusion. 12. Internet & Ad Hoc Service Discovery. Resource Discovery in the Internet. Service Location Protocol (SLP) Architecture. SLPv2 Packet Format. Jini. Salutation Protocol. Simple Service Discovery Protocol (SSDP). Service Discovery for Ad Hoc. Ad Hoc Service Location Architectures. Conclusions. 13. BLUETOOTH TECHNOLOGY. Bluetooth Specifications. Bluetooth Architectures. Bluetooth Protocols. Bluetooth Service Discovery. Bluetooth MAC. Bluetooth Packet Structure. Bluetooth Audio. Bluetooth Addressing. Bluetooth Limitations. Bluetooth Implementation. Conclusions. 14. WIRELESS APPLICATION PROTOCOL (WAP). The WAP Forum. The WAP Service Model. The WAP Protocol Architecture. The WWW Programming Model. The WAP Programming Model. Conclusions. 15. Ad Hoc Nomadic Mobile Applications. In the Office. While Traveling. Arriving Home. In the Car. Shopping Malls. The Modern Battlefield. Car-to-Car Mobile Communications. Mobile Collaborative Applications. Location/Context Based Mobile Services. Conclusions. 16. Conclusions and The Future. Pervasive Computing. Motorola PIANO Project. UC Berkeley Sensor Networks: Smart Dust. EPFL Terminodes/Large-Scale Networks. 802.15 PANs and 802.16 Wireless MANs. Ad Hoc Everywhere? Glossary of Terms. References. Index.
1,135 citations
07 Nov 2002
TL;DR: Simulations show that adding gossiping to AODV results in significant performance improvement, even in networks as small as 150 nodes, and it is expected that the improvement should be even more significant in larger networks.
Abstract: Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fraction of the nodes gets the message. The fraction of executions in which most nodes get the message depends on the gossiping probability and the topology of the network. In the networks we have considered, using gossiping probability between 0.6 and 0.8 suffices to ensure that almost every node gets the message in almost every execution. For large networks, this simple gossiping protocol uses up to 35% fewer messages than flooding, with improved performance. Gossiping can also be combined with various optimizations of flooding to yield further benefits. Simulations show that adding gossiping to AODV results in significant performance improvement, even in networks as small as 150 nodes. We expect that the improvement should be even more significant in larger networks.
919 citations
28 Sep 2002
TL;DR: In this paper, the authors consider the problem of incorporating security mechanisms into routing protocols for ad hoc networks and develop a security mechanism to protect AODV routing information, which is also applicable to other similar routing protocols and about how a key management scheme could be used in conjunction with the solution.
Abstract: We consider the problem of incorporating security mechanisms into routing protocols for ad hoc networks. Canned security solutions like IPSec are not applicable. We look at AODV[21] in detail and develop a security mechanism to protect its routing information. We also briefly discuss whether our techniques would also be applicable to other similar routing protocols and about how a key management scheme could be used in conjunction with the solution that we provide.
809 citations
TL;DR: The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs.
Abstract: The growing interest in mobile ad hoc network techniques has resulted in many routing protocol proposals. Scalability issues in ad hoc networks are attracting increasing attention these days. We survey the routing protocols that address scalability. The routing protocols included in the survey fall into three categories: flat routing protocols; hierarchical routing approaches; GPS augmented geographical routing schemes. The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs.
779 citations
TL;DR: On-Demand Multicast Routing Protocol (ODMRP) is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained.
Abstract: An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile and hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept; only a subset of nodes forwards the multicast packets via scoped flooding. It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.
779 citations
23 Jun 2002
TL;DR: In simulations the QoS routing protocol produces higher throughput and lower delay than its best-effort counterpart and an efficient algorithm for calculating the end-to-end bandwidth on a path is developed and used together with the route discovery mechanism of AODV to setup QoS routes.
Abstract: A quality-of-service (QoS) routing protocol is developed for mobile ad hoc networks. It can establish QoS routes with reserved bandwidth on a per flow basis in a network employing TDMA. An efficient algorithm for calculating the end-to-end bandwidth on a path is developed and used together with the route discovery mechanism of AODV to setup QoS routes. In our simulations the QoS routing protocol produces higher throughput and lower delay than its best-effort counterpart.
395 citations
TL;DR: An overview of different approaches to provide security features to routing protocols in mobile ad hoc networks (MANET) is given and Secure AODV is described giving a summary of its operation and talking about future enhancements to the protocol.
Abstract: This article gives an overview of different approaches to provide security features to routing protocols in mobile ad hoc networks (MANET). It also describes Secure AODV (an extension to AODV that provides security features) giving a summary of its operation and talking about future enhancements to the protocol.
376 citations
TL;DR: Performance comparison of AOMDV with AODV using ns-2 simulations under varying node speeds shows that AomDV provides a factor of two improvement in delay and about 20% reduction in routing overhead, while having similar packet delivery fraction.
Abstract: We present AOMDV, an on-demand multipath distance vector protocol for mobile ad hoc networks. AOMDV is based on a prominent on-demand single path protocol called AODV. AOMDV establishes multiple loop-free and link-disjoint paths. Performance comparison of AOMDV with AODV using ns-2 simulations under varying node speeds shows that AOMDV provides a factor of two improvement in delay and about 20% reduction in routing overhead, while having similar packet delivery fraction.
TL;DR: This dissertation aims to provide a history of computer science and information engineering in Taiwan from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year of independence from China.
Abstract: 1Department of Electrical Engineering, Chang Gung University, Tao-Yuan, 333, Taiwan 2Department of Computer Science and Information Engineering, National Chiao-Tung University, Hsin-Chu, 300, Taiwan 3Department of Computer Science and Information Engineering, National Central University, Chung-Li, 32054, Taiwan Email: slwu@mail.cgu.edu.tw, yctseng@csie.nctu.edu.tw, neel@csie.ncu.edu.tw, sheujp@csie.ncu.edu.tw
28 Sep 2002
TL;DR: Concentrating on AODV, this work explores the issue of neighbor sensing with broadcast messages introducing "communication gray zones", and evaluates three different techniques to overcome the gray zone problem.
Abstract: Our experiments with IEEE 802.11b based wireless ad hoc networks show that neighbor sensing with broadcast messages introduces "communication gray zones": in such zones data messages cannot be exchanged although the HELLO messages indicate neighbor reachability. This leads to a systematic mismatch between the route state and the real world connectivity, resulting in disruptive behavior for multi-media data transfer over ad hoc routing protocols. Concentrating on AODV we explore this issue and evaluate three different techniques to overcome the gray zone problem. We present quantitative measurements of these improvements and discuss the consequences for ad hoc routing protocols and their implementations.
TL;DR: This work presents a method for enabling the cooperation of Mobile IP and the Ad hoc On-Demand Distance Vector routing protocol, such that mobile nodes that are not within direct transmission range of a foreign agent can still obtain Internet connectivity.
Abstract: The growing deployment rate of wireless LANs indicates that wireless networking is rapidly becoming a prevalent form of communication. As users become more accustomed to the use of mobile devices, they increasingly want the additional benefit of roaming. The Mobile IP protocol has been developed as a solution for allowing users to roam outside of their home networks while still retaining network connectivity. The problem with this solution, however, is that the deployment of foreign agents is expensive because their coverage areas are limited due to fading and interference. To reduce the number of foreign agents needed while still maintaining the same coverage, ad hoc network functionality can cooperate with Mobile IP such that multihop routes between mobile nodes and foreign agents can be utilized. In this work, we present a method for enabling the cooperation of Mobile IP and the Ad hoc On-Demand Distance Vector (AODV) routing protocol, such that mobile nodes that are not within direct transmission range of a foreign agent can still obtain Internet connectivity. In addition, we describe how duplicate address detection can be used in these networks to obtain a unique co-located care-of address when a foreign agent is not available.
28 Sep 2002
TL;DR: In this article, a unified network-layer security solution in ad hoc networks is presented, which protects both routing and packet forwarding functionalities in the context of the AODV protocol.
Abstract: Protecting the network layer in a mobile ad hoc network is an important research topic in wireless security. This paper describes our unified network-layer security solution in ad hoc networks, which protects both routing and packet forwarding functionalities in the context of the AODV protocol. To address the unique characteristics of ad hoc networks, we take a self-organized approach by exploiting full localized design, without assuming any a priori trust or secret association between nodes. In our design, each node has a token in order to participate in the network operations, and its local neighbors collaboratively monitor it to detect any misbehavior in routing or packet forwarding services. Upon expiration of the token, each node renews its token via its multiple neighbors. The period of the validity of a node's token is dependent on how long it has stayed and behaved well in the network. A well-behaving node accumulates its credit and renews its token less and less frequently as time evolves. In essence, our security solution exploits collaboration among local nodes to protect the network layer without completely trusting any individual node.
14 Apr 2002
TL;DR: This paper analyzed three commonly used ad hoc network routing protocols, DSDV, DSR and AODV with both a random walk-based and graph-based mobility model and showed that the spatial constraints have a strong impact on the performance of ad hoc routing protocols.
Abstract: Imagine a world where people constantly try to pass through walls and cars suddenly leave the roads and drive into rivers. Although this is unrealistic, most simulations for mobile ad hoc networks so far are based on the so called "random walk" of mobile objects, which are not constrained by their surrounding spatial environments. In this paper we propose a novel graph-based mobility model, which provides a more realistic movement than the random walk model by reflecting the spatial constraints in the real world. We analyzed three commonly used ad hoc network routing protocols, DSDV, DSR and AODV with both a random walk-based and our graph-based mobility model. Our simulation results show that the spatial constraints have a strong impact on the performance of ad hoc routing protocols.
01 Jan 2002
TL;DR: A simulation study that identifies security issues that are specific to MANET and that illustrates the effects of those threats on network performance when the DSR routing protocol is used, showing that security issues have to be taken into account at the early stages of a routing protocol design.
Abstract: The area of ad hoc networking has been receiving increasing attention among researchers in recent years and a variety of routing protocols targeted specifically at the ad hoc networking environment have been proposed. However, little information about the effects of security exposures in terms of network performance has previously been available. This paper provides a simulation study that identifies security issues that are specific to MANET and that illustrate the effects of those threats on network performance when the DSR routing protocol is used. We focused our attention on the evaluation of network performance in terms of global throughput and delay of a mobile ad hoc network where a defined percentage of nodes behaved selfishly. The simulation study brought up two important conclusions. First, it shows that security issues have to be taken into account at the early stages of a routing protocol design. Indeed, when no countermeasures are taken, the simulation results showed that network operation and maintenance can be easily jeopardized and network performance will severely degrade. Second, a cooperative security scheme seems to be a reasonable solution to the selfishness problem: a selfish behavior can be detected through the collaboration between a number of nodes assuming that a majority of nodes do not misbehave.
TL;DR: This work shows how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols, and develops verification techniques suited to routing protocols generally.
Abstract: We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: correctness of the RIP standard, a sharp real-time bound on RIP stability, and preservation of loop-freedom in AODV, a distance vector protocol for wireless networks. We develop verification techniques suited to routing protocols generally. These case studies show significant benefits from automated support in reduced verification workload and assistance in finding new insights and gaps for standard specifications.
16 Dec 2002
TL;DR: This paper uses an implementation of the ad hoc on-demand distance vector (AODV) routing protocol to examine the effectiveness of hello messages for monitoring link status and experimentally evaluates a variety of approaches for improving the accuracy ofHello messages as an indicator of local connectivity.
Abstract: Future wireless applications will take advantage of rapidly deployable, self-configuring multihop ad hoc networks. Because of the difficulty of obtaining IEEE 802.11 feedback about link connectivity in real networks, many multihop ad hoc networks utilize hello messages to determine local connectivity. The paper uses an implementation of the ad hoc on-demand distance vector (AODV) routing protocol to examine the effectiveness of hello messages for monitoring link status. Our study determines that many factors influence the utility of hello messages, including allowed hello message loss settings, discrepancy between data and hello message size and 802.11b packet handling. The paper examines these factors and experimentally evaluates a variety of approaches for improving the accuracy of hello messages as an indicator of local connectivity.
07 Aug 2002
TL;DR: In this evaluation, one proactive protocol proved to have the best performance overall and the main input parameter associated with this protocol is evaluated for optimal performance.
Abstract: In previous years, many location based routing protocols have been developed for ad hoc networks. Some of these protocols assume a location service exists which provides location information on all the mobile nodes in the network. We evaluate three location service alternatives. One is a reactive protocol; the other two are proactive protocols. Of the proactive protocols, one sends location tables to neighbors and the other sends location information to all nodes. In our evaluation, one proactive protocol proved to have the best performance overall. Thus, we also evaluate the main input parameter associated with this protocol for optimal performance.
17 Nov 2002
TL;DR: Through extensive simulations in this paper it is proved that the proposed Ant-AODV hybrid routing technique, is able to achieve reduced end-to-end delay compared to conventional ant-based and AODV routing protocols.
Abstract: A novel routing scheme for mobile ad hoc networks (MANETs), which combines the on-demand routing capability of Ad Hoc On-Demand Distance Vector (AODV) routing protocol with a distributed topology discovery mechanism using ant-like mobile agents is proposed in this paper. The proposed hybrid protocol reduces route discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the one side the proactive routing protocols in MANETs like Destination Sequenced Distance Vector (DSDV) require to know, the topology of the entire network. Hence they are not suitable for highly dynamic networks such as MANETs, since the topology update information needs to be propagated frequently throughout the network. These frequent broadcasts limit the available network capacity for actual data communication. On the other hand, on-demand, reactive routing schemes like AODV and Dynamic Source Routing (DSR), require the actual transmission of the data to be delayed until the route is discovered. Due to this long delay a pure reactive routing protocol may not be applicable for real-time data and multimedia communication. Through extensive simulations in this paper it is proved that the proposed Ant-AODV hybrid routing technique, is able to achieve reduced end-to-end delay compared to conventional ant-based and AODV routing protocols.
07 Oct 2002
TL;DR: A new heterogeneous routing protocol specifically designed for the hierarchical ad hoc network is proposed and a new active clustering scheme is presented to help build a stable hierarchical structure, which is fundamental toheterogeneous routing protocols.
Abstract: A mobile ad hoc network (MANET) is usually assumed to be homogeneous, where each mobile node shares the same radio capacity. However, a homogeneous ad hoc network suffers from poor scalability. Research has demonstrated its performance bottleneck both theoretically and through simulation experiments. Building a physically hierarchical ad hoc network is a very promising way to achieve scalability. Routing is critical to operate such a hierarchical structure efficiently. Previous research has been solely focusing on extending popular routing schemes developed for the homogeneous ad hoc network. We propose a new heterogeneous routing protocol specifically designed for the hierarchical ad hoc network. We also present a new active clustering scheme to help build a stable hierarchical structure, which is fundamental to heterogeneous routing protocols. Simulation results using GloMoSim show that our routing and clustering scheme gives good performance. The results also provide some insight into new possible designs of routing protocols and mobile network architectures for MANETs when large scale is desired.
Journal Article•
TL;DR: Simulations show that incorporating TCP proxies is beneficial in terms of improving TCP performance in ad hoc networks, and the use of proxies improves the total throughput by as much as 30% in typical scenarios and reduces unfairness significantly.
Abstract: The fairness and throughput of TCP suffer when it is used in mobile ad hoc networks. This is because TCP wrongly attributes packet losses due to link failures (a consequence of mobility) to congestion. The resulting overall degradation of throughput especially affects connections with a large number of hops, where link failures are more likely; thus, short connections enjoy an unfair advantage. Furthermore, if the IEEE 802.11 MAC protocol is used, the problems are exacerbated due to the protocol-induced capture effect, leading to greater unfairness and a further throughput degradation. We develop a scheme, called split TCP, which separates the TCP functions of congestion control and reliable packet delivery. For any TCP connection, certain nodes along the route take up the role of being proxies for that connection. The proxies buffer packets upon receipt and administer rate control. The buffering enables dropped packets to be recovered from the most recent proxy. The rate control helps in controlling congestion on inter-proxy segments. Thus, we emulate shorter TCP connections and can thereby achieve better parallelism in the network. Simulations show that the use of proxies improves the total throughput by as much as 30% in typical scenarios and reduces unfairness significantly. In terms of an unfairness metric that we introduce, the unfairness decreases from 0.8 to 0.2 (1.0 being the maximum unfairness). We conclude that incorporating TCP proxies is beneficial in terms of improving TCP performance in ad hoc networks.
07 Nov 2002
TL;DR: HSLS is an scalable, easy-to-implement, alternative to hierarchical approaches for large ad hoc networks, and provides deeper understanding of the limits and trade-offs inherent in mobile ad hoc network routing.
Abstract: A novel framework is presented for the study of scalability in ad hoc networks. Using this framework, the first asymptotic analysis is provided with respect to network size, mobility, and traffic for each fundamental class of ad hoc routing algorithms. Protocols studied include the following: plain flooding (PF), standard link state (SLS), dynamic source routing (DSR), hierarchical link state (HierLS), zone routing protocol (ZRP), and hazy sighted link state (HSLS). It is shown that PF and ZRP scale better with mobility, SIJS and ZRP scale better with respect to traffic, and HSLS scales better with respect to network size. The analysis provides deeper understanding of the limits and trade-offs inherent in mobile ad hoc network routing. Our analysis is complemented with a simulation experiment comparing HSLS and HierLS. An important contribution of this paper is that HSLS is an scalable, easy-to-implement, alternative to hierarchical approaches for large ad hoc networks.
Proceedings Article•
04 Sep 2002
TL;DR: The Optimized Link State Routing Protocol (OLSR), a proactive routing protocol for Mobile Ad-hoc NETworks (MANETs) is described and its performance is evaluated through exhaustive simulations using the Network Simulator 2 (ns2).
Abstract: In this paper, we describe the Optimized Link State Routing Protocol (OLSR), a proactive routing protocol for Mobile Ad-hoc NETworks (MANETs). We evaluate its performance through exhaustive simulations using the Network Simulator 2 (ns2), and compare with other ad-hoc protocols, specifically the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and the Dynamic Source Routing (DSR) protocol. We study the protocols under varying conditions (node mobility, network density) and with varying traffic (TCP, UDP, different number of connections/streams) to provide a qualitative assessment of the applicability of the protocols in different scenarios.
01 Jan 2002
TL;DR: This paper introduces a novel clustering scheme, call Passive Clustering that can reduce the redundant rebroadcast effect in flooding and demonstrates the efficiency of the proposed scheme in the AODV (Ad hoc, On demand Distance Vector) routing scheme.
Abstract: An ad hoc network is a fast deployable self-configuring wireless network characterized by node mobility, dynamic topology structure, unreliable media and limited power supply. Nodes in an ad hoc network must cooperate and carry out a distributed routing protocol in order to make multi-hop communications possible. On Demand Routing is one of the most popular routing styles in ad hoc networks. In On Demand Routing, "flooding" is used to find a feasible route from source to destination. The function of flooding is to deliver a packet from one source to every other node in the system. Conventional flooding can be very costly in On Demand networks in terms of network throughput efficiency as well as node energy consumption. The main reason is that the same packet is rebroadcast unnecessarily several times (redundant rebroadcast). Indeed, the penalty of redundant rebroadcast increases when the size of network grows and the density of network increases. In this paper we introduce a novel clustering scheme, call Passive Clustering that can reduce the redundant rebroadcast effect in flooding. We demonstrate the efficiency of the proposed scheme in the AODV (Ad hoc, On demand Distance Vector) routing scheme.
01 Jul 2002
TL;DR: In this paper, the authors identify three different environments with distinct security requirements and propose a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected.
Abstract: Text of abstract Most recent ad hoc network research has focused on providing routing services without considering security In this paper, we detail security threats against ad hoc routing protocols, specifically examining AODV and DSR In light of these threats, we identify three different environments with distinct security requirements We propose a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected Our protocol, ARAN, is based on certificates and successfully defeats all identified attacks