Enhancing the Performance of the DNDP Algorithm
Hussein Al-Bahadili, Ghassan F. Issa, Alia Sabri · International Journal of Wireless & Mobile Networks · 2011
A novel dynamic noise-dependent probabilistic (DNDP) route discovery algorithm was recently developed to enhance the performance of the dynamic probabilistic algorithm in noisy mobile ad hoc networks (MANETs).In this algorithm, the mathematical model for calculating node retransmission probability (p t ) is calculated as a function of two independent variables: number of first-hop neighbors (k) and probability of reception (p c ).The model also shows another independent variable, namely, the maximum retransmission probability that can be assigned to the transmitting node (p t,pcmin ), which is assumed to be a fixed value.In this paper, we propose a new mathematical model for calculating p t .In this new model p t,pcmin is calculated as a function of k.The performance of the DNDP algorithm using fixed and k-dependent p t,pcmin is evaluated through simulations.The simulation results showed that the new model enhances the performance of the DNDP algorithm as it significantly reduces the number of retransmissions at an insignificant reduction in the network reachability.