A Probabilistic Flooding Algorithm Using Weighting Factor

In this paper, we firstly study the connectivity of ad hoc networks and establish the correlations of connectivity with average node degree. Then, based on the simulation result of connectivity, we present a probabilistic flooding algorithm that can tradeoff the efficiency and reliability by using weighting factor. Thus, we treat the well-known contradictions in our new algorithm. Our simulation results show that, with the choice of an optimal flooding probability by using weighting factor, we can get a great deal of overhead gain with a little loss of packet delivery ratio.