Routing with guaranteed delivery in ad hoc wireless networks
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 guaranty 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.
|3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIALM 1999|
|Organisation||School of Computer Science|
Bose, P, Morin, P, Urrutia, J. (Jorge), & Stojmenović, I. (Ivan). (1999). Routing with guaranteed delivery in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIALM 1999 (pp. 48–55). doi:10.1145/313239.313282