Binary waypoint geographical routing in wireless mesh networks

Authors:
Eryk Schiller;Paul Starzetz;Franck Rousseau;Andrzej Duda
Affiliations:
Grenoble Informatics Laboratory, Grenoble, France;Grenoble Informatics Laboratory, Grenoble, France;Grenoble Informatics Laboratory, Grenoble, France;Grenoble Informatics Laboratory, Grenoble, France
Venue:
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Year:
2008

Citing 9
Cited 1

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
GPS-free Positioning in Mobile Ad Hoc Networks

Cluster Computing
Geometric ad-hoc routing: of theory and practice

Proceedings of the twenty-second annual symposium on Principles of distributed computing
A Novel Geographic Routing Algorithm for Ad Hoc Networks Based on Localized Delaunay Triangulation

AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Lazy cross-link removal for geographic routing

Proceedings of the 4th international conference on Embedded networked sensor systems
Non-Euclidian geographic routing in wireless networks

Ad Hoc Networks
Bounds on hop distance in greedy routing approach in wireless ad hoc networks

International Journal of Wireless and Mobile Computing
Scalable geographic routing algorithms for wireless ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Adaptive geographic routing in wireless sensor networks

Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems

Quantified Score

Hi-index	0.00

Visualization

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.