“…At time τ , the network topology graph is represented by G(τ ) = (N , L(τ )}, where L(τ ) represents the set of wireless links at time τ , i.e., for link l = (n, n ) ∈ L(τ ), nodes n and n are within the transmission range of each other. 1 We further denote a network path that connects node n s and n d in this graph as P (ns,n d ) (τ ) = (n 1 , n 2 , ...n m ), where (n j , n j+1 ) ∈ L(τ ) for j = 1, ..., m−1, and n 1 = n s , n m = n d . We also use |P(τ )| to denote the path length of P(τ ) (i.e., the number of links in P(τ )).…”