Real-Time Scheduling of Data Flows with Deadlines for Industrial Wireless Sensor Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E102-B No.12 pp.2218-2225
- Publication Date
- 2019/12/01
- Publicized
- 2019/05/27
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2018EBP3294
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Benhong ZHANG
Hefei University of Technology
Yiming WANG
Hefei University of Technology
Jianjun ZHANG
Hefei University of Technology
Juan XU
Hefei University of Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Benhong ZHANG, Yiming WANG, Jianjun ZHANG, Juan XU, "Real-Time Scheduling of Data Flows with Deadlines for Industrial Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E102-B, no. 12, pp. 2218-2225, December 2019, doi: 10.1587/transcom.2018EBP3294.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBP3294/_p
Copy
@ARTICLE{e102-b_12_2218,
author={Benhong ZHANG, Yiming WANG, Jianjun ZHANG, Juan XU, },
journal={IEICE TRANSACTIONS on Communications},
title={Real-Time Scheduling of Data Flows with Deadlines for Industrial Wireless Sensor Networks},
year={2019},
volume={E102-B},
number={12},
pages={2218-2225},
abstract={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.},
keywords={},
doi={10.1587/transcom.2018EBP3294},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Real-Time Scheduling of Data Flows with Deadlines for Industrial Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2218
EP - 2225
AU - Benhong ZHANG
AU - Yiming WANG
AU - Jianjun ZHANG
AU - Juan XU
PY - 2019
DO - 10.1587/transcom.2018EBP3294
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2019
AB - 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.
ER -
English
