skip to main content
10.1145/285237.285279acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

The performance of query control schemes for the zone routing protocol

Authors Info & Claims
Published:01 October 1998Publication History

ABSTRACT

In this paper, we study the performance of route query control mechanisms for the recently proposed Zone Routing Protocol (ZRP) for ad-hoc networks. The ZRP proactively maintains routing information for a local neighborhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. This hybrid routing approach has the potential to be more efficient in the generation of control traffic than traditional routing schemes. However, without proper query control techniques, the ZRP can actually produce more traffic than standard flooding protocols.Our proposed query control schemes exploit the structure of the routing zone to provide enhanced detection (Query Detection (QD1/QD2)), termination (Loop-back Termination (LT), Early Termination (ET)) and prevention (Selective Bordercasting (SBC)) of overlapping queries. We demonstrate how certain combinations of these techniques can be applied to single channel or multiple channel ad-hoc networks to improve both the delay and control traffic performance of the ZRP. Our query control mechanisms allow the ZRP to provide routes to all accessible network nodes with only a fraction of the control traffic generated by purely proactive distance vector and purely reactive flooding schemes, and with a response time as low as 10% of a flooding route query delay.

References

  1. 1.Bertsekas, D., and Gallager, R., Data Networks, Second Edition, Prentice Hall, Inc., 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Cheng, C., Reley, R., Kumar, S.P.R., and Garcia-Luna- Aceves, J.J., "A Loop-Free Extended Bellman-Ford Routing Protocol without Bouncing Effect," ACM Coml~uter Communicatiolls Review, vol. 19, no. 4, 1989, pp. 224-236. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Garcia-Luna-Aceves, J.J., "Loop-Free Routing Using Diffusing Computations," IEEE/A CM Transactiot~s on Networkitzg, vol. 1, no. 1, February 1993, pp. 130-141. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Haas, Z.J., "A Routing Protocol for the Reconfigurable Wireless Networks," IEEE ICUPC'97, San Diego, CA, October 12-16, 1997.Google ScholarGoogle Scholar
  5. 5.Haas, Z.J., and Pearlman, M.R., "The Zone Routing Protocol (ZRP) for Ad-Hoc Networks," IETF MANET, lnternet Draft, Dec. 1997.Google ScholarGoogle Scholar
  6. 6.Johnson, D.B., and Maltz, D.A., "Dynamic Source Routing in Ad-Hoc Wireless Networking," in Mobile Computing, T. Imielinski and H. Korth, editors, Kluwer Academic Publishing, 1996.Google ScholarGoogle Scholar
  7. 7.Johnson, D.J., "Approximation Algorithms for Combinatorial Problems," J. of Computer and System Sciences, vol. 9, pp. 256-278. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Murthy, S., and Garcia-Luna-Aceves, J.J., "A Routing Protocol for Packet Radio Networks," Proc. of ACM Mobile Computing and Networking Conference, MOBICOM'95, Nov. 14-15, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Murthy, S., and Garcia-Luna-Aceves, J.J., "An Efficient Routing Protocol for Wireless Networks," MONET, vol.1, no.2, pp. 183-197, October 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Park, V.D., and Corson, M.S. "A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks," IEEE INFOCOM '97, Kobe, Japan, 1997 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.Perkins, C.E., and Bhagwat, P., "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers," ACM SIGCOMM, vol.24, no.4, Oct. 1994, pp.234-244. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.Perkins, C.E., "Ad Hoc On-Demand Distance Vector (AODV) Routing,", IETF MANET, Internet Draft, Dec. 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.Tsuchiya, P.F., "The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks," ACM Computer Communications Review, vol. 18, no. 4, pp.35-42, I988 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The performance of query control schemes for the zone routing protocol

        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
        • Published in

          cover image ACM Conferences
          SIGCOMM '98: Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
          October 1998
          328 pages
          ISBN:1581130031
          DOI:10.1145/285237

          Copyright © 1998 ACM

          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: 1 October 1998

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          SIGCOMM '98 Paper Acceptance Rate26of247submissions,11%Overall Acceptance Rate554of3,547submissions,16%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader