ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Full text PdfPdf (1.18 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the conference on Communications architectures, protocols and applications table of contents
London, United Kingdom
Pages: 234 - 244  
Year of Publication: 1994
ISBN:0-89791-682-4
Also published in ...
Authors
Charles E. Perkins  IBM, T.J. Watson Research Center, Hawthorne, NY
Pravin Bhagwat  Computer Science Department, University of Maryland, College Park, MD
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 86,   Downloads (12 Months): 542,   Citation Count: 568
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/190314.190336
What is a DOI?

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


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
Wim Diepstraten, Greg Ennis, and Phil Belanger. D FWMAC- Distributed Foundation Wireless Medium Access Control. IEEE Document P802.11-93/190, Nov 1993.
 
5
C. Hedrick. Routing Information Protocol. RFC 1058, June 1988.
 
6
J. M. Jaffe and F.H. Moss. A responsive distributed routing algorithm for computer networks. IEEE Transactions on Communications, COM- 30(7):1758-1762, july 1982.
7
 
8
J. M. McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, COM- 28(5):711-719, May 1980.
 
9
P. M. Merlin and A. Segall. A failsafe distributed routing protocol. IEEE Transactions on Communications, COM-27(9):1280-1287, September 1979.
 
10
Charles Perkins. Mobile IP as seen by the IETF. Connemions, pages 2-20, Mar 1994.
 
11
M. Schwartz and T.E. Stern. Routing techniques used in computer communication networks. IEEE Transactions on Communications, COM- 28(4):539-552, April 1980.
 
12
Bill Simpson. draft-ietf-mobileip-protocol-03.txt. Draft RFC- work in progress, May 1994.

CITED BY  570

Collaborative Colleagues:
Charles E. Perkins: colleagues
Pravin Bhagwat: colleagues