Adaptive Time Slot Allocation in TSCH Wireless Communication Networks

Abstract

The present application discloses adaptive time slot allocation in a TSCH wireless communication network. In the described example, excessive delay and power consumption are avoided when a large number of leaf nodes (LNs) simultaneously compete to join a time-slotted channel hopping wireless communication network, wherein the time-slotted channel hopping wireless communication network has a root node (RN) connected to the LNs through one or more intermediate nodes (IN) interfaces. A first plurality (B) of shared transmit / receive slots (STRSs) are allocated to at least one IN, and a second plurality (C) of STRSs are advertised for use by competing LNs (27), wherein the first plurality is greater than the second plurality. As LNs join, their STRSs are redefined (29) such that the majority become shared transmit-only slots (STOSs) and no STRSs are reserved. The number of STRSs allocated to an IN can vary inversely with the number of hops from the IN to the RN. One or more STOSs (26) can be added for each of the one or more INs in response to predetermined network conditions (25).

Images