The pure flooding is considered the common mechanism have been proposed to distribute the Route Request Packet in DSR protocol. This strategy is simple and easy to implement but it suffers from a serious problem lead to the broadcast storm problem. There are several probabilistic approaches are used to overcome this problem. In this study we developed a mathematical model that can be used locally by each node within the network to calculate a retransmission probability (pt) as a function of number of first-hop neighbors (k). In order to evaluate the performance of the proposed algorithm, a number of scenarios were simulated using the MANET Simulator (MANSim). The performance of the new model was evaluated and compared with pure and other probabilistic algorithms to estimate the enhancement it achieves over the current probabilistic algorithms. The model enhances the performance of probabilistic broadcast by increasing network reachability with an acceptable increase in the number of transmissions especially in the low and moderate node density.
展开▼
机译：纯洪泛被认为是提出了在DSR协议中分发路由请求包的通用机制。该策略简单易行，但存在严重问题，导致广播风暴问题。有几种概率方法可用来克服此问题。在这项研究中，我们开发了一种数学模型，该模型可被网络中的每个节点本地使用，以计算作为第一跳邻居数（k）的函数的重传概率（p t ）。为了评估所提出算法的性能，使用MANET Simulator（MANSim）模拟了许多场景。对新模型的性能进行了评估，并将其与纯概率算法和其他概率算法进行比较，以评估其在当前概率算法上的增强效果。该模型通过增加网络的可达性来提高概率广播的性能，并且传输数量可以接受地增加，尤其是在中低节点密度的情况下。
展开▼
