Next Article in Journal
Visual-Based SLAM Configurations for Cooperative Multi-UAV Systems with a Lead Agent: An Observability-Based Approach
Next Article in Special Issue
Transmission Scheduling Schemes of Industrial Wireless Sensors for Heterogeneous Multiple Control Systems
Previous Article in Journal
Two-Way Affective Modeling for Hidden Movie Highlights’ Extraction
Previous Article in Special Issue
Protection of Superconducting Industrial Machinery Using RNN-Based Anomaly Detection for Implementation in Smart Sensor
Article Menu

Export Article

Open AccessArticle
Sensors 2018, 18(12), 4242; https://doi.org/10.3390/s18124242

A New Method of Priority Assignment for Real-Time Flows in the WirelessHART Network by the TDMA Protocol

1,†
,
1,2,†,* , 1,†
and
1,†
1
School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China
2
Cyberspace Security Research Center, Pengcheng Laboratory, Shenzhen 518055, China
Current address: Harbin Institute of Technology, Harbin 150001, Heilongjiang, China.
*
Author to whom correspondence should be addressed.
Received: 17 October 2018 / Revised: 27 November 2018 / Accepted: 29 November 2018 / Published: 3 December 2018
(This article belongs to the Special Issue Real-Time Sensor Networks and Systems for the Industrial IoT)
Full-Text   |   PDF [863 KB, uploaded 3 December 2018]   |  
  |   Review Reports

Abstract

WirelessHART is a wireless sensor network that is widely used in real-time demand analyses. A key challenge faced by WirelessHART is to ensure the character of real-time data transmission in the network. Identifying a priority assignment strategy that reduces the delay in flow transmission is crucial in ensuring real-time network performance and the schedulability of real-time network flows. We study the priority assignment of real-time flows in WirelessHART on the basis of the multi-channel time division multiple access (TDMA) protocol to reduce the delay and improve the ratio of scheduled. We provide three kinds of methods: (1) worst fit, (2) best fit, and (3) first fit and choose the most suitable one, namely the worst-fit method for allocating flows to each channel. More importantly, we propose two heuristic algorithms—a priority assignment algorithm based on the greedy strategy for C (WF-C) and a priority assignment algorithm based on the greedy strategy for U(WF-U)—for assigning priorities to the flows in each channel, whose time complexity is O ( m a x ( N m l o g ( m ) , ( N m ) 2 ) ) . We then build a new simulation model to simulate the transmission of real-time flows in WirelessHART. Finally, we compare our two algorithms with WF-D and HLS algorithms in terms of the average value of the total end-to-end delay of flow sets, the ratio of schedulable flow sets, and the calculation time of the schedulability analysis. The optimal algorithm WF-C reduces the delay by up to 44.18 % and increases the schedulability ratio by up to 70.7 % , and it reduces the calculation time compared with the HLS algorithm. View Full-Text
Keywords: WirelessHART network; delay analysis; real-time systems; multi-channel processing; simulation modeling WirelessHART network; delay analysis; real-time systems; multi-channel processing; simulation modeling
Figures

Graphical abstract

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Wu, Y.; Zhang, W.; He, H.; Liu, Y. A New Method of Priority Assignment for Real-Time Flows in the WirelessHART Network by the TDMA Protocol. Sensors 2018, 18, 4242.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top