A new distributed algorithm to find breadth first search trees
IEEE Transactions on Information Theory
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Succinct Greedy Geometric Routing Using Hyperbolic Geometry
IEEE Transactions on Computers
A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS
IEEE Communications Surveys & Tutorials
Editorial: Reliable network-based services
Computer Communications
| Hi-index | 0.24 |
The scalability of current routing protocols is limited by the linearly increasing size of the corresponding routing tables. Greedy routing has been proposed as a solution to this scalability problem. In greedy routing, every node is assigned a coordinate. These coordinates are used in order to forward a packet to a neighbor which is closer to the destination. Current greedy methods cannot efficiently cope with failures in topology. Using methods which require large resources and have significant loss in the quality of the routing (stretch loss) makes greedy routing useless in large-scale networks. In this paper, local techniques for single and multiple link failure recovery are proposed. The methods require very limited resources and result into limited loss in routing quality. The proposed schemes allow fast switch-over and scale with the number of links in the spanning tree of the network. Scalability, simplicity and low overhead of the methods make them suitable for large networks. The proposed techniques are evaluated in an experimental environment.