Beaconless Position Based Routing with Guaranteed Delivery for Wireless Ad-Hoc and Sensor Networks

  • Mohit Chawla
  • Nishith Goel
  • Kalai Kalaichelvan
  • Amiya Nayak
  • Ivan Stojmenovic
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 212)


Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.

6 References

  1. [1]
    S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward. A Distance Routing Effect Algorithm for Mobility (DREAM), MobiCom’98, pages 76–84, Dallas, Texas, October 1998.Google Scholar
  2. [2]
    L. Blazevic, S. Giordano, and J.-Y. LeBoudec. Self Organizing Wide-Area Routing, Proceedings SCI 2000/ISAS 2000, Orlando, July 2000.Google Scholar
  3. [3]
    B. M. Blum, T. He, S. Son, and J. A. Stankovic. IGF: A state-free robust communication protocol for wireless sensor networks. TR CS-2003-11, University of Virginia, April 2003.Google Scholar
  4. [4]
    P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc Wireless Networks. ACM DIALM, 1999.Google Scholar
  5. [5]
    T. Camp, J. Boleng, and L. Wilcox. Location Information Services in Mobile Ad Hoc Networks. Proc. IEEE ICC, 3318–3324, April 2002.Google Scholar
  6. [6]
    G. G. Finn. Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180, March 1987.Google Scholar
  7. [7]
    H. Fuessler, J. Widmer, M. Kasemann, M. Mauve, Beaconless Position Based Routing For Mobile Ad-Hoc Networks. Ad Hoc Networks 1 (2003) 351–369.CrossRefGoogle Scholar
  8. [8]
    S. Giordano, I. Stojmenovic, Position based routing algorithms for ad hoc networks: A taxonomy, in Ad Hoc Wireless Networking; eds. X. Cheng et al Kluwer, 2003, 103–136.Google Scholar
  9. [9]
    M. Heissenbuttel and T. Braun, A novel position-based and beacon-less routing algorithm for mobile ad-hoc networks, ASWN’ 03, Bern, 2003, 197–210.Google Scholar
  10. [10]
    Q. Huang, C. Lu, G.C. Roman, Reliable mobicast via face-aware routing, IEEE INFOCOM 2004.Google Scholar
  11. [11]
    J. Hou, N. Li, I. Stojmenovic, Topology construction and maintenance in wireless sensor networks, in: Handbook of Sensor Networks: Algorithms and Architectures (I. Stojmenovic, ed.), Wiley, 2005, 311–341.Google Scholar
  12. [12]
    F. Kuhn, R. Wattenhofer, Y. Zhang and A. Zollinger, “Geometric AdHoc Routing: Of Theory and Practice,” PODC, 2003.Google Scholar
  13. [13]
    I. Stojmenovic, Location updates for efficient routing in wireless networks, in: Handbook of Wireless Networks and Mobile Computing, Wiley, 2002, 451–471.Google Scholar
  14. [14]
    M. Zorzi. A new contention-based mac protocol for geographic forwarding in ad hoc and sensor networks. IEEE Conf. Communications (ICC 2004), Paris, 2004.Google Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Mohit Chawla
    • 1
  • Nishith Goel
    • 2
  • Kalai Kalaichelvan
    • 3
  • Amiya Nayak
    • 4
  • Ivan Stojmenovic
    • 4
  1. 1.Computer Science & EngineeringIIT Guwahati, B.TechGuwahati, AssamIndia
  2. 2.Cistel Technology Inc.OttawaCanada
  3. 3.EION Technology Inc.OttawaCanada
  4. 4.SITEUniversity of OttawaOttawaCanada

Personalised recommendations