Showing papers on "Wireless Routing Protocol published in 2002"

Ariadne: a secure on-demand routing protocol for ad hoc 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.

A secure routing protocol for ad hoc networks

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.

Performance analysis of the CONFIDANT protocol

Abstract: Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However,it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive; it is based on selective altruism and utilitarianism. It aims at detecting and isolating misbehaving nodes, thus making it unattractive to deny cooperation. Trust relationships and routing decisions are based on experienced, observed, or reported routing and forwarding behavior of other nodes. The detailed implementation of CONFIDANT in this paper assumes that the network layer is based on the Dynamic Source Routing (DSR) protocol. We present a performance analysis of DSR fortified by CONFIDANT and compare it to regular defenseless DSR. It shows that a network with CONFIDANT and up to 60% of misbehaving nodes behaves almost as well as a benign network, in sharp contrast to a defenseless network. All simulations have been implemented and performed in GloMoSim.

Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks

Abstract: Future sensor networks will be composed of a large number of densely deployed sensors/actuators. A key feature of such networks is that their nodes are untethered and unattended. Consequently, energy efficiency is an important design consideration for these networks. Motivated by the fact that sensor network queries may often be geographical, we design and evaluate an energy efficient routing algorithm that propagates a query to the appropriate geographical region, without flooding. The proposed Geographic and Energy Aware Routing (GEAR) algorithm uses energy aware neighbor selection to route a packet towards the target region and Recursive Geographic Forwarding or Restricted Flooding algorithm to disseminate the packet inside the destina-

APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless

Abstract: Wireless sensor networks with thousands of tiny sensor nodes, are expected to find wide applicability and increasing deployment in coming years, as they enable reliable monitoring and analysis of the environment. In this paper, we propose a hybrid routing protocol (APTEEN) which allows for comprehensive information retrieval. The nodes in such a network not only react to time-critical situations, but also give an overall picture of the network at periodic intervals in a very energy efficient manner. Such a network enables the user to request past, present and future data from the network in the form of historical, one-time and persistent queries respectively. We evaluated the performance of these protocols and observe that these protocols are observed to outperform existing protocols in terms of energy consumption and longevity of the network.

Performance Analysis of the CONFIDANT Protocol: Cooperation Of Nodes - Fairness In Dynamic Ad-hoc NeTworks

Abstract: Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive; it is based on selective altruism and utilitarianism. It aims at detecting and isolating misbehaving nodes, thus making it unattractive to deny cooperation. Trust relationships and routing decisions are based on experienced, observed, or reported routing and forwarding behavior of other nodes. The detailed implementation of CONFIDANT in this paper assumes that the network layer is based on the Dynamic Source Routing (DSR) protocol. We present a performance analysis of DSR fortified by CONFIDANT and compare it to regular defenseless DSR. It shows that a network with CONFIDANT and up to 60% of misbehaving nodes behaves almost as well as a benign network, in sharp contrast to a defenseless network. All simulations have been implemented and performed in GloMoSim.

Ad hoc mobile wireless networks : protocols and systems

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.

SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks

Abstract: An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. We design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance-Vector routing protocol (DSDV). In order to support use with nodes of limited CPU processing capability, and to guard against denial-of-service (DoS) attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.

Routing security in wireless ad hoc networks

Abstract: A mobile ad hoc network consists of a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. MANET is an emerging research area with practical applications. However, wireless MANET is particularly vulnerable due to its fundamental characteristics, such as open medium, dynamic topology, distributed cooperation, and constrained capability. Routing plays an important role in the security of the entire network. In general, routing security in wireless MANETs appears to be a problem that is not trivial to solve. In this article we study the routing security issues of MANETs, and analyze in detail one type of attack-the "black hole" problem-that can easily be employed against the MANETs. We also propose a solution for the black hole problem for ad hoc on-demand distance vector routing protocol.

Securing ad hoc routing protocols

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.

Power Control in Ad-Hoc Networks : Theory, Architecture Algorithm and Implementation of the COMPOW protocol

Abstract: We present a new protocol for power control in ad hoc networks. We describe the issues in conceptualizing the power control problem, and provide an architecturally simple as well as theoretically well founded solution. The solution is shown to simultaneously satisfy the three objectives of maximizing the traffic carrying capacity of the entire network, extending battery life through providing low power routes, and reducing the contention at the MAC layer. Further, the protocol has the plug and play feature that it can be employed in conjunction with any routing protocol that pro-actively maintains a routing table. The protocol, called COMPOW, has been implemented in the Linux kernel and we describe the software architecture and implementation details.

Scalable routing protocols for mobile ad hoc networks

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.

Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks

Abstract: This paper describes two novel techniques, information-driven sensor querying IDSQ and constrained anisotropic diffusion routing CADR, for energy-efficient data querying and routing in ad hoc sensor networks for a range of collaborative signal processing tasks. The key idea is to introduce an information utility measure to select which sensors to query and to dynamically guide data routing. This allows us to maximize information gain while minimizing detection latency and bandwidth consumption for tasks such as localization and tracking. Our simulation results have demonstrated that the information-driven querying and routing techniques are more energy efficient, have lower detection latency, and provide anytime algorithms to mitigate risks of link/node failures.

Position-based routing in ad hoc networks

Abstract: The 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 previously. This tutorial will concentrate on schemes that are loop-free, localized, and follow a single-path strategy, which are desirable characteristics for scalable routing protocols. Routing protocols have two modes: greedy mode (when the forwarding node is able to advance the message toward the destination) and recovery mode (applied until return to greedy mode is possible). We discuss them separately. Methods also differ in metrics used (hop count, power, cost, congestion, etc.), and in past traffic memorization at nodes (memoryless or memorizing past traffic). Salient properties to be emphasized in this review are guaranteed delivery, scalability, and robustness.

ARA-the ant-colony based routing algorithm for MANETs

Abstract: A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new on-demand routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence and especially on the ant colony based meta heuristic. These approaches try to map the solution capability of swarms to mathematical and engineering problems. The introduced routing protocol is highly adaptive, efficient and scalable. The main goal in the design of the protocol was to reduce the overhead for routing. We refer to the protocol as the ant-colony-based routing algorithm (ARA).

Modelling Data-Centric Routing in Wireless Sensor Networks

Abstract: Sensor networks differ from traditional net- works in several ways: sensor networks have severe en- ergy constraints, redundant low-rate data, and many-to-one flows. The end-to-end routing schemes that have been pro- posed in the literature for mobile ad-hoc networks are not appropriate under these settings. Data-centric technologies are needed that perform in-network aggregation of data to yield energy-efficient dissemination. In this paper we model data-centric routing and compare its performance with tra- ditional end-to-end routing schemes. We examine the im- pact of source-destination placement and communication network density on the energy costs, delay, and robustness of data aggregation. We show that data-centric routing offers significant performance gains across a wide range of opera- tional scenarios.

Secure Routing for Mobile Ad Hoc Networks

Abstract: The emergence of the Mobile Ad Hoc Networking (MANET) technology advocates self-organized wireless interconnection of communication devices that would either extend or operate in concert with the w ...

An on-demand secure routing protocol resilient to byzantine failures

Abstract: An ad hoc wireless network is an autonomous self-organizing system ofmobile nodes connected by wireless links where nodes not in directrange can communicate via intermediate nodes. A common technique usedin routing protocols for ad hoc wireless networks is to establish therouting paths on-demand, as opposed to continually maintaining acomplete routing table. A significant concern in routing is theability to function in the presence of byzantine failures whichinclude nodes that drop, modify, or mis-route packets in an attempt todisrupt the routing service.We propose an on-demand routing protocol for ad hoc wireless networks that provides resilience to byzantine failures caused by individual or colluding nodes. Our adaptive probing technique detects a malicious link after log n faults have occurred, where n is the length of the path. These links are then avoided by multiplicatively increasing their weights and by using an on-demand route discovery protocol that finds a least weight path to the destination.

AMRoute: ad hoc multicast routing protocol

Abstract: The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical cores. It creates a bidirectional, shared tree for data distribution using only group senders and receivers as tree nodes. Unicast tunnels are used as tree links to connect neighbors on the user-multicast tree. Thus, AMRoute does not need to be supported by network nodes that are not interested/capable of multicast, and group state cost is incurred only by group senders and receivers. Also, the use of tunnels as tree links implies that tree structure does not need to change even in case of a dynamic network topology, which reduces the signaling traffic and packet loss. Thus AMRoute does not need to track network dynamics; the underlying unicast protocol is solely responsible for this function. AMRoute does not require a specific unicast routing protocol; therefore, it can operate seamlessly over separate domains with different unicast protocols. Certain tree nodes are designated by AMRoute as logical cores, and are responsible for initiating and managing the signaling component of AMRoute, such as detection of group members and tree setup. Logical cores differ significantly from those in CBT and PIM-SM, since they are not a central point for data distribution and can migrate dynamically among member nodes. Simulation results (using ns-2) demonstrate that AMRoute signaling traffic remains at relatively low level for typical group sizes. The results also indicate that group members receive a high proportion of data multicast by senders, even in the case of a highly dynamic network.

Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks

Abstract: Devices in mobile ad hoc networks work as network nodes and relay packets originated by other nodes. Mobile ad hoc networks can work properly only if the participating nodes cooperate in routing and forwarding. For individual nodes it might be advantageous not to cooperate. The new routing protocol extensions presented in this paper make it possible to detect and isolate misbehaving nodes, thus making denying cooperation undesirable. In the presented scheme, trust relationships and routing decisions are made based on experienced, observed, or reported routing and forwarding behavior of other nodes. A hybrid scheme of selective altruism and utilitarianism is presented to strengthen mobile ad hoc network protocols in their resistance to security attacks, while aiming at keeping network throughput high. This paper focuses particularly on the network layer using the dynamic source routing (DSR) protocol as an example.

An access and routing protocol for ad hoc networks using synchronous collision resolution and node state dissemination

Abstract: An ad hoc network organizes itself to provide communications without need for an a priori designated central control mechanism or base stations Such self-organization is challenging in a multihop ad hoc network having member nodes that are highly mobile and widely distributed A Synchronous Collision Resolution (SCR) protocol and a Node State Routing (NSR) protocol are well suited to provide efficient ad hoc network organization SCR is an access protocol that achieves high capacity collision free access using a signaling approach that creates a random cellular-like network after each signaling period NSR is a routing protocol that uses the dissemination of node states to predict link availability and to assign metrics to those links for the creation of optimized routes In use, the present invention provides quality of service and supports energy conservation for the mobile nodes

QoS routing for mobile ad hoc networks

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.

Secure ad hoc on-demand distance vector routing

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.

Ad hoc on-demand multipath distance vector routing

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.

A Multi-channel MAC Protocol with Power Control for Multi-hop Mobile Ad Hoc Networks

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

RSVP: A New Resource ReSerVation Protocol: Novel design features lead to an Internet protocol that is flexible and scalable.

Abstract: This chapter tries to make the general design of RSVP relatively independent of the architectural components. Clearly, a particular implementation of RSVP is tied quite closely to the flowspec and interfaces used by the routing and admission control algorithms. However, the general protocol design should be independent of these. In particular, the protocol should be capable of establishing reservations across networks that implement different routing algorithms, such as IP unicast routing, IP multicast routing, the recently proposed core based tree (CBT) multicast routing, or some future routing protocols. This design goal makes RSVP deployable in many contexts. For optimally efficient routing decisions, however, routing selection and resource reservation should be integrated—so the choice of route can depend on the quality of service requested, and the stability of the route can be maintained over the duration of the reservation. The first RSVP design is verified by a detailed simulation and preliminary implementation. Much testing remains to be done in the context of larger scale simulations, as well as in real prototype networks, such as DARTnet.

Asymptotically optimal geometric mobile ad-hoc routing

Abstract: In this paper we present AFR, a new geometric mobile ad-hoc routing algorithm The algorithm is completely distributed; nodes need to communicate only with direct neighbors in their transmission range We show that if a best route has cost c, AFR finds a route and terminates with cost O(c2) in the worst case AFR is the first algorithm with cost bounded by a function of the optimal route We also give a tight lower bound by showing that any geometric routing algorithm has worst-case cost $Ogr;(c2) Thus AFR is asymptotically optimal We give a non-geometric algorithm that also matches the lower bound, but needs some memory at each node This establishes an intriguing trade-off between geometry and memory

An on-demand minimum energy routing protocol for a wireless ad hoc network

Abstract: A minimum energy routing protocol reduces the energy consumption of the nodes in a wireless ad hoc network by routing packets on routes that consume the minimum amount of energy to get the packets to their destination. This paper identifies the necessary features of an on-demand minimum energy routing protocol and suggests mechanisms for their implementation. We highlight the importance of efficient caching techniques to store the minimum energy route information and propose the use of an 'energy aware' link cache for storing this information. We compare the performance of an on-demand minimum energy routing protocol in terms of energy savings with an existing on-demand ad hoc routing protocol via simulation. We discuss the implementation of Dynamic Source Routing (DSR) protocol using the Click modular router on a real life test-bed consisting of laptops and wireless Ethernet cards. Finally we describe the modifications we have made to the DSR router to make it energy aware.