Abstract
Techniques are described herein for an executable greedy algorithm of data collection to produce an optimal strategy which may decrease congestion of packets and increase overall efficiency. This may be used to divide Low power and Lossy Network (LLN) nodes into groups and arrange the regular report schedule for all the nodes. First, the Routing Protocol for LLN (RPL) tree may be pulled from a router and the topology matrix generated. Second, the constraint condition of data transmission may be listed according to network transmission characteristics. Third, the state transition equation may be solved and an optimal schedule selected. Fourth, the schedule may be implemented with a Head-End System (HES).
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Jiang, Caijun; Zhu, Dapeng; Zhang, Xiaopu; and Zhang, Zaochun, "DYNAMIC OPTIMAL DATA COLLECTION BY GREEDY ALGORITHM IN LOW POWER AND LOSSY NETWORKS", Technical Disclosure Commons, (July 17, 2018)
https://www.tdcommons.org/dpubs_series/1329