skip to main content
article
Free access

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

Published: 01 October 1994 Publication History
  • Get Citation Alerts
  • 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

    [1]
    C. Alaettino~lu, K. Dussa-Zieger, I. Matta, A. U. Shankar, and O. Gudmundsson. Introducing mars, a routing testbed. A CM Computer Communication Review, 1992.]]
    [2]
    D. Bertsekas and R. Gallager. Data Networks, pages 297-333. Prentice-Hall, Inc., 1987.]]
    [3]
    C. Cheng, R. Riley, S. P. R. Kumar, and J. J. Garcia-Luna-Aceves. A loop-free Bellman-Ford routing protocol without bouncing effect. In ACM SIGCOMM '8g, pages 224-237, September 1989.]]
    [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]
    J. J. Garcia Luna-Aceves. A unified approach to loop-free routing using distance vectors or link states. In A CM S~GCOMM, pages 212-223, 1989.]]
    [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

    View all
    • (2024)Routing Selection Algorithm for Mobile Ad Hoc Networks Based on Neighbor Node DensitySensors10.3390/s2402032524:2(325)Online publication date: 5-Jan-2024
    • (2024)Recent Survey on Internet of Vehicles: Architecture, Applications, Challenges, and Its SolutionsJournal of Testing and Evaluation10.1520/JTE2023009552:1(731-753)Online publication date: 1-Jan-2024
    • (2024)Evaluation of Multipath Based Protocols in Wireless NetworksJournal of Advances in Information Technology10.12720/jait.15.2.170-18215:2(170--182)Online publication date: 2024
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 24, Issue 4
    Oct. 1994
    318 pages
    ISSN:0146-4833
    DOI:10.1145/190809
    • Editor:
    • David Oran
    Issue’s Table of Contents
    • cover image ACM Conferences
      SIGCOMM '94: Proceedings of the conference on Communications architectures, protocols and applications
      October 1994
      328 pages
      ISBN:0897916824
      DOI:10.1145/190314
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 October 1994
    Published in SIGCOMM-CCR Volume 24, Issue 4

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)683
    • Downloads (Last 6 weeks)87

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Routing Selection Algorithm for Mobile Ad Hoc Networks Based on Neighbor Node DensitySensors10.3390/s2402032524:2(325)Online publication date: 5-Jan-2024
    • (2024)Recent Survey on Internet of Vehicles: Architecture, Applications, Challenges, and Its SolutionsJournal of Testing and Evaluation10.1520/JTE2023009552:1(731-753)Online publication date: 1-Jan-2024
    • (2024)Evaluation of Multipath Based Protocols in Wireless NetworksJournal of Advances in Information Technology10.12720/jait.15.2.170-18215:2(170--182)Online publication date: 2024
    • (2024)Analysis and Performance Evaluation of Various Shortest Path Algorithms2024 3rd International Conference for Innovation in Technology (INOCON)10.1109/INOCON60754.2024.10512150(1-16)Online publication date: 1-Mar-2024
    • (2024)A new version of the greedy perimeter stateless routing scheme in flying ad hoc networksJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2024.10206636:5(102066)Online publication date: Jun-2024
    • (2024)A smart filtering-based adaptive optimized link state routing protocol in flying ad hoc networks for traffic monitoringJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2024.10203436:4(102034)Online publication date: Apr-2024
    • (2024)Adaptive protocol of raft in wireless networkAd Hoc Networks10.1016/j.adhoc.2023.103377154(103377)Online publication date: Mar-2024
    • (2024)Petal Region Analysis of Improved Petal Ant Routing for Mobile Ad Hoc NetworksSN Computer Science10.1007/s42979-024-02857-75:5Online publication date: 11-May-2024
    • (2024)Performance Evaluation of Three Routing Protocols for Drone Communication NetworksArabian Journal for Science and Engineering10.1007/s13369-024-08932-8Online publication date: 27-May-2024
    • (2024)High flexibility transparent optical networks based on wavelength conversion line selection through multi light pathsJournal of Optics10.1007/s12596-024-01755-8Online publication date: 23-Mar-2024
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media