On ad hoc routing with guaranteed delivery

Authors:
Mark Braverman
Affiliations:
University of Toronto, Toronto, ON, Canada
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 1
Cited 1

On routing with guaranteed delivery in three-dimensional ad hoc wireless networks

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking

Bounding the locality of distributed routing algorithms

Proceedings of the 28th ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.