Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers

Abstract

An <italic>ad-hoc</italic> 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 investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.

DOI: 10.1145/190314.190336

Extracted Key Phrases

0200400'95'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

6,942 Citations

Semantic Scholar estimates that this publication has 6,942 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Perkins1994HighlyDD, title={Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers}, author={Charles E. Perkins and Pravin Bhagwat}, booktitle={SIGCOMM}, year={1994} }