Abstract
Techniques are presented herein that support a deterministic collection method in the form of a scheduled pull mechanism, whereby a collection point may compute a schedule and then distribute the same so that all of the collecting nodes and network nodes can optimally transmit, aggregate, and relay information to the collection point. Under aspects of the presented techniques, a distributed set may be organized as a Destination-Oriented Directed Acyclic Graph (DODAG) topology to the collection point. The above-described schedule may then be generated whereby the DODAG parents emit only after all of their children (and, recursively, all of their descendants) have emitted. Under such an approach, an application-aware parent can aggregate (or factorize) the data and consume minimal bandwidth. A second schedule may be generated just for missing data, accounting only for the sources where information was lost, so that retry operations comprise smaller schedules.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Thubert, Pascal; Henry, Jerome; and Wetterwald, Patrick, "DETERMINISTIC INFORMATION PULL AND AGGREGATION IN A DESTINATION-ORIENTED DIRECTED ACYCLIC GRAPH (DODAG) TOPOLOGY", Technical Disclosure Commons, (July 13, 2023)
https://www.tdcommons.org/dpubs_series/6045