Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Geographic grid routing: designing for reliability in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A resource-efficient and scalable wireless mesh routing protocol
Ad Hoc Networks
An architecture for seamless mobility in spontaneous wireless mesh networks
Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
Binary waypoint geographical routing in wireless mesh networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Hole-shadowing routing in large-scale MANETs
International Journal of Sensor Networks
On the optimality of field-line routing in massively dense wireless multi-hop networks
Performance Evaluation
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distance-based node activation for geographic transmissions in fading channels
IEEE Transactions on Communications
Node activation to maximize expected progress in wireless networks with energy constraints
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Greedy face routing with face identification support in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A model framework for greedy routing in a sensor network with a stochastic power scheme
ACM Transactions on Sensor Networks (TOSN)
Up-Down Links Dualpath Greedy Routing Protocol for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
The design of efficient routing protocols for dynamical changing network topologies is a crucial part of building power-efficient and scalable ad hoc wireless networks. If position information is available due to GPS or some kind of relative positioning technique, a promising approach is given by geographic routing algorithms, where each forwarding decision is based on the positions of current, destination, and possible candidate nodes in vicinity only. About 15 years ago heuristic greedy algorithms were proposed, which in order to provide freedom from loops might fail even if there is a path from source to destination. In recent years planar graph traversal has been investigated as one possible strategy to recover from such greedy routing failures. This article provides a tutorial for this class of geographic routing algorithms, and discusses recent improvements to both greedy forwarding and routing in planar graphs.