dtnrg-6----Page:8
1 2 3 4 5 6 7 8 9 10 11
|
Visibility -> Comms. Schedule Various algorithms possible Minimal: Attempt to ensure that each node gets a chance to talk to at least one mule during a given schedule period Filled: As above but iterate to try to “fill-in” all gaps until no change or configured limit reached (this is the default) Could envisage others too, e.g. Giving configured weights to nodes, or more interestingly basing such weights on actual measured network stats Various random schemes |