Information Technology Reference
In-Depth Information
F
IG
. 8. Children of each root.
weighted as “0;” otherwise, it is weighted as “1.” Each added node is tem-
porarily tagged as “C
0
.”
Figure 8
shows a snap shot of the example after this
step.
(5)
Root label update
: Once the whole set of requested objects is analyzed
and the access forest is generated, the conflict labels of the nodes of each
tree are updated. This process starts with the root of each tree. If a root
is in conflict with any other root(s), a label of “C
1
” is assigned to all the
roots involved in the conflict. Otherwise the preset value of “C
0
” is main-
tained.
(6)
Node label update
: Step 5 will be applied to the nodes in the same level of
each access tree in the access forest. As in step 5, a value of “C
1
” is assigned
to the nodes in conflict.
(7)
Sequence selection
: The generation of the access forest then allows the se-
lection of the suitable access patterns in an attempt to reduce the network
latency and power consumption. A suitable access pattern is equivalent to the
selection of a tree branch that
Has the most conflicts with other branches;
Allows more objects to be pulled off the air channels; and
Requires the least number of channel switches.
