On ad hoc routing with guaranteed delivery
Mark Braverman · 2008
We give a simple poly-time log-space ad hoc routing algorithm in static networks with a logarithmic overhead on the message size. The algorithm provides guaranteed delivery using universal exploration sequences.