Brief announcement: On ad hoc routing with guaranteed delivery

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationPODC'08
Subtitle of host publicationProceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing
Number of pages1
StatePublished - Dec 17 2008
Externally publishedYes
Event27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - Toronto, ON, Canada
Duration: Aug 18 2008Aug 21 2008

Other

Other27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
CountryCanada
CityToronto, ON
Period8/18/088/21/08

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Fingerprint Dive into the research topics of 'Brief announcement: On ad hoc routing with guaranteed delivery'. Together they form a unique fingerprint.

  • Cite this

    Braverman, M. (2008). Brief announcement: On ad hoc routing with guaranteed delivery. In PODC'08: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing