Abstract
Ad hoc wireless networks are composed of mobile nodes communicating through wireless links, without any fixed backbone infrastructure. Frequent topology changes due to node mobility make routing in such dynamic networks a challenging problem. Moreover, successful message routing implies every mobile node is potentially capable of acting as a router, thus supporting store-and-forward mechanisms. However, resource limitations on these nodes also require a control on congestion due to message forwarding. In this paper, we consider our recently proposed randomized version of the well-known Destination-Sequenced Distance Vector (DSDV) routing protocol, referred to as R-DSDV, and validate its performance through extensive simulation experiments. Our results demonstrate that a probabilistic control on message traffic based on local tuning of protocol parameters is feasible, and that R-DSDV outperforms the basic DSDV protocol by significantly reducing the average queue size associated with each mobile node and hence the average packet delay.
Similar content being viewed by others
References
B. Bajaj et al., Improving simulation for network research, Technical report 99-702, University of Southern California (March 1999).
A. Boukerche, Simulation-based performance evaluation of randomized dynamic routing protocol in mobile ad hoc wireless networks, UNT Technical report (2003).
A. Boukerche and S. Rogers, GPS query optimization in mobile and wireless ad hoc networking, in: 6th IEEE Symposium on Computers and Communications (July 2001) pp. 198-203.
A. Boukerche, Performance analysis of ad-hoc routing protocols, in: 20th IEEE International Conference on Performance, Computing and Communications (2001) pp. 171-178.
A. Boukerche, S.K. Das and A. Fabbri, Analysis of a randomized congestion control scheme with DSDV routing in ad hoc wireless networks, Journal of Parallel Distributed Computing 61(7) (July 2001) 967-995.
J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, in: Proceedings of ACMMobiCom'98, Dallas, TX (October 1998) pp. 85-97.
M. Bui, S.K. Das, A.K. Datta and D.T. Nguyen, Randomized mobile agent based routing in wireless networks, International Journal on Foundations of Computer Science 12(3) (June 2001) 365-384.
Z.J. Haas and M.R. Pearlman, The performance of query control schemes for the zone routing protocol, in: Proceedings of ACM SIGCOMM'98, Vancouver, BC, Canada (September 1998) pp. 167-177.
P. Johansson, T. Larsson, N. Hedman, B. Mielczarek and M. Degermark, Scenario-based performance analysis of routing protocols for mobile ad-hoc networks, in: MobiCom'99, Seattle, WA (August 1999).
D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H.F. Korth (Kluwer Academic, 1996) chapter 5, pp. 153-181.
M. Kijima, Markov Processes for Stochastic Modeling (Chapman & Hall, 1997).
G.S. Lauer, Packet-Radio Routing, in: Routing in Communications Networks, ed. M.E. Steenstrup (Prentice-Hall, 1995) chapter 11, pp. 351- 396.
C. Lee, J.E. Burns and M.H. Ammar, Improved randomized broadcast protocols in multi-hop radio networks, in: Proceedings of the International Conference on Network Protocols, San Francisco, CA (October 1993) pp. 6-13.
G.S. Malkin and M.E. Steenstrup, Distance-vector routing, in: Routing in Communications Networks, ed. M.E. Steenstrup (Prentice-Hall, 1995) chapter 3, pp. 83-98.
J. Moy, Link-state routing, in: Routing in Communications Networks, ed. M.E. Steenstrup (Prentice-Hall, 1995) chapter 5, pp. 135-157.
S. Murthy and J.J. Garcia-Luna-Aceves, An efficient routing protocol for wireless networks, Mobile Networks and Applications 1 (1996) 183-197.
V.D. Park and M. Scott Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proceedings of IEEE INFOCOM'97, Kobe, Japan (April 1997) pp. 1405-1413.
C.E. Perkins, Ad Hoc Networking (Addison-Wesley, 2001).
C.E. Perkins, Ad hoc on demand distance vector (AODV) routing, IETF Internet Draft (November 1998) http://www.ietf.org/ internet-drafts/draft-ietf-manet-aodv-02.txt
C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance vector routing (DSDV) for mobile computers, in: Proceedings of ACM SIGCOMM'94, London, UK (August-September 1994) pp. 234-244.
C.E. Perkins and P. Bhagwat, Routing over multi-hop wireless network of mobile computers, in: Mobile Computing, eds. T. Imielinski and H.F. Korth (Kluwer Academic, 1996) chapter 6, pp. 183-205.
S. Ramanathan and M.E. Steenstrup, A survey of routing techniques for mobile communications networks, Mobile Networks and Applications 1 (1996) 98-104.
M. Scott Corson and A. Ephremides, A distributed routing algorithm for mobile wireless networks, Wireless Networks 1 (1995) 61-81.
C.K. Toh, Ad Hoc Mobile Wireless Networks (Prentice Hall, 2002).
UCB/LBNL/VINT Network Simulator, http://www-mash.cs. berkeley.edu/ns/
A. Boukerche, J. Linus and A. Sauraban, A performance study of dynamic source routing protocols for mobile and wireless ad hoc networks, in: ACM/IFIP EuroPar'2002 Conference, Lecture Notes in Computer Science, Vol. 2400 (2002) pp. 957-964.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boukerche, A., Das, S.K. Congestion Control Performance of R-DSDV Protocol in Multihop Wireless Ad Hoc Networks. Wireless Networks 9, 261–270 (2003). https://doi.org/10.1023/A:1022881328679
Issue Date:
DOI: https://doi.org/10.1023/A:1022881328679