An Alternative to Zigbee Routing Using a Cycles Description of a Planar Graph
Cristian E. Onete, Maria Cristina C. Onete · 2019
In this paper a new alternative routing algorithm suitable for, inter alia, static Hamiltonian Zigbee and Hamiltonian mesh networks is shown. The algorithm is based on the cycle description of the graph, and we show that it can provide some advantages when compared to the classical path-finding used in Zigbee. We also give examples and discuss how far our method can also be successfully applied beyond Hamiltonian graphs, providing speedups with respect to node-based hopping algorithm.