A Scheduling Method Based on Packet Combination to Improve End-to-End Delay in TSCH Networks with Constrained Latency

Abstract

Wireless sensor networks (WSN) are networks for gathering data from sensor nodes that have been applied in industry for a long time. In real-time industrial applications with tight latencies, schedulability is one of the most critical issues. Some authors have proposed centralized scheduling algorithms for time-slotted channel hopping (TSCH) networks for real-time applications in industry, however, they have some disadvantages such as schedulability and high data traffic. In this paper, we improve the schedulability, latency, data traffic by dynamically prioritizing packets which are based on number duplex-conflicts and dynamically combining the packets. As a result, we show that the packet-combining algorithm improves schedulability and minimizes the amount of traffic in a network when compared with existing approaches.