We use the notation (P_{x}^{i}) to denote the k-pattern formed by adding a child node labeled by x to the node with position i in P as the rml.
As described in the previous section, alternative nodes can be selected by the composition component either globally based on absolute Q-values, or locally by picking a child node from a sorted list.
There are two possible outcomes for each (P_{x}^{i} otimes P_{y}^{j}): One is obtained by making y a sibling node of x in (P_{x}^{i}) (cousin expansion), the other is obtained by making y a child node of x in (P_{x}^{i}) (child expansion).
Basically, the amount of data received from a child node is the product of the link ETX from that child node and the amount of data that is transmitted by that child node.
For example, the magnitude of the causality (dependency) between a child node and its parent node is greater than that between a child node and its grandparent node.
Therefore, a child node obtains a higher causality score under its parent node than its grandparent node.
Subsequently, the node is inserted as a child node of the closest node that has a minimum distance value.
Let y be a child node and x be its parent node.
Then, the slots allocated to a children node, (n^{l}_{i_{k}}), can be calculated by using Equation (1).
If a child-node has already been mutually-certified with a parent-node ignores post-dated pairwise certification requests send by others.
