From: Approximation algorithm for data broadcasting in duty cycled multi-hop wireless networks
Notation | Meaning |
---|---|
G(V,E) | Network graph |
N(v) | v’s one-hop neighbors |
T | Scheduling period |
H | Broadcast latency bound |
τ(v) | v’s active slot |
T_{spt}(G) | Shortest path tree (SPT) |
P _{ ij } | Transmissions from S_{ ij } to V_{ ij } |
Rad(G,s) | Maximum depth of paths in T_{spt}(G) |
S _{ ij } | Nodes with rank j that are parents of V_{ ij } |
G[U] | Subgraph of graph G |
U _{ i } | Dominators in layer i |
C | Set of connectors |
L | Maximum layer number |
edc(u,v) | Cost of edge (u,v) |
rank(v) | Rank of node v |
t _{ ij } | Starting transmission time of P_{ ij } |
Depth(G,i) | Depth of nodes in layer i of T_{spt}(G) |
V _{ ij } | Nodes in layer i whose parents have rank of j |