152

On ad hoc routing with guaranteed delivery

ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2008
Abstract

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

View on arXiv
Comments on this paper