Abstract
Techniques are described herein for generating a non-interfering sequence. This mechanism mainly comprises two steps. The first step involves computing and generating a schedule, and the second step involves receiving metering data from all nodes. After the second step ends, the head end system builds a residual node set containing all nodes that failed to report data in a given schedule, and then the first and second steps are repeated until the residual set is empty. The two steps are performed serially. The techniques described herein optimize these two steps. In particular, first a system mathematical mode is built from a Routing Protocol for Low-Power and Lossy Networks (RPL) p-table and link neighbor, second the constraint condition is constructed, and third the parameter is adjusted and the schedule is implemented.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Jiang, Caijun; Zhu, Dapeng; Meng, Yiyun; and Zhang, Xiaopu, "NON-INTERFERING SEQUENCE FOR MASSIVE DATA TRAFFIC IN LOW-POWER LOSSY NETWORKS", Technical Disclosure Commons, (September 21, 2018)
https://www.tdcommons.org/dpubs_series/1524