Table 1 Commonly used notations

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