
78
Wireless Ad Hoc and Sensor Networks
The independent node with smallest node ID is put into D
0
. Clearly, |D
0
| = 1.
All the independent nodes in the two-hop neighborhood of the nodes in D
ι
−1
(not
in
ι
−1
k=0
D
k
) are put into D
ι
.
ι
is called the level of the independent node in D
ι
, i.e., D
ι
represents the set of independent nodes of level
ι
in G with respect to the node in
D
0
. Additionally, suppose the maximum level of an independent node is L. For each
0 ≤ i ≤ L −1, let S
i
be the set of the nodes adjacent to at least one node in D
i
and
at least one node in D
i+1
. Subsequently, compute a minimal set of nodes C
i
⊆ S
i
to
cover node set D
i+1
.LetC =
L−1
i=0
C
i
and therefore ...