Techniques are described for sharing a network between flows that follow a deterministic hopping sequence (same sequence for all) and flows that follows a best effort hopping sequence (which depends on the receiver Media Access Control (MAC) address for unicast). This is accomplished by moving the best effort channel in case of a collision in a manner that can be predicted by the sender and that maintains the pseudo-randomness of the selection.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Thubert, Pascal; She, Huimin; and Chen, Charlie, "ENABLING DETERMINISM IN A BEST EFFORT HOPPING SEQUENCE TIME SLOTTED CHANNEL HOPPING MESH", Technical Disclosure Commons, (May 23, 2018)