Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers

Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers (1994)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Charles E. Perkins , Pravin Bhagwat

Citations:

1221 - 8 self

Versions

Version History

Metadata Version 2

User correction supplied by mph

Datum	Value	Source
TITLE	Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers	INFERENCE
AUTHOR NAME	Charles E. Perkins	user correction
AUTHOR AFFIL	IBM, T.J. Watson Research Center	user correction
AUTHOR ADDR	Hawthorne, NY 10562	user correction
AUTHOR NAME	Pravin Bhagwat	user correction
ABSTRACT	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 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 adhoc 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.	user correction
YEAR	1994	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	234--244	INFERENCE
CITATIONS	12 found	ParsCit 1.0