Prove that the flooding mechanism of OLSR works correctly. I.e., if there are two nodes x and y in the network, and if there is a path of bidirectional links between x and y, then a flood originating at x will reach y.   You need to provide a proof by induction on the length of the path between x and y.

In the TC message of OLSR that is created by each node x, x includes its MS set, i.e., a list of nodes that have selected it as an MPR. Assume instead that TC messages created by each node x, let x include its MPR set (rather than its MS set). Will the routing still work properly?

Answer rating: 100% (QA)

To prove that the flooding mechanism of OLSR works correctly we can use induction on the length of t... View the full answer