Abstract
Time-slotted channel hopping (TSCH) is a part of an emerging IEEE 802.15.4e standard to enable deterministic low-power mesh networking, which offers high reliability and low latency for wireless industrial applications. Nonetheless, the standard only provides a framework, but it does not mandate a specific scheduling mechanism for time and frequency slot allocation. This paper focuses on a centralized scheme to schedule multiple concurrent periodic real-time flows in TSCH networks with mesh topology. In our scheme, each flow is assigned a dynamic priority based on its deadline and the hops remaining to reach the destination. A maximum matching algorithm is utilized to find conflict-free links, which provides more chances to transfer high-priority flows at each time slot. Frequency allocation is implemented by graph coloring to make finally selected links interference free. Simulation results show that our algorithm clearly outperforms the existing algorithms on the deadline satisfaction ratio with a similar radio duty cycle.
Highlights
Low-power wireless networks have been regarded as a key enabler for the Internet of things (IoT)
Our scheduling of periodic realtime flow (SPRF) addresses the more general case of traffic flows between multiple source-destination pairs. ere are some existing methods such as Low-latency scheduling function (LLSF) and Adaptive MUltihop Scheduling (AMUS) that can deal with mesh topology and general traffic pattern
A central scheduling entity is in charge of supervisory control of network traffic flows and management, which computes the optimized time slot and channel assignment for the Time-slotted channel hopping (TSCH) Medium Access Control (MAC). is scheduling entity can be implemented at a powerful node such as gateway node or at the backbone
Summary
Low-power wireless networks have been regarded as a key enabler for the Internet of things (IoT). Erefore, scheduling algorithm assigning links to nodes for data transmission is a key element in the TSCH network, which needs to be built carefully and according to the speci c requirements of the application. Strict performance requirements often lead to relatively stable network topology and fixed data flows, which is more suitable to adopt the centralized scheduling mechanism. Ey transform the construction of a duplex-conflict-free and interference-free schedule into an optimization problem, solving it by using graphs or metaheuristic algorithms They assume the network has a multipoint-to-one-point traffic and treelike topology.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
