A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Minimizing recovery state In geographic ad-hoc routing
2006
Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '06
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach fails. We propose a novel idea based on virtual repositioning of nodes that allows to increase the efficiency of greedy routing and significantly increase the success of the recovery algorithm based on local information alone. We explain the problem of predicting dead ends which the greedy algorithm may reach and
doi:10.1145/1132905.1132908
dblp:conf/mobihoc/AradS06
fatcat:xjzxlxhlmbdepacjvgch7tgge4