Brief announcement: On ad hoc routing with guaranteed delivery

Mark Braverman

Brief announcement: On ad hoc routing with guaranteed delivery

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English (US)
Title of host publication	PODC'08
Subtitle of host publication	Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing
Pages	418
Number of pages	1
State	Published - 2008
Externally published	Yes
Event	27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - Toronto, ON, Canada Duration: Aug 18 2008 → Aug 21 2008

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

Other	27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
Country/Territory	Canada
City	Toronto, ON
Period	8/18/08 → 8/21/08

All Science Journal Classification (ASJC) codes

Software
Hardware and Architecture
Computer Networks and Communications

Keywords

Ad hoc routing
Guaranteed delivery
Space-bounded computation
Universal exploration sequence

Cite this

@inproceedings{006573756cf64adca22809c470d5b637,

title = "Brief announcement: On ad hoc routing with guaranteed delivery",

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.",

keywords = "Ad hoc routing, Guaranteed delivery, Space-bounded computation, Universal exploration sequence",

author = "Mark Braverman",

year = "2008",

language = "English (US)",

isbn = "9781595939890",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "418",

booktitle = "PODC'08",

note = "27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing ; Conference date: 18-08-2008 Through 21-08-2008",

}

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. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 418, 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 8/18/08.

TY - GEN

T1 - Brief announcement

T2 - 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

AU - Braverman, Mark

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Ad hoc routing

KW - Guaranteed delivery

KW - Space-bounded computation

KW - Universal exploration sequence

UR - http://www.scopus.com/inward/record.url?scp=57549118723&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57549118723&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:57549118723

SN - 9781595939890

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 418

BT - PODC'08

Y2 - 18 August 2008 through 21 August 2008

ER -

Brief announcement: On ad hoc routing with guaranteed delivery

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Other files and links

Fingerprint

Cite this