Message traffic control capabilities of the R-DSDV protocol in mobile ad hoc networks
Azzedine Boukerche, Sajal Kumar Das, Alessandro Fabbri · 2001
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.