Repository : ssh://git@open-mesh.org/doc

On branches: backup-redmine/2017-07-13,master

commit 707d3256978e7221cb4aba34957e5d1f29e2d972 Author: Linus Lüssing linus.luessing@c0d3.blue Date: Sun Jul 11 05:01:00 2010 +0000

doc: batman-adv/ELP

707d3256978e7221cb4aba34957e5d1f29e2d972 batman-adv/ELP.textile | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/batman-adv/ELP.textile b/batman-adv/ELP.textile index 0d3de933..91060c4f 100644 --- a/batman-adv/ELP.textile +++ b/batman-adv/ELP.textile @@ -49,6 +49,8 @@ Every node could rebroadcast an OGM i.e. 3 times instead of just once to increas === Adaptive ndp interval ===

=== Probablistic flooding === -Although this does not optimize the convergence speed, it could greatly increase the efficiency of the flooding of broadcast/mulitcast-data packets. With ndp we now also know our neighbors' TQ-values on the same interface. With this information a node A can determine the probability, that a broadcast of node B has already reached all of A's neighbors: P(|N| = |N^+^|) = ∏_{n ∈ N} TQ(B, iface, n) with N being the set of A's neighbors and N^+^ the set of neighbors successfully receiving the broadcast. +Although this does not optimize the convergence speed, it could greatly increase the efficiency of the flooding of broadcast/mulitcast-data packets. With ndp we now also know our neighbors' TQ-values on the same interface. With this information a node A can determine the probability, that a broadcast of node B has already reached all of A's neighbors: + +P(|N| = |N^+^|) = ∏_{n ∈ N} TQ(B, iface, n) with N being the set of A's neighbors and N^+^ the set of neighbors successfully receiving the broadcast.

A node could then either decide with a threshold, if it might not rebroadcast (rebroadcast, if P(|N| = |N^+^|) < 0.9 i.e.). Or more elegantly rebroadcast to a certain probability: 1 - P(|N| = |N^+^|) (or 1 - P(|N| = |N^+^|)^3^ for a more conservative decision i.e.). \ No newline at end of file