A Performance Study of Distance Source Routing Based Protocols for Mobile and Wireless ad Hoc Networks

  • Authors:
  • Azzedine Boukerche;Joseph Linus;Agarwal Saurabha

  • Affiliations:
  • -;-;-

  • Venue:
  • Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we focus upon the distance source routing (DSR) protocol. First, we describe an optimization scheme, which we refer to as GDSR, a reactive protocol that makes use of DSR scheme and the Global positioning system (GPS). As opposed to the DSR protocol GDSR consists of propagating the route request messages only to the nodes that are further away from the query source. Next, we consider a randomized version of both DSR and GDSR algorithms, which we refer to as RDSR and GDSR respectively. We discuss the algorithms, their implementation and present the experimental results we have obtained to study their performance. Our results clearly indicate that the GDSR protocol outperforms the DSR protocol by significantly decreasing the number of route query packets thereby increasing the efficiency of the network load. Our simulations experiments show that GPS screening and randomization paradigm are very effective in improving the performance of DSR under various performance conditions. Our results also indicate that a probabilistic congestion control scheme based on local tuning of protocol parameters is feasible, and that such a mechanism can be effective in reducing the amount of traffic routed through a node which is temporarily congested.