Date Added: Jan 2010
The authors propose partial and full link reversal algorithms to bypass voids during geographic routing over duty-cycled wireless sensor networks. They propose a distributed approach that is oblivious to one-hop neighbor information. Upon termination of the algorithm, the resulting network is guaranteed to be destination-oriented. Further, to reduce the delays incurred under reactive link reversal, they propose the use of 'Pseudo-events', a preemptive link reversal strategy, that renders the network destination-oriented before the onset of a real event. A simulation study of the effectiveness of pseudo-events is also provided.