Real-Time Scheduling of Data Flows with Deadlines for Industrial Wireless Sensor Networks

Benhong ZHANG  Yiming WANG  Jianjun ZHANG  Juan XU  

IEICE TRANSACTIONS on Communications   Vol.E102-B   No.12   pp.2218-2225
Publication Date: 2019/12/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.2018EBP3294
Type of Manuscript: PAPER
Category: Network
industrial wireless sensor networks,  data flow scheduling algorithm,  real-time performance,  

Full Text: PDF(1.4MB)>>
Buy this Article

The flexibility of wireless communication makes it more and more widely used in industrial scenarios. To satisfy the strict real-time requirements of industry, various wireless methods especially based on the time division multiple access protocol have been introduced. In this work, we first conduct a mathematical analysis of the network model and the problem of minimum packet loss. Then, an optimal Real-time Scheduling algorithm based on Backtracking method (RSBT) for industrial wireless sensor networks is proposed; this yields a scheduling scheme that can achieve the lowest network packet loss rate. We also propose a suboptimal Real-time Scheduling algorithm based on Urgency and Concurrency (RSUC). Simulation results show that the proposed algorithms effectively reduce the rate of the network packet loss and the average response time of data flows. The real-time performance of the RSUC algorithm is close to optimal, which confirms the computation efficiency of the algorithm.