Binary waypoint geographical routing in wireless mesh networks

Eryk Schiller 1 Paul Starzetz 1 Franck Rousseau 1 Andrzej Duda 1
1 Drakkar
LIG - Laboratoire d'Informatique de Grenoble
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.
Type de document :
Communication dans un congrès
Proceedings of the 11th International Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2008), 2008, Vancouver, Canada. ACM, pp.252-259, 2008, 〈10.1145/1454503.1454548〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01199101
Contributeur : Franck Rousseau <>
Soumis le : lundi 14 septembre 2015 - 22:39:30
Dernière modification le : mercredi 15 février 2017 - 13:08:51

Identifiants

Collections

Citation

Eryk Schiller, Paul Starzetz, Franck Rousseau, Andrzej Duda. Binary waypoint geographical routing in wireless mesh networks. Proceedings of the 11th International Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2008), 2008, Vancouver, Canada. ACM, pp.252-259, 2008, 〈10.1145/1454503.1454548〉. 〈hal-01199101〉

Partager

Métriques

Consultations de la notice

58