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.
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- N. Carlsson and D. L. Eager. Non-Euclidian Geographic Routing in Wireless Networks. Ad Hoc Netw., 5(7):1173--1193, 2007. Google ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- H. Frey. Scalable Geographic Routing Algorithms for Wireless Ad-Hoc Networks. IEEE Network, July/August 2004. Google ScholarDigital Library
- K. Gabriel and R. Sokal. A New Statistical Approach to Geographic Variation Analysis. Systematic Zoology, 18:259--278, 1969.Google ScholarCross Ref
- 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 ScholarDigital Library
- B. Karp and H. T. Kung. Greedy Perimeter Stateless Routing for Wireless Networks. In Proc. of MOBICOM, Boston, USA, August 2000. Google ScholarDigital Library
- 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 ScholarDigital Library
- F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric Ad-Hoc Routing: of Theory and Practice. In Proc. ACM PODC, 2003. Google ScholarDigital Library
- 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 ScholarCross Ref
- G. Toussaint. The Relative Neighborhood Graph of a Finite Planar Set. Pattern Recognition, 12(4):261--268, 1980.Google ScholarCross Ref
Index Terms
- Binary waypoint geographical routing in wireless mesh networks
Recommendations
Improved Geographical Routing in Vehicular Ad Hoc Networks
Vehicular Ad Hoc Networks (VANET) has emerged to establish communication between intelligent vehicles. The high mobility of vehicles and existing of obstacles in urban area make the communication link between vehicles to be unreliable. In this ...
Mobility-Aware Hybrid Routing Approach for Wireless Mesh Networks
MESH '10: Proceedings of the 2010 Third International Conference on Advances in Mesh NetworksWireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (a) proactive, (b) reactive, and (c) hybrid approaches. In general, proactive routing is more suitable for a stationary ...
Discovering AODV-based multipath routes in wireless ad hoc networks
Multipath extension of ad hoc on-demand distance vector (AODV) protocol can provide reliable and adaptable routes in mobile ad hoc networks. In this paper, we propose an AODV-based acyclic multipath routing method, which uses a dynamic hop count to ...
Comments