On ad hoc routing with guaranteed delivery

Abstract

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

Cited by in corpus (2)

• Memoryless Routing in Convex Subdivisions: Random Walks are Optimal
• Local Routing in Graphs Embedded on Surfaces of Arbitrary Genus