
242
Wireless Ad Hoc and Sensor Networks
10.5.2 Pipeline Scheduling
Thanks to the benefit brought by CDG, we can address the CDC problem with
the pipeline technique. From the building process of the routing tree T , we know
that the nodes in T can be divided into sets by levels D
e
,D
L
,C
L
−1
,D
L
−1
,
C
L
−2
,...,D
1
,C
0
,D
0
= {s
0
|s
0
is the sink} in a bottom-up way, where D
e
is the set
of all the dominatees, i.e., leaf nodes, D
i
(0 ≤ i ≤