Re: [manet] CDS robustness research repport

[Philippe Jacquet <philippe.jacquet at inria.fr>]

Hello, Richard,

Thank you for your comment and results. You made very interesting 
remarks. It was already pointed out by Dai and Wu that neighbor 
designated algorithms are more robust.

MPR based CDS uses only two hop information as well as MPR selection in 
OLSR, no need of three hop information. It is  a little less efficient 
than MPR flooding but as resilient and does not need last hop 
identification for broadcasting data, this is why it is in our SMURF 
draft for data broadcast.

"Rule k" algorithm is originally from Dai and Wu, this is a 
generalization of previous rule k=1,2,3 algorithms of Wu Li that are 
very heavy on computation, k=infinity is more efficient and easier to 
implement. It also needs two hop information as with MPR. I think your 
MDR algorithm is a kind of adaptation of rule k=infinity.

I was not aware of the stretch factor effect, this is an interesting 
remark.

Best regards,
Philippe

_______________________________________________
manet mailing list
manet at ietf.org
https://www1.ietf.org/mailman/listinfo/manet