Data reporting using reporting groups in a computer network

An apparatus operating as a root node in a directed acyclic graph (DAG) in a computer network, comprising:

• one or more network interfaces;
• a processor coupled to the network interfaces and adapted to execute one or more processes;
• and
• a memory configured to store a process executable by the processor, the process when executed operable to:
• determine a topology of a plurality of reporting nodes within the DAG;
• assign each of the reporting nodes to at least one particular reporting group of a plurality of reporting groups based on the topology,
• wherein each of the reporting nodes are grouped so traffic generated by each reporting node in the at least one particular reporting group when reporting has minimal contention with 1) each other reporting node in the at least one particular reporting group and 2) reporting nodes within adjacent reporting groups,
• wherein the minimal contention is measured by estimating an amount of contention each of the reporting nodes would have as packets from each of the reporting nodes propagate uplink toward a root node in the DAG, wherein uplink propagation path diversity is maximized between each of the reporting nodes of the at least one particular reporting group;
• inform the reporting nodes of the reporting groups to which the reporting nodes are assigned, wherein the reporting nodes are allowed to report only during designated time windows corresponding to the reporting groups to which the reporting nodes are assigned;
• and
• adaptively adjust the designated time windows for the one or more reporting groups of the plurality of reporting groups to minimize traffic contention between the reporting nodes.

A method, comprising:

• joining, by a particular reporting node, a directed acyclic graph (DAG) having a topology of a plurality of reporting nodes within a computer network;
• receiving, at the particular node, an assignment for the particular reporting node to an assigned at least one particular reporting group of a plurality of reporting groups based on the topology
• wherein each of the reporting nodes are grouped so traffic generated by each reporting node in the at least one particular reporting group when reporting has minimal contention with 1) each other reporting node in the at least one particular reporting group and 2) reporting nodes within adjacent reporting groups,
• wherein a root node of the DAG measures the minimal contention by estimating an amount of contention each of the reporting nodes would have as packets from each of the reporting nodes propagate uplink toward the root node, wherein uplink propagation path diversity is maximized between each of the reporting nodes of the at least one particular reporting group;
• determining, by the particular node, designated time windows corresponding to the assigned reporting group, wherein the particular reporting node is allowed to report only during the designated time windows;
• and
• reporting, from the particular reporting node, during at least one of the designated time windows.

An apparatus, comprising:

• one or more network interfaces configured to communicate in a directed acyclic graph (DAG) having a topology of a plurality of reporting nodes within a computer network;
• a reporting module configured to generate report information;
• a processor coupled to the network interfaces and adapted to execute one or more processes;
• and
• a memory configured to store a process executable by the processor, the process when executed operable to:
• join the DAG;
• receive an assignment for the particular reporting node to an assigned at least one particular reporting group of a plurality of reporting groups based on the topology,
• wherein each of the reporting nodes are grouped so traffic generated by each reporting node in the at least one particular reporting group when reporting has minimal contention with 1) each other reporting node in the at least one particular reporting group and 2) reporting nodes within adjacent reporting groups,
• wherein a root node of the DAG measures the minimal contention by estimating an amount of contention each of the reporting nodes would have as packets from each of the reporting nodes propagate uplink toward the root node, wherein uplink propagation path diversity is maximized between each of the reporting nodes of the at least one particular reporting group;
• determine designated time windows corresponding to the assigned reporting group, wherein the apparatus is allowed to report only during the designated time windows;
• and
• report the information during at least one of the designated time windows.