The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
La flexibilité de la communication sans fil la rend de plus en plus largement utilisée dans les scénarios industriels. Pour satisfaire aux exigences strictes de l'industrie en matière de temps réel, diverses méthodes sans fil, notamment basées sur le protocole d'accès multiple par répartition dans le temps, ont été introduites. Dans ce travail, nous effectuons d’abord une analyse mathématique du modèle de réseau et du problème de perte minimale de paquets. Ensuite, un algorithme optimal de planification en temps réel basé sur la méthode de backtracking (RSBT) pour les réseaux de capteurs sans fil industriels est proposé ; cela donne un schéma de planification qui peut atteindre le taux de perte de paquets réseau le plus bas. Nous proposons également un algorithme de planification en temps réel sous-optimal basé sur l'urgence et la concurrence (RSUC). Les résultats de simulation montrent que les algorithmes proposés réduisent efficacement le taux de perte de paquets réseau et le temps de réponse moyen des flux de données. Les performances en temps réel de l'algorithme RSUC sont proches de l'optimum, ce qui confirme l'efficacité de calcul de l'algorithme.
Benhong ZHANG
Hefei University of Technology
Yiming WANG
Hefei University of Technology
Jianjun ZHANG
Hefei University of Technology
Juan XU
Hefei University of Technology
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.
Copier
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
Copier
@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},}
Copier
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 -