Eryk Schiller, Paul Starzetz, Franck Rousseau, Andrzej Duda
In Proceedings of ACM MSWiM 2008. Vancouver, Canada, 27-31 October 2008
Monday 27 October 2008
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.
@inproceedings{schiller-mswim2008, author = {Schiller, Eryk and Starzetz, Paul and Rousseau, Franck and Duda, Andrzej}, title = {{Binary waypoint geographical routing in wireless mesh networks}}, booktitle = {Proceedings of the 11th International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2008)}, address = {Vancouver, Canada}, 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.}, publisher = {ACM}, isbn = {978-1-60558-235-1}, doi = {10.1145/1454503.1454548}, pages = {252--259}, month = Oct # {~27--31}, year = 2008 }