On ad hoc routing with guaranteed delivery
  We point out a simple poly-time log-space routing algorithm in ad hoc networks with guaranteed delivery using universal exploration sequences. 
Mark Braverman