Advertisement

Randomized Routing Algorithms in Mobile Ad Hoc Networks

  • T. Fevens
  • I. T. Haque
  • L. Narayanan
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 162)

Abstract

Position-based routing is a well-known paradigm for routing in mobile ad hoc networks. We give several new randomized position-based strategies for routing in mobile ad hoc networks. Our algorithms combine the greedy heuristic of minimizing the distance remaining to the destination and the directional heuristic of staying close to the direction of the destination with the use of randomization to retain some flexibility in the chosen routes. Our experiments show that randomization gives a substantial improvement in the delivery rate over the deterministic greedy and directional routing algorithms. For some of the algorithms we propose, this improvement comes at the expense of only a small deterioration in the stretch factor of the routes.

Keywords

Wireless networks mobile ad hoc networks routing position based routing stretch factor delivery rate 

References

  1. Barriere, L., Fraignaud, P., Narayanan, L., and Opatrny, J. (2001). Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. In Proc. of 5th ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications.Google Scholar
  2. Basagni, S., Chlamtac, I., Syrotiuk, V.R., and Woodward, B.A. (1998). A distance routing effect algorithm for mobility (DREAM). In 4th ACM/IEEE Conference on Mobile Computing and Networking (Mobicom’ 98), pages 76–84.Google Scholar
  3. Bose, P. and Morin, P. (1999). Online routing in triangulations. In 10th Annual International Symposium on Algorithms and Computation (ISAAC’ 99), pages 113–122.Google Scholar
  4. Bose, P., Morin, P., Stojmenovic, I., and J. Urrutia (1999). Routing with guaranteed delivery in ad hoc wireless networks. In 3rd Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM).Google Scholar
  5. Boukerche, A. and Das, S.K. (2003). Congestion control performance of R-DSDV protocol in multihop wireless ad hoc networks. ACM/Kluwer Journal on Wireless Networks, 9(3):261–270.CrossRefGoogle Scholar
  6. Boukerche, A., Das, S.K., and Fabbri, A. (2001). Analysis of randomized congestion control scheme with DSDV routing in ad-hoc wireless networks. Journal of Parallel and Distributed Computing, 61(7):967–995.zbMATHCrossRefGoogle Scholar
  7. Chlamtac, I., Conti, M., and Liu, J. (2003). Mobile ad hoc networking: Imperatives and challenges. Ad Hoc Network Journal, 1(1): 13–64.CrossRefGoogle Scholar
  8. Choi, W. and Das, S.K. (2002). Performance of randomized destination-sequence distance vector (R-DSDV) protocol for congestion control in ad hoc wireless network routing. In Proc. of Applied Telecommunications Symposium-Wireless Track (ATS).Google Scholar
  9. Fevens, T., Haque, I.T., and Narayanan, L. (2004). A class of randomized routing algorithms in mobile ad hoc networks. Submitted for publication.Google Scholar
  10. Finn, G.G. (1987). Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISU/RR-87-180, USC ISI, Marina del Ray, CA.Google Scholar
  11. Giordano, S., Stojmenovic, I., and Blazevic, Lj. (2003). Position based routing algorithms for ad hoc networks: A taxonomy. In Cheng, X., Huang, X., and Du, D.Z., editors, Ad Hoc Wireless Networking. Kluwer.Google Scholar
  12. Johnson, D., Maltz, D., Hu, Y-C., and Jetcheva, J. (2002). The dynamic source routing protocol for mobile ad hoc networks. Technical Report Internet Draft, draft-ietf-manet-dsr-07.txt (work in progress), IETF.Google Scholar
  13. Karp, B. and Kung, H. (2000). GPSR: greedy perimeter stateless routing for wireless networks. In Proc. of 6th ACM Conference on Mobile Computing and Networking (Mobicom’ 00).Google Scholar
  14. Ko, Y.B. and Vaidya, N.H. (1998). Location-aided routing (LAR) in mobile ad hoc networks. In 4th ACM/IEEE Conference on Mobile Computing and Networking (Mobicom’ 98), pages 66–75.Google Scholar
  15. Kranakis, E., Singh, H., and Urrutia, J. (1999). Compass routing on geometric networks. In Canadian Conference on Computational Geometry (CCCG’ 99), pages 51–54.Google Scholar
  16. Liao, W.H., Tseng, Y.C., and Sheu, J.P. (2001). GRID: A fully location-aware routing protocols for mobile ad hoc networks. Telecomm. Systems, 18(1):37–60.zbMATHCrossRefGoogle Scholar
  17. Perkins, C.E. and Bhagwat, P. (1994). Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In ACM SIGCOMM’ 94 Conference on Communications Architectures, Protocols and Applications, pages 234–244.Google Scholar
  18. Perkins, C.E. and Royer, E. (1999). Ad hoc on-demand distance vector routing. In 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages 90–100, New Orleans, LA.Google Scholar
  19. Stojmenovic, I. and Lin, X. (2001). Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(10): 1023–1032.CrossRefGoogle Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • T. Fevens
    • 1
  • I. T. Haque
    • 1
  • L. Narayanan
    • 1
  1. 1.Department of Computer Science and Software EngineeringConcordia UniversityMontrealCanada

Personalised recommendations