Message traffic control capabilities of the R-DSDV protocol in mobile ad hoc networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Dynamic backup routes routing protocol for mobile ad hoc networks
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this paper, we consider a randomized version of the Destination-Sequenced Distance Vector (DSDV) routing protocol for ad hoc networks, called R-DSDV. We are concerned with the capabilities of R-DSDV with respect to distributed congestion control. We present an analytical study based on a novel approach that uses Markov chains representing the distribution of routing information over the network. Our analysis indicates that (i) a probabilistic congestion control scheme based on local tuning of protocol parameters is feasible, and (ii) such a mechanism can be effective in reducing the amount of traffic routed through a node, which is temporarily congested. The traffic reduction is almost linear with respect to the decrease in the R-DSDV routing table advertisement rate of the congested node. On the average, the convergence time is relatively small as compared to the transmission rates of protocol messages.