Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

  title={Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers},
  author={Charles E. Perkins and Pravin Bhagwat},
  journal={Proceedings of the conference on Communications architectures, protocols and applications},
  • C. Perkins, P. Bhagwat
  • Published 1 October 1994
  • Computer Science
  • Proceedings of the conference on Communications architectures, protocols and applications
An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have… 

Figures and Tables from this paper

A comparative study of routing protocols in MANETs
An attempt has been made to compare the performance of prominent on-demand reactive routing protocols for mobile ad hoc networks (AODV and TORA), along with the traditional proactive DSDV protocol.
RRP – A Bandwidth-efficient Routing Protocol for Mobile Ad-hoc Networks
A new on-demand bandwidth-efficient routing protocol for mobile ad-hoc networks called the Reactive Routing Protocol (RRP), which achieves its bandwidth efficiency by using the Incremental Search Method for route discovery and the Surroundings Repair Method (SRM) for route maintenance.
MANET-Evaluation of DSDV and AROD Routing Protocol
This work inspects two MANET protocols DSDV (Destination Sequenced Distance Vector) and AROD (Adaptive Routing in Dynamic Ad-hoc Networks), which aim to satisfy the needs of communications in such networks.
Performance Evaluation of Routing Protocols for MANET
The MDVZRP’s performance is evaluated and compared with DSDV and AODV standard protocols delivering CBR traffic and results show that it gives better performance than D SDV in all situations, and better than A ODV, when mobility is low.
Location-based associativity routing for MANET
  • V. N. Sastry, P. Supraja
  • Computer Science
    WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005.
  • 2005
An algorithm is proposed, which is useful to derive bandwidth-efficient and long-lived routes, resulting in the improvement of performance of mobile ad hoc networks, and is supported with complexity analysis.
Destination-Sequenced Distance Vector ( DSDV ) Protocol
The D SDV protocol is reviewed, and the properties of DSDV when it is used for ad hoc networks routing are analyzed.
A novel distributed routing protocol to support ad-hoc mobile computing
  • C. Toh
  • Computer Science, Business
    Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications
  • 1996
A new associativity-based routing scheme where a route is selected based on nodes having associativity states that imply periods of stability, resulting in higher attainable throughput and the integration of ad-hoc routing into a BS-oriented wireless LAN environment, providing fault tolerance in times of base station failures.
An Improved Hybrid Routing Protocol for Mobile Ad Hoc Networks
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.


A loop-free extended Bellman-Ford routing protocol without bouncing effect
A protocol that maintains the shortest-path routes in a dynamic topology, that is, in an environment where links and nodes can fail and recover at arbitrary times, and avoids the bouncing effect and the looping problem that occur in the previous approaches of the distributed implementation of Bellman-Ford algorithm.
A unified approach to loop-free routing using distance vectors or link states
A distributed algorithm that provides loop-free paths at every instant and extends or improves algorithms introduced previously by Chandy and Misra, Jaffe and Moss, Merlin and Segall, and the author is described.
The New Routing Algorithm for the ARPANET
The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to
Routing Techniques Used in Computer Communication Networks
An overview is provided in this paper of the routing procedures used in a number of operating networks, as well as in two commercial network architectures, which include the IBM SNA and the DEC DNA.
Routing Information Protocol
This document specifies a routing protocol, based on the Routing Information Protocol (RIP), as defined in [1,2], for the Simple Internet Protocol (SIP), as defined in [3]. A companion document will
A Failsafe Distributed Routing Protocol
The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe.
Introducing MaRS, a routing testbed
A Responsive Distributed Routing Algorithm for Computer Networks
A new distributed algorithm is presented for dynamically determining weighted shortest paths used for message routing in computer networks that the paths defined do not form transient loops when weights change and the number of steps required to find new shortest paths when network links fail is less than for previous algorithms.
draft-ietf-mobileip-protocol-03.txt. Draft RFC -w ork in progress
  • draft-ietf-mobileip-protocol-03.txt. Draft RFC -w ork in progress
  • 1994
routing protocol without bouncing effect
  • 1989