Specific Controlled Flooding Schemes for DNT

Here we will study different controlled flooding schemes. We are careful to base our schemes on simple, non-chatty and elegant algorithms. This is because in sparse and highly mobile networks, complex or chatty algorithms waste the short time nodes have when they come within range of each other. The schemes we introduce are the following:

1) Basic Probabilistic (BP): When talking about the willingness of a node in the previous section, we implied that forwarder nodes have the same willingness as the sender node