| ... | ... | @@ -421,6 +421,8 @@ There's a contact between `A` and `B` beginning at `t2` and ending at `t3`, and |
|
|
|
In the finished graph, we can see that if we start from device `A` at time `t1` it's possible to reach `B` at `t2` and `C` at `t4`.
|
|
|
|
On the other hand, if we start from `C` at `t1`, we reach `B` at `t4` and we can't reach `A` at all.
|
|
|
|
|
|
|
|
Thus, unlike a static contact graph, the dynamic contact graph captures the fact that there's a delay-tolerant path from `A` to `C` but not vice versa, because the contact between `A` and `B` happens before the contact between `B` and `C`.
|
|
|
|
|
|
|
|
## Dynamic Reachability Analysis
|
|
|
|
|
|
|
|
By building a dynamic contact graph for each dataset we can begin to study which devices are reachable from which others at which times, which tells us which devices would potentially be able to send messages to each other in a delay-tolerant network.
|
| ... | ... | |
| ... | ... | |
