Routing with Guaranteed Delivery in ad hoc Wireless Networks

Routing with Guaranteed Delivery in ad hoc Wireless Networks (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Prosenjit Bose , Pat Morin , Ivan Stojmenović , Jorge Urrutia

Venue:	WIRELESS NETWORKS
Citations:	509 - 49 self

Versions

Version History

Metadata Version 3

User correction supplied by mph

Datum	Value	Source
TITLE	Routing with Guaranteed Delivery in ad hoc Wireless Networks	user correction - Legacy Corrections
AUTHOR NAME	Prosenjit Bose	user correction
AUTHOR NAME	Pat Morin	user correction
AUTHOR NAME	Ivan Stojmenović	user correction
AUTHOR AFFIL	Computer Science, SITE, University of Ottawa	user correction
AUTHOR ADDR	550 Cumberland, PO Box 450, Station A, Ottawa, Canada, K1N 6N5	user correction
AUTHOR NAME	Jorge Urrutia	user correction
AUTHOR AFFIL	Computer Science, SITE, University of Ottawa	user correction
AUTHOR ADDR	550 Cumberland, PO Box 450, Station A, Ottawa, Canada, K1N 6N5	user correction
ABSTRACT	We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination. These algorithms can be extended to yield algorithms for broadcasting and geocasting that do not require packet duplication. A byproduct of our results is a simple distributed protocol for extracting a planar subgraph of a unit graph. We also present simulation results on the performance of our algorithms.	user correction - Legacy Corrections
YEAR	2001	user correction - Legacy Corrections
VENUE	WIRELESS NETWORKS	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	609--616	user correction
VOLUME	7	INFERENCE
CITATIONS	17 found	ParsCit 1.0