Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
IEEE Transactions on Parallel and Distributed Systems
Location updates for efficient routing in ad hoc networks
Handbook of wireless networks and mobile computing
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Self Organized Terminode Routing
Cluster Computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Non-Euclidian geographic routing in wireless networks
Ad Hoc Networks
A localized link removal and addition based planarization algorithm
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
| Hi-index | 0.00 |
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy routing algorithms might fail even if there is a path from source to destination. In recent years several recovery strategies have been proposed in order to overcome such greedy routing failures. Planar graph traversal was the first of those strategies that does not require packet duplication and memorizing past routing tasks. This article introduces a novel recovery strategy based on the idea of planar graph traversal but performing routing tasks along geographical clusters instead of individual nodes. The planar graph construction method discovered so far needs one-hop neighbor information only, but may produce disconnection even if there is a path from source to destination. However, simulation results show that the proposed algorithm is a good choice from a practical point of view, since disconnection does only concern sparse networks, while in dense network the proposed algorithm competes with existing solutions and even outperforms planar graph routing methods based on one-hop neighbor information. This paper finally gives an outline of further research directions which show that geographical clusters may be the key to solve some problems that come along with planar graph routing in wireless networks.