The Experts below are selected from a list of 103983 Experts worldwide ranked by ideXlab platform

David B Johnson - One of the best experts on this subject based on the ideXlab platform.

  • rushing attacks and defense in wireless Ad Hoc Network routing protocols
    Workshop on Wireless Security, 2003
    Co-Authors: Yihchun Hu, Adrian Perrig, David B Johnson
    Abstract:

    In an Ad Hoc Network, mobile computers (or nodes) cooperate to forward packets for each other, allowing nodes to communicate beyond their direct wireless transmission range. Many of the proposed routing protocols for Ad Hoc Networks operate in an on-demand fashion, as on-demand routing protocols have been shown to often have lower overheAd and faster reaction time than other types of routing based on periodic (proactive) mechanisms. Significant attention recently has been devoted to developing secure routing protocols for Ad~Hoc Networks, including a number of secure on-demand routing protocols, that defend against a variety of possible attacks on Network routing. In this paper, we present the rushing attack, a new attack that results in denial-of-service when used against all previous on-demand Ad~Hoc Network routing protocols. For example, DSR, AODV, and secure protocols based on them, such as AriAdne, ARAN, and SAODV, are unable to discover routes longer than two hops when subject to this attack. This attack is also particularly damaging because it can be performed by a relatively weak attacker. We analyze why previous protocols fail under this attack. We then develop Rushing Attack Prevention (RAP), a generic defense against the rushing attack for on-demand protocols. RAP incurs no cost unless the underlying protocol fails to find a working route, and it provides provable security properties even against the strongest rushing attackers.

  • ensuring cache freshness in on demand Ad Hoc Network routing protocols
    Proceedings of the second ACM international workshop on Principles of mobile computing, 2002
    Co-Authors: Yihchun Hu, David B Johnson
    Abstract:

    In a wireless Ad Hoc Network, nodes cooperate to forward packets for each other over possibly multi-hop paths, to allow nodes not within direct wireless transmission range to communicate. Many routing protocols have been proposed for the Ad Hoc Network environment, several of which operate on-demand and utilize a route cache listing links that this node has learned. In such protocols, aggressive caching of overheard routes can significantly improve performance; in particular, overheAd can be reduced by leverag-ing information received in packets overheard or forwarded from other nodes, including other routing packets and the source routes on other data packets. Unfortunately, such information sharing can substantially increase the risk of cache cross-pollution, since stale routing information in one node's cache, representing a link that no longer exists, can easily be Added into the caches of other nodes. Even when a node has actually learned that a link no longer exists, it is still possible for that node to again hear the stale information. In this paper, we present a new mechanism which we call epoch numbers, to reduce this problem of cache staleness, by preventing the re-learning of stale knowledge of a link after having earlier heard that the link has broken. Our scheme does not rely on Ad Hoc mechanisms such as short-lived negative caching; rather, we allow a node having heard both of a broken link and a discovery of the same link to sequence the two events in order to determine whether the link break or the link discovery occurred before the other.

  • lessons from a full scale multihop wireless Ad Hoc Network testbed
    IEEE Personal Communications, 2001
    Co-Authors: David A Maltz, J Broch, David B Johnson
    Abstract:

    This article describes our experiences building a multihop wireless Ad Hoc Network of eight nodes driving around a 700 m by 300 m site. Each node runs the dynamic source routing protocol and interfaces seamlessly with existing Internet infrastructure and the Mobile IP protocol. We present quantitative results from data collected during runs of our testbed under a composite workloAd including voice, bulk data, and real-time data. Based on careful analysis of our data, we highlight rAdio propagation issues that Network protocols will need to Address in the future.

  • quantitative lessons from a full scale multi hop wireless Ad Hoc Network testbed
    Wireless Communications and Networking Conference, 2000
    Co-Authors: David A Maltz, J Broch, David B Johnson
    Abstract:

    This paper presents preliminary quantitative results from data collected during runs of our multi-hop wireless Ad Hoc Network testbed. The Network successfully carried a composite workloAd including voice, bulk data, and real-time data. Careful analysis of recorded runs highlights rAdio propagation issues that Network protocols will need to Address in the future.

  • experiences designing and building a multi hop wireless Ad Hoc Network testbed
    1999
    Co-Authors: David A Maltz, J Broch, David B Johnson
    Abstract:

    Abstract : In this paper, we describe our experiences building a multi-hop wireless Ad Hoc Network of 8 nodes driving around a 700 m by 300 m site. Each node runs the Dynamic Source Routing (DSR) protocol and interfaces seamlessly with existing Internet infrastructure and the Mobile IP protocol. The issues discussed in this paper range from logistical and management issues, to protocol design and performance analysis issues. We also present an early characterization of the testbed performance, and describe a significant new challenge for Ad Hoc Network routing protocols. The major goal of the paper, however, is to share our experiences, in the belief that they may be useful to others who attempt to build other Ad Hoc Network testbeds.

David A Maltz - One of the best experts on this subject based on the ideXlab platform.

  • lessons from a full scale multihop wireless Ad Hoc Network testbed
    IEEE Personal Communications, 2001
    Co-Authors: David A Maltz, J Broch, David B Johnson
    Abstract:

    This article describes our experiences building a multihop wireless Ad Hoc Network of eight nodes driving around a 700 m by 300 m site. Each node runs the dynamic source routing protocol and interfaces seamlessly with existing Internet infrastructure and the Mobile IP protocol. We present quantitative results from data collected during runs of our testbed under a composite workloAd including voice, bulk data, and real-time data. Based on careful analysis of our data, we highlight rAdio propagation issues that Network protocols will need to Address in the future.

  • quantitative lessons from a full scale multi hop wireless Ad Hoc Network testbed
    Wireless Communications and Networking Conference, 2000
    Co-Authors: David A Maltz, J Broch, David B Johnson
    Abstract:

    This paper presents preliminary quantitative results from data collected during runs of our multi-hop wireless Ad Hoc Network testbed. The Network successfully carried a composite workloAd including voice, bulk data, and real-time data. Careful analysis of recorded runs highlights rAdio propagation issues that Network protocols will need to Address in the future.

  • experiences designing and building a multi hop wireless Ad Hoc Network testbed
    1999
    Co-Authors: David A Maltz, J Broch, David B Johnson
    Abstract:

    Abstract : In this paper, we describe our experiences building a multi-hop wireless Ad Hoc Network of 8 nodes driving around a 700 m by 300 m site. Each node runs the Dynamic Source Routing (DSR) protocol and interfaces seamlessly with existing Internet infrastructure and the Mobile IP protocol. The issues discussed in this paper range from logistical and management issues, to protocol design and performance analysis issues. We also present an early characterization of the testbed performance, and describe a significant new challenge for Ad Hoc Network routing protocols. The major goal of the paper, however, is to share our experiences, in the belief that they may be useful to others who attempt to build other Ad Hoc Network testbeds.

Qian Songrong - One of the best experts on this subject based on the ideXlab platform.

J Broch - One of the best experts on this subject based on the ideXlab platform.

  • lessons from a full scale multihop wireless Ad Hoc Network testbed
    IEEE Personal Communications, 2001
    Co-Authors: David A Maltz, J Broch, David B Johnson
    Abstract:

    This article describes our experiences building a multihop wireless Ad Hoc Network of eight nodes driving around a 700 m by 300 m site. Each node runs the dynamic source routing protocol and interfaces seamlessly with existing Internet infrastructure and the Mobile IP protocol. We present quantitative results from data collected during runs of our testbed under a composite workloAd including voice, bulk data, and real-time data. Based on careful analysis of our data, we highlight rAdio propagation issues that Network protocols will need to Address in the future.

  • quantitative lessons from a full scale multi hop wireless Ad Hoc Network testbed
    Wireless Communications and Networking Conference, 2000
    Co-Authors: David A Maltz, J Broch, David B Johnson
    Abstract:

    This paper presents preliminary quantitative results from data collected during runs of our multi-hop wireless Ad Hoc Network testbed. The Network successfully carried a composite workloAd including voice, bulk data, and real-time data. Careful analysis of recorded runs highlights rAdio propagation issues that Network protocols will need to Address in the future.

  • experiences designing and building a multi hop wireless Ad Hoc Network testbed
    1999
    Co-Authors: David A Maltz, J Broch, David B Johnson
    Abstract:

    Abstract : In this paper, we describe our experiences building a multi-hop wireless Ad Hoc Network of 8 nodes driving around a 700 m by 300 m site. Each node runs the Dynamic Source Routing (DSR) protocol and interfaces seamlessly with existing Internet infrastructure and the Mobile IP protocol. The issues discussed in this paper range from logistical and management issues, to protocol design and performance analysis issues. We also present an early characterization of the testbed performance, and describe a significant new challenge for Ad Hoc Network routing protocols. The major goal of the paper, however, is to share our experiences, in the belief that they may be useful to others who attempt to build other Ad Hoc Network testbeds.

Michael J Neely - One of the best experts on this subject based on the ideXlab platform.

  • Network capacity region and minimum energy function for a delay tolerant mobile Ad Hoc Network
    IEEE ACM Transactions on Networking, 2011
    Co-Authors: Rahul Urgaonkar, Michael J Neely
    Abstract:

    We investigate two quantities of interest in a delay-tolerant mobile Ad Hoc Network: the Network capacity region and the minimum energy function. The Network capacity region is defined as the set of all input rates that the Network can stably support considering all possible scheduling and routing algorithms. Given any input rate vector in this region, the minimum energy function establishes the minimum time-average power required to support it. In this paper, we consider a cell-partitioned model of a delay-tolerant mobile Ad Hoc Network with general Markovian mobility. This simple model incorporates the essential features of locality of wireless transmissions as well as node mobility and enables us to exactly compute the corresponding Network capacity and minimum energy function. Furthermore, we propose simple schemes that offer performance guarantees that are arbitrarily close to these bounds at the cost of an increased delay.

  • Network capacity region and minimum energy function for a delay tolerant mobile Ad Hoc Network
    arXiv: Networking and Internet Architecture, 2011
    Co-Authors: Rahul Urgaonkar, Michael J Neely
    Abstract:

    We investigate two quantities of interest in a delay-tolerant mobile Ad Hoc Network: the Network capacity region and the minimum energy function. The Network capacity region is defined as the set of all input rates that the Network can stably support considering all possible scheduling and routing algorithms. Given any input rate vector in this region, the minimum energy function establishes the minimum time average power required to support it. In this work, we consider a cell-partitioned model of a delay-tolerant mobile Ad Hoc Network with general Markovian mobility. This simple model incorporates the essential features of locality of wireless transmissions as well as node mobility and enables us to exactly compute the corresponding Network capacity and minimum energy function. Further, we propose simple schemes that offer performance guarantees that are arbitrarily close to these bounds at the cost of an increased delay.