Thomas Kunz
Systems and Computer Engineering
50
MPR Computation
nMPRs optimize the classical flooding mechanism
nEach node selects its own MPRs from its 1-hop
symmetric
neighbours
nThrough the MPRs all symmetric strict 2-hop
neighbours must be
reached
nRecalculated when symmetric neighbourhoods
change (1-hop or strict 2-hop)