Optimized
Optimized
Neighbor Sensing
MPR Selection
5 10
Node B will select C as its
MPR So all the other nodes 3 10
know 60
40
that they can reach B via C
25
D->B route is D-C-B, whose
110 50
bottleneck BW is 3 ( Not BW
optimal) 100
30
Yuyan Xue OLSR Protocol 7
MPR Information Declaration
Sequence number
Topology Table
Each node maintains a Topology Table based on TC
messages
Routing Tables are calculated based on Topology tables
Routing table:
Destination address
Next Hop address
Distance