skip to main content
10.1145/1454503.1454548acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
research-article

Binary waypoint geographical routing in wireless mesh networks

Published:27 October 2008Publication History

ABSTRACT

We propose Binary Waypoint Routing, a novel geographical routing protocol for wireless mesh networks. Its idea is to learn and maintain source routes to a small number of nodes called binary waypoints that are placed in subspaces constructed as a result of binary space partitioning. A source node sends a packet to a waypoint for a given destination and intermediate nodes try to adapt the packet route by aiming at waypoints that are closer to the destination. Our simulation results show that the proposed scheme achieves high packet delivery rate with a traffic pattern similar to the Optimal Shortest Path Routing.

References

  1. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wireless Networks, 7(6):609--616, November 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Capkun, M. Hamdi, and J. P. Hubaux. GPS-Free Positioning in Mobile Ad-hoc Networks. Cluster Computing, 5(2):157--167, April 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. N. Carlsson and D. L. Eager. Non-Euclidian Geographic Routing in Wireless Networks. Ad Hoc Netw., 5(7):1173--1193, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. Casari, M. Nati, C. Petrioli, and M. Zorzi. Efficient Non Planar Routing Around Dead-Ends in Sparse Topologies Using Random Forwarding. In Proc. of ICC, Glasgow, UK, June 2007.Google ScholarGoogle ScholarCross RefCross Ref
  5. S. De, A. Caruso, T. Chaira, and S. Chessa. Bounds on Hop Distance in Greedy Routing Approach in Wireless Ad Hoc Networks. International Journal on Wireless and Mobile Computing, 1(2):131--140, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. H. Frey. Scalable Geographic Routing Algorithms for Wireless Ad-Hoc Networks. IEEE Network, July/August 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. K. Gabriel and R. Sokal. A New Statistical Approach to Geographic Variation Analysis. Systematic Zoology, 18:259--278, 1969.Google ScholarGoogle ScholarCross RefCross Ref
  8. P. He, J. Li, and L. Zhou. A Novel Geographic Routing Algorithm for Ad Hoc Networks Based on Localized Delaunay Triangulation. In Proc. of AINA, Vienna, Austria, April 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. B. Karp and H. T. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In Proc. of MOBICOM, Boston, USA, August 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker. Lazy Cross-Link Removal for Geographic Routing. In Proc. of SENSYS, pages 112--124, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric Ad-Hoc Routing: of Theory and Practice. In Proc. ACM PODC, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. E. Schiller, P. Starzetz, F. Theoleyre, and A. Duda. Properties of Greedy Geographical Routing in Spontaneous Wireless Mesh Networks. In Proc. IEEE GLOBECOM, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  13. G. Toussaint. The Relative Neighborhood Graph of a Finite Planar Set. Pattern Recognition, 12(4):261--268, 1980.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Binary waypoint geographical routing in wireless mesh networks

    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
      MSWiM '08: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
      October 2008
      430 pages
      ISBN:9781605582351
      DOI:10.1145/1454503

      Copyright © 2008 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: 27 October 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate398of1,577submissions,25%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader