| MPR computation (3) |
|
|
|
|
|
|
|
|
|
|
| 1. | MPR
set = Ø |
||||||||
| 2. | MPR
+= 1-hop neighbors with willingness=Will_always |
||||||||
| 3. | MPR
+= 1-hop neighbors that are the only ones reaching |
||||||||
| a
2-hops neighbor |
|||||||||
| 4. | Remove
the 2-hop neighbors reached by the MPRs |
||||||||
| 5. | Add
1-hop nodes (to the MPR set) providing maximum |
||||||||
| reachability
of 2-hop neighbors UNTIL reaching all 2- |
|||||||||
| hop
neighbors. |
|||||||||
