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

Mahesh K Marina - One of the best experts on this subject based on the ideXlab platform.

  • ad hoc on demand multipath Distance Vector routing
    Wireless Communications and Mobile Computing, 2006
    Co-Authors: Mahesh K Marina
    Abstract:

    We develop an on-demand, multipath Distance Vector routing protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand Distance Vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath Distance Vector (AOMDV). The protocol guarantees loop freedom and disjointness of alternate paths. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to effectively cope with mobility-induced route failures. In particular, it reduces the packet loss by up to 40% and achieves a remarkable improvement in the end-to-end delay (often more than a factor of two). AOMDV also reduces routing overhead by about 30% by reducing the frequency of route discovery operations. Copyright © 2006 John Wiley & Sons, Ltd.

  • ad hoc on demand multipath Distance Vector routing
    Mobile Computing and Communications Review, 2002
    Co-Authors: Mahesh K Marina
    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.

  • on demand multipath Distance Vector routing in ad hoc networks
    International Conference on Network Protocols, 2001
    Co-Authors: Mahesh K Marina
    Abstract:

    We develop an on-demand multipath Distance Vector protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand Distance Vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath Distance Vector (AOMDV). The protocol computes multiple loop-free and link-disjoint paths. Loop-freedom is guaranteed by using a notion of "advertised hopcount". Link-disjointness of multiple paths is achieved by using a particular property of flooding. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%.

Adrian Perrig - One of the best experts on this subject based on the ideXlab platform.

  • sead secure efficient Distance Vector routing for mobile wireless ad hoc networks
    Ad Hoc Networks, 2003
    Co-Authors: Yihchun Hu, David B Johnson, Adrian Perrig
    Abstract:

    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. In this paper, 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. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service 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.

  • sead secure efficient Distance Vector routing for mobile wireless ad hoc networks
    Ad Hoc Networks, 2003
    Co-Authors: David B Johnson, Adrian Perrig
    Abstract:

    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. In this paper, 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. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service 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.

  • sead secure efficient Distance Vector routing for mobile wireless ad hoc networks
    Workshop on Mobile Computing Systems and Applications, 2002
    Co-Authors: Yihchun Hu, David B Johnson, Adrian Perrig
    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.

  • sead secure efficient Distance Vector routing for mobile wireless ad hoc networks
    Workshop on Mobile Computing Systems and Applications, 2002
    Co-Authors: David B Johnson, Adrian Perrig
    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.

Min Jia - One of the best experts on this subject based on the ideXlab platform.

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

  • sead secure efficient Distance Vector routing for mobile wireless ad hoc networks
    Ad Hoc Networks, 2003
    Co-Authors: Yihchun Hu, David B Johnson, Adrian Perrig
    Abstract:

    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. In this paper, 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. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service 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.

  • sead secure efficient Distance Vector routing for mobile wireless ad hoc networks
    Ad Hoc Networks, 2003
    Co-Authors: David B Johnson, Adrian Perrig
    Abstract:

    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. In this paper, 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. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service 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.

  • sead secure efficient Distance Vector routing for mobile wireless ad hoc networks
    Workshop on Mobile Computing Systems and Applications, 2002
    Co-Authors: Yihchun Hu, David B Johnson, Adrian Perrig
    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.

  • sead secure efficient Distance Vector routing for mobile wireless ad hoc networks
    Workshop on Mobile Computing Systems and Applications, 2002
    Co-Authors: David B Johnson, Adrian Perrig
    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.

Charles E Perkins - One of the best experts on this subject based on the ideXlab platform.

  • ad hoc on demand Distance Vector version 2 aodvv2 routing
    2016
    Co-Authors: Stan Ratliff, Charles E Perkins, John Dowdell, Victoria Mercieca, Lotte Steenbrink
    Abstract:

    The Ad Hoc On-demand Distance Vector Version 2 (AODVv2) routing protocol is intended for use by mobile routers in wireless, multihop networks. AODVv2 determines unicast routes among AODVv2 routers within the network in an on-demand fashion.

  • evolution and future directions of the ad hoc on demand Distance Vector routing protocol
    Ad Hoc Networks, 2003
    Co-Authors: Elizabeth M Beldingroyer, Charles E Perkins
    Abstract:

    The ad hoc on-demand Distance-Vector (AODV) routing protocol has been designed for use in ad hoc networks, which are presently receiving wide interest within many diverse research communities. These networks represent a significant departure from traditional wired networks due to the distinguishing characteristics of both the wireless channel and mobile devices. Consequently, AODV incorporates many novel features for handling mobility, reduced capacity links, and the variable, indeterminate nature of the signaling range of wireless media. Since its initial design, AODV has evolved in a number of ways for improved performance, robustness, and better scalability. Nevertheless, we see many opportunities for continued improvement. This paper describes the current state of AODV, including its base functionality as well as optional features that improve performance and add capabilities. We also offer some direction for the continued evolution of AODV by presenting areas that can be targeted for future enhancements. Many of the described current and planned features are a result of AODVs history and evolution within the Internet engineering task force. � 2003 Elsevier B.V. All rights reserved.

  • quality of service for ad hoc on demand Distance Vector routing
    2001
    Co-Authors: Charles E Perkins, Elizabeth M Beldingroyer
    Abstract:

    The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines routes between source and destination addresses. To provide quality of service, extensions can be added to the messages used during route discovery. These extensions specify the service requirements which must be met by nodes rebroadcasting a Route Request or returning a Route Reply for a destination. This draft describes how service partners discover routes that can satisfy QoS service conditions by using these extensions.

  • multicast operation of the ad hoc on demand Distance Vector routing protocol
    ACM IEEE International Conference on Mobile Computing and Networking, 1999
    Co-Authors: E M Royer, Charles E Perkins
    Abstract:

    An ad-hoc network is the cooperative engagement of a collection of (typically wireless) mobile nodes without the required intervention of any centralized access point or existing infrastructure. To provide optimal communication ability, a routing protocol for such a dynamic self-starting network must be capable of unicast, broadcast, and multicast. In this paper we extend Ad-hoc On-Demand Distance Vector Routing (AODV), an algorithm for the operation of such ad-hoc networks, to offer novel multicast capabilities which follow naturally from the way AODV establishes unicast routes. AODV builds multicast trees as needed (i.e., on-demand) to connect multicast group members. Control of the multicast tree is distributed so that there is no single point of failure. AODV provides loop-free routes for both unicast and multicast, even while repairing broken links. We include an evaluation methodology and simulation results to validate the correct and efficient operation of the AODV algorithm.