TY - JOUR
T1 - Reliability and Temporality Optimization for Multiple Coexisting WirelessHART Networks in Industrial Environments
AU - Jin, Xi
AU - Kong, Fanxin
AU - Kong, Linghe
AU - Liu, Wei
AU - Zeng, Peng
N1 - Funding Information:
Manuscript received May 25, 2016; revised December 13, 2016 and February 9, 2017; accepted February 21, 2017. Date of publication March 14, 2017; date of current version July 10, 2017. This work was supported in part by the National Natural Science Foundation of China under Grant 61502474, Grant 61233007, and Grant 61501447, and in part by the Youth Innovation Promotion Association of the Chinese Academy of Sciences. (Corresponding author: Peng Zeng.) X. Jin and P. Zeng are with the Laboratory of Networked Control Systems, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China (e-mail: jinxi@sia.cn; zp@sia.cn).
Publisher Copyright:
© 1982-2012 IEEE.
PY - 2017/8
Y1 - 2017/8
N2 - WirelessHART is a networking technology that is widely used in industrial wireless sensor networks. Its reliability and real-time performance are essential to industrial production. Many works have studied these two aspects, primarily focusing on a single WirelessHART network. However, multiple WirelessHART networks usually coexist in a real industrial environment. Applying existing approaches to such coexisting networks would cause performance degradation due to communication interference among these networks. In this paper, we propose a holistic framework that optimizes both reliability and temporality for multiple coexisting networks. The framework consists of two levels. The upper level targets communication channel management, and the lower level addresses data flow scheduling. For the upper level, we propose a network isolation algorithm that improves the data transmission reliability through dynamically adjusting channel assignments to different WirelessHART networks. For the lower level, we propose data flow scheduling algorithms that guarantee the temporality of data flows within each isolated network. These algorithms minimize the number of channels reserved by each isolated network and further enhance the transmission reliability through alleviating channel resource contention. We conduct trace-driven simulations of the channel management algorithm, and the results demonstrate that our algorithm exhibits stable performance and reduces packet loss by $36\%$. For the scheduling algorithms, the simulations demonstrate that in contrast with existing algorithms, the greater the number of coexisting networks, the fewer resources our algorithms use. When eight networks coexist, our algorithms outperform existing ones by consuming up to $63\%$ fewer channel resources.
AB - WirelessHART is a networking technology that is widely used in industrial wireless sensor networks. Its reliability and real-time performance are essential to industrial production. Many works have studied these two aspects, primarily focusing on a single WirelessHART network. However, multiple WirelessHART networks usually coexist in a real industrial environment. Applying existing approaches to such coexisting networks would cause performance degradation due to communication interference among these networks. In this paper, we propose a holistic framework that optimizes both reliability and temporality for multiple coexisting networks. The framework consists of two levels. The upper level targets communication channel management, and the lower level addresses data flow scheduling. For the upper level, we propose a network isolation algorithm that improves the data transmission reliability through dynamically adjusting channel assignments to different WirelessHART networks. For the lower level, we propose data flow scheduling algorithms that guarantee the temporality of data flows within each isolated network. These algorithms minimize the number of channels reserved by each isolated network and further enhance the transmission reliability through alleviating channel resource contention. We conduct trace-driven simulations of the channel management algorithm, and the results demonstrate that our algorithm exhibits stable performance and reduces packet loss by $36\%$. For the scheduling algorithms, the simulations demonstrate that in contrast with existing algorithms, the greater the number of coexisting networks, the fewer resources our algorithms use. When eight networks coexist, our algorithms outperform existing ones by consuming up to $63\%$ fewer channel resources.
KW - Channel management
KW - industrial environment
KW - scheduling algorithms
KW - wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85029589347&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85029589347&partnerID=8YFLogxK
U2 - 10.1109/TIE.2017.2682005
DO - 10.1109/TIE.2017.2682005
M3 - Article
AN - SCOPUS:85029589347
SN - 0278-0046
VL - 64
SP - 6591
EP - 6602
JO - IEEE Transactions on Industrial Electronics
JF - IEEE Transactions on Industrial Electronics
IS - 8
M1 - 7878578
ER -