skip to main content
article

Scenario-based comparison of source-tracing and dynamic source routing protocols for ad hoc networks

Published:01 October 2001Publication History
Skip Abstract Section

Abstract

We present source tracing as a new viable approach to routing in ad hoc networks in which routers communicate the second-to-last hop and distance in preferred paths to destinations. We introduce a table-driven protocol (BEST) in which routers maintain routing information for all destinations, and an on-demand routing protocol (DST) in which routers maintain routing information for only those destinations to whom they need to forward data. Simulation experiments are used to compare these protocols with DSR, which has been shown to incur less control overhead that other on-demand routing protocols. The simulations show that DST requires far less control packets to achieve comparable or better average delays and percentage of packet delivered than DSR, and that BEST achieves comparable results to DSR while maintaining routing information for all destinations.

References

  1. S. P. R. Kumar C. Cheng, R. Reley and J. J. Garcia-Luna-Aceves. A Loop-Free Extended Bellman-Ford Routing Protocol without Boumcing Effect. ACM Computer Communications Review, 19(4):224--236, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. IEEE Computer Society LAN MAN Standards Committee. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. The Institute of Electrical and Electronics Engineers, 1997. IEEE Std 802.11.Google ScholarGoogle Scholar
  3. J. Broch et. al. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In Proc. ACM MOBICOM 98, Dallas, TX, October 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Per Johansson et. al. Scenario Based Performance Analysis of Routing Protocols for Mobile Ad hoc Networks. In Proc. ACM Mobicom'99, Seattle, Washington, August 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. Dube et. al. Signal Stability-Based Adaptive Routing (SSA) for Ad hoc Mobile Networks. IEEE Pers. Commun., February 1997.Google ScholarGoogle ScholarCross RefCross Ref
  6. Kevin Fall and Kannan Varadhan, ns notes and documentation. The VINT Project, UC Berkeley, LBL, USC/ISI and Xerox PARC, 1999. Available from http://www-mash.cs.berkeley.edu.Google ScholarGoogle Scholar
  7. C. L. Fullmer and J. J. Garcia-Luna-Aceves. Solutions to Hidden Terminal Problems in Wireless Networks. In Proc. ACM SIGCOMM'97, Cannes, France, September 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. J. Garcia-Luna-Aceves and S. Murthy. A Path Finding Algorithm for Loop-Free Routing. IEEE/ACM Trans. Networking, February 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. J. Garcia-Luna-Aceves and M. Spohn. Source-Tree Routing in Wireless Networks. In Proc. IEEE ICNP 99, 7th International Conference on Network Protocols, Toronto, Canada, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. J. Garcia-Luna-Aceves and A. Tzamaloukas. Reversing The Collision-Avoidance Handshake in Wireless Networks. In Proc. ACM/IEEE Mobicom'99, Seattle, Washington, August 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Z. Haas and M. Pearlman. The Performance of Query Control Schemes for the Zone Routing Protocol. In Proc. ACM SIGCOMM '98, Vancouver, British Columbia, August 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. B. Johnson and D. A. Maltz. Dynamic Source Routing in Ad hoc Wireless Networks. Mobile Computing, 1994.Google ScholarGoogle Scholar
  13. S. Murthy and J. J. Garcia-Luna-Aceves. An Efficient Routing Protocol for Wireless Networks. ACM Mobile Networks and Applications Journal, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. V. D. Park and M. S. Corson. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In Proc. IEEE INFOCOM'97, Kobe, Japan, April 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. E. Perkins and P. Bhagwat. Highly Dynamic Distance-Sequenced Distance-Vector(DSDV) for mobile computers. Computer Communication Review, 24(4):234--244, October 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C. E. Perkins and E. M. Royer. Ad Hoc On-Demand Distance Vector Routing. In Proc. of IEEE WMCSA'99, New Orleans, LA, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C. E. Perkins S. R. Das and E. M. Royer. Performance Comparison of Two On-Demand Routing Protocols for Ad hoc Networks. In Proc. of IEEE Infocom 2000, Tel Aviv, Israel, Mar 2000.Google ScholarGoogle ScholarCross RefCross Ref
  18. Z. Tang and J. J. Garcia-Luna-Aceves. Hop-Reservation Multiple Access (HRMA) for Ad hoc Networks. In Proc. IEEE INFOCOM'99, March 1999.Google ScholarGoogle Scholar
  19. C.K. Toh. Associativity-Based Routing for Ad hoc Mobile Networks. Wireless Personal Communications Journal, Special Issue on Mobile Networking and Computing Systems, Kluwer Academic Publishers, 4(2):103--109, Mar. 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. Zhu and S. Corson. A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks. In Proc. IEEE Infocom, 98.Google ScholarGoogle Scholar

Index Terms

  1. Scenario-based comparison of source-tracing and dynamic source routing protocols for ad hoc networks
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 31, Issue 5
        Special issue on wireless extensions to the internet
        October 2001
        92 pages
        ISSN:0146-4833
        DOI:10.1145/1037107
        Issue’s Table of Contents

        Copyright © 2001 Authors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 October 2001

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader