
284
Wireless Ad Hoc and Sensor Networks
and aggregation meaningful, we also assume that the network is connected. Then,
by the same method in Section 11.5, a CDS-based data collection tree T can be
constructed. Therefore, we can still exploit DDC and DDA to finish data collection
and aggregation tasks under the Poisson distribution model. Now, we analyze the
delay performance of DDC and DDA.
Let R = R
0
-PCR =(
α
c
2
(2
R
0
/W
−1)+1) ·r =
κ
·r.Wefirst analyze the aver-
age/upper bound of the number of sensor nodes within the CR of a node as shown in
the following lemma.
Lemma 11.5
Let the random variable X denote the number of sensor nodes within the CR of a
node. ...