Wireless Networks

, Volume 7, Issue 6, pp 609–616 | Cite as

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks

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


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 networks routing unit graphs online algorithms Gabriel graphs 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Baeza-Yates, J. Culberson and G. Rawlins, Searching in the plane, Information and Computation 106(2) (1993) 234–252.Google Scholar
  2. [2]
    S. Basagni, I. Chlamtac, V.R. Syrotiuk and B.A. Woodward, A distance routing effect algorithm for mobility (DREAM), in: ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom' 98) (1998) pp. 76–84.Google Scholar
  3. [3]
    J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Elsevier North-Holland, 1976).Google Scholar
  4. [4]
    P. Bose and P. Morin, An improved algorithm for subdivision traversal without extra storage, in: Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC'2000) (2000) (to appear).Google Scholar
  5. [5]
    M. de Berg, M. van Kreveld, R. van Oostrum and M. Overmars, Simple traversal of a subdivision without extra storage, International Journal of Geographic Information Systems 11 (1997) 359–373.Google Scholar
  6. [6]
    K.R. Gabriel and R.R. Sokal, A new statistical approach to geographic variation analysis, Systematic Zoology 18 (1969) 259–278.Google Scholar
  7. [7]
    Y.-B. Ko and N.H. Vaidya, Geocasting in mobile ad hoc networks: Location-based multicast algorithms, Technical report TR–98–018, Texas A&M University (September 1998).Google Scholar
  8. [8]
    Y.-B. Ko and N.H. Vaidya, Location-aided routing (LAR) in mobile ad hoc networks, in: ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom'98) (1998) pp. 66–75.Google Scholar
  9. [9]
    E. Kranakis, H. Singh and J. Urrutia, Compass routing on geometric networks, in: Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99) (1999) Scholar
  10. [10]
    J.C. Lin, Biological aspects of mobile communication data, Wireless Networks 3(6) (1997) 439–453.Google Scholar
  11. [11]
    X. Lin and I. Stojmenović, Geographic distance routing in ad hoc wireless networks, Technical report TR–98–10, SITE, University of Ottawa (December 1998).Google Scholar
  12. [12]
    D.W. Matula and R.R. Sokal, Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane, Geographical Analysis 12 (July 1980) 205–222.Google Scholar
  13. [13]
    J.C. Navas and T. Imielinski, Geocast — geographic addressing and routing, in: ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom'97) (1997) pp. 66–76.Google Scholar
  14. [14]
    A. Okabe, B. Boots and K. Sugihara, Spatial Tesselations: Concepts and Applications of Voronoi Diagrams (Wiley, 1992).Google Scholar
  15. [15]
    H. Takagi and L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Transactions on Communications 32(3) (1984) 246–257.Google Scholar

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

Personalised recommendations