The DOI matches its Crossref record.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Mitigating routing misbehavior in mobile ad hoc networks
Marti, S., Giuli, T. J., Lai, K., & Baker, M. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345955 · Cited by 3,415
A cautionary perspective on cross-layer design
Kawadia, V., & Kumar, P. R. (2005) · IEEE Wireless Communications · doi:10.1109/mwc.2005.1404568 · Cited by 734
Future Intelligent and Secure Vehicular Network Toward 6G: Machine-Learning Approaches
Tang, F., Kawamoto, Y., Kato, N., & Liu, J. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954595 · Cited by 620
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Impact of cloudlets on interactive mobile cloud applications
Fesehaye, D., Gao, Y., Nahrstedt, K., & Wang, G. (2012) · 2012 IEEE 16th International Enterprise Distributed Object Computing Conference · doi:10.1109/edoc.2012.23 · Cited by 147
Metadata
- Authors
- Perkins, C. E., & Bhagwat, P.
- Venue
- Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94
- Publisher
- ACM Press
- Published
- 1994
- Pages
- 234-244
- OpenAlex
- W4236944153
- Cited by
- 2,914
- References
- 0
- FWCI
- 1.91
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. https://app.cochat.ai/papers/10.1145/190314.190336
- The paper
- Perkins, C. E., & Bhagwat, P. (1994). Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94. https://doi.org/10.1145/190314.190336
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
