Message traffic control capabilities of the R-DSDV protocol in mobile ad hoc networks

ABSTRACT

Mobile and wireless Ad hoc networks are composed of mobile stations communicating through wireless links, without any fixed backbone support. Frequent topology changes caused by node mobility make routing in ad hoc wireless networks a challenginq problem. Message routing requires mobiles to act as routers, by means of store and forward mechanisms. However, limitations on capabilities of mobiles require a control on node congestion due to message forwarding. In this paper, we consider a randomized version of the Destination-Sequenced Distance Vector (DSDV) routing protocol, which we refer to as R-DSDV. We discuss the DSDV algorithm as well as the congestion control mechanism used within the R-DSVD protocol. We also address the feasibility of congestion control using a congestion-related routing metric, the effectiveness of which is evaluated through a probabilistic model. Finally, we report on the simulation experiments we carried out to evaluate and assess the R-DSDV's performance on the ns simulator.

References

1. 1.A. Boukerche, "Simulation-Based Study of On- Demand Routing Ad hoc Routing Protocols for Ad hoc Wireless Networks" 34th Annual Simulation Symposium 2001, pp. 85-92.
2. 2.A. Boukerche, "Performance Evaluation of Randomized Ad Hoc Routing Protocols" Tech. Report, UNT, In preparation.
3. 3.A. Boukerche, S. K. Das and A. Fabbri "Analysis of Randomized Congestion Control in DSDV Routing", 8th IEEE/ACM Syrup. MASCOTS'2000, pp. 65-72.
4. 4.A. Boukerchei S. Roger "Performance Evaluation of GZRP Ad Hoc Routing Protocol" Int;1 Symposium on Computer and Communications, 2001.
5. 5.M. Bui, S.K. Das, A.K. Datta, D.T. Nguyen, Randomized Mobile Agent Based Routing in Wireless Networks, in the Proceedings of the 7th International Colloquium on Structural Information and Computational Complexity (SIROCCO'2000).
6. 6.Z.J. Haas, M.R. Pearlman, The Performance of Query Control Schemes for the Zone Routing Protocol, Proceedings of ACM SIGCOMM'98, Vancouver, B.C., Canada (September 1998), 167-177.
7. 7.D.B. Johnson, D.A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, in: Mobile Computing, Editors: T. Imielinski and H.F. Korth (Kluwer Academic Publishers, 1996), Ch.5, 153-181.
8. 8.M. Kijima, Markov Processes for Stochastic Modeling (Chapman & Hall, 1997).
9. 9.G.S. Lauer, Packet-Radio Routing, in: Routing in Communications Networks, Editor: M.E. Steenstrup (Prentice-Hall, 1995), Ch.ll, 351-396.
10. 10.C. Lee, J.E. Burns, M.H. Ammax, Improved Randomized Broadcast Protocols in Multi-hop Radio Networks, Proceedings of the International Conference on Network Protocols, San Francisco, California, USA (October 1993), 6-13.
11. 11.G.S. Malkin, M.E. Steenstrup, Distance-Vector Routing, in: Routing in Communications Networks, Editor: M.E. Steenstrup (Prentice-Hall, 1995), Ch.3, 83- 98.
12. 12.J. Moy, Link-State Routing, in: Routing in Communications Networks, Editor: M.E. Steenstrup (Prentice- Hall, 1995), Ch.5, 135-157.
13. 13.S. Murthy, J.J. Garcia-Luna-Aceves, An Efficient Routing Protocol for Wireless Networks, Mobile Networks and Applications, Vol.1 (1996), 183-197.
14. 14.V.D. Park, M. Scott Corson, A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks, Proceedings of IEEE INFOCOM'97, Kobe, Japan (April 1997), 1405-1413.
15. 15.C.E. Perkins, Ad Hoc On Demand Distance Vector (AODV) Routing, IEFT Internet Draft, (November 1998).
16. 16.C.E. Perkins, P. Bhagwat, Highly Dynamic Destination-Sequenced Distance Vector Routing (DSDV) for Mobile Computers, Proceedings of ACM SIGCOMM'94, London, UK (Aug-Sept 1994), 234-244.
17. 17.C.E. Perkins, P. Bhagwat, Routing over Multi-Hop Wireless Network of Mobile Computers, in Mobile Computing, Editors: T. Imielinski and H.F. Korth (Kluwer Academic Publishers, 1996), Ch.6, 183-205.
18. 18.S. Ramanathan, M.E. Steenstrup, A Survey of Routing Techniques for Mobile Communications Networks, Mobile Networks and Applications, Vol.1 (1996), 98- 104.
19. 19.M. Scott Corson, A. Ephremides, A Distributed Routing Algorithm for Mobile Wireless Networks, Wireless Networks, Vol.1 (1995), 61-81.

Index Terms

• Computing methodologies

  • Modeling and simulation

    • Model development and analysis

      • Model verification and validation

    • Simulation evaluation

• Mathematics of computing

  • Probability and statistics

    • Probabilistic representations

      • Markov networks

    • Stochastic processes

      • Markov processes

• Networks

  • Network protocols

  • Network types

    • Mobile networks

    • Wireless access networks

• Theory of computation

  • Design and analysis of algorithms

    • Approximation algorithms analysis

      • Routing and network design problems

  • Theory and algorithms for application domains

    • Machine learning theory

      • Markov decision processes