| New Routing
Algorithm: TB |
|
|
|
|
|
|
|
|
|
|
|
| n | Explained
in previous presentation for MANETs |
|||||||||
| n | Nodes
measure medium busy time, decide whether node is |
|||||||||
| in
congested area based on dynamically determined |
||||||||||
| threshold |
||||||||||
| n | Sender
picks route to destination (here: one of the |
|||||||||
| gateways)
that has lowest number of overloaded nodes |
||||||||||
| n | To
route towards a node in a MESH: have to trigger router |
|||||||||
| discovery
from ALL gateways (or have destination trigger |
||||||||||
| “reverse”
route discovery to all gateways) |
||||||||||
