Mobility Graph
The mobility graph G is a directed graph.
All vertices are of the form (x, t) where x is a cell in the network, and t is a time slot.
A edge exists between two vertices, say (x1, t1) and (x2, t2), in the mobility graph if and only if:
- (1) d(x1, x2) „T 1,
- (2) t2 = t1 + 1.
- static edge: (x, t) to (x, t +1)
- A dynamic edge: (x1, t) to (x2, t +1)