Vector Routing Protocol

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

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

Azzedine Boukerche - One of the best experts on this subject based on the ideXlab platform.

  • a performance evaluation of a pre emptive on demand distance Vector Routing Protocol for mobile ad hoc networks research articles
    Communications and Mobile Computing, 2004
    Co-Authors: Azzedine Boukerche, Liqin Zhang
    Abstract:

    Mobile ad hoc networks are useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable and movement of communicating parties is allowed. Therefore, it is not possible to establish a priori and fixed paths for message delivery through the network. Because of their importance, Routing and packets dropped problems, mainly due to the path breaking, are among the most studied problem in mobile and wireles ad hoc networks. Multi-path Protocols can be useful for the purpose of balancing congestion and decreasing the delay, by Routing packets along different paths. However, they may allow only source-based load balancing decisions. In this paper, we present a pre-emptive ad hoc on-demand distance Vector Routing Protocol for mobile and wireless ad hoc networks. We present the algorithm, discuss its implementation and report on the performance results of simulation of several workload models on ns-2. Our results indicate that a scheme based on scheduling a path-discovery routine before the current in-use link breaks is feasible and that such a mechanism can increase the number of packets delivered and decrease the average delay per packet. It also improves the throughput (packet delivered ratio) and balances the traffic between different source–destination pairs. Copyright © 2004 John Wiley & Sons, Ltd.

  • a performance evaluation of a pre emptive on demand distance Vector Routing Protocol for mobile ad hoc networks
    Wireless Communications and Mobile Computing, 2004
    Co-Authors: Azzedine Boukerche, Liqin Zhang
    Abstract:

    Mobile ad hoc networks are useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable and movement of communicating parties is allowed. Therefore, it is not possible to establish a priori and fixed paths for message delivery through the network. Because of their importance, Routing and packets dropped problems, mainly due to the path breaking, are among the most studied problem in mobile and wireles ad hoc networks. Multi-path Protocols can be useful for the purpose of balancing congestion and decreasing the delay, by Routing packets along different paths. However, they may allow only source-based load balancing decisions. In this paper, we present a pre-emptive ad hoc on-demand distance Vector Routing Protocol for mobile and wireless ad hoc networks. We present the algorithm, discuss its implementation and report on the performance results of simulation of several workload models on ns-2. Our results indicate that a scheme based on scheduling a path-discovery routine before the current in-use link breaks is feasible and that such a mechanism can increase the number of packets delivered and decrease the average delay per packet. It also improves the throughput (packet delivered ratio) and balances the traffic between different source–destination pairs. Copyright © 2004 John Wiley & Sons, Ltd.

  • performance evaluation of two congestion control mechanisms with on demand distance Vector aodv Routing Protocol for mobile and wireless networks
    European Conference on Parallel Processing, 2003
    Co-Authors: Azzedine Boukerche
    Abstract:

    In this paper, we focus upon the congestion control problem in on-demand distance Vector Routing (AODV) Protocol for mobile and wireless ad hoc networks. We propose to study two mechanisms to deal with the congestion problem within AODV Routing Protocol. First, we investigate a randomized approach of AODV Protocol. then we present a preemptive ad hoc on-demand distance Vector Routing Protocol for mobile ad hoc networks. We discuss the implementation of both algorithms, and report on the performance results of simulation of several scenarios using the ns-2 ad hoc network simulator.

  • a preemptive on demand distance Vector Routing Protocol for mobile and wireless ad hoc networks
    Annual Simulation Symposium, 2003
    Co-Authors: Azzedine Boukerche, Liqin Zhang
    Abstract:

    Ad hoc wireless networks are expected to play an increasingly important role in future civilian and military settings where wireless access to wired backbone is either ineffective or impossible. However, frequent topology changes caused by node mobility make Routing in ad hoc wireless networks a challenging problem. In this paper, we present a preemptive ad hoc on-demand distance Vector Routing Protocol for mobile and wireless ad hoc networks. We present the algorithm, discuss its implementation and report on the performance results of simulation of several workload models on ns-2. Our results indicate that a scheme based on scheduling a path-discovery routine before the current in-use link breaks is feasible, and that such a mechanism can increase the number of packets delivered and decrease the average delay per packet. It also improves the throughput (packet delivered ratio) and balances the traffic between different source-destination pairs.

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

  • an interior path Vector Routing Protocol
    Local Computer Networks, 2006
    Co-Authors: Conor Creagh, Cormac J Sreenan
    Abstract:

    Today's intra-domain Protocols are limited in their scalability. We examine these limitations and propose an alternative in the form of an IGP based on path Vectors. Taking advantage of the recent research interest in BGP's performance, we are able to develop a Protocol that converges quickly, produces a relatively low level of control-plane traffic and promises to scale to very large networks, while still producing shortest path trees based on minimising latency or maximising bandwidth. We show that such a Protocol converges and present results of its simulation.

V K Chaubey - One of the best experts on this subject based on the ideXlab platform.

  • an enhanced ad hoc on demand distance Vector Routing Protocol for vehicular ad hoc networks vanet s
    Social Science Research Network, 2019
    Co-Authors: Parveen Kumar Singhal, V K Chaubey
    Abstract:

    Vehicular Ad Hoc Networks requires an efficient Routing strategy applicable to any random vehicular movement to fix network layer parameters to enhance the packet delivery ratio, data throughput and packet delivery latency. This paper have made an endeavor to make new Routing system for VANETs and named as Enhanced AODV (ENAODV) by modifying the popular existing AODV Protocol. The paper also improved the predicting node trend strategy of AODV by incorporating node identify and utilizing the real time location information. This proposed strategy have been implemented and tested on NS-2.35 platform. We have evaluated different system quality parameters like delay, packet delivery ratio, throughput, control overhead for legitimate correlation. The recreation results demonstrate that proposed technique ENAODV is outflanks AODV by considering different Routing parameters.

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

  • 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.

  • scalability study of the ad hoc on demand distance Vector Routing Protocol
    International Journal of Network Management, 2003
    Co-Authors: Sungju Lee, Elizabeth M Beldingroyer, Charles E Perkins
    Abstract:

    As mobile networking continues to experience increasing popularity, the need to connect large numbers of wireless devices will become more prevalent. Many recent proposals for ad hoc Routing have certain characteristics that may limit their scalability to large networks. This paper examines five different combinations of modifications that may be incorporated into virtually any on-demand Protocol in order to improve its scalability. The scalability of current on-demand Routing Protocols is evaluated through the selection of a representative from this class of Protocols. The performance of the un-modified on-demand Protocol is compared against that of it combined with each of the scalability modifications. Each scheme's behavior is analyzed in networks as large as 10,000 nodes through detailed simulation. Based on the observations, conclusions are drawn as to the expected scalability improvement that can be achieved by each modification.

  • 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.

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.