Wireless Networks

, Volume 7, Issue 6, pp 609–616

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks

  • Prosenjit Bose
  • Pat Morin
  • Ivan Stojmenović
  • Jorge Urrutia
Article

DOI: 10.1023/A:1012319418150

Cite this article as:
Bose, P., Morin, P., Stojmenović, I. et al. Wireless Networks (2001) 7: 609. doi:10.1023/A:1012319418150

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.

wireless networksroutingunit graphsonline algorithmsGabriel graphs

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Prosenjit Bose
    • 1
  • Pat Morin
    • 1
  • Ivan Stojmenović
    • 2
  • Jorge Urrutia
    • 2
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Computer Science, SITEUniversity of OttawaOttawaCanada