Empirical Study and Enhancements of Industrial Wireless Sensor-Actuator Network Protocols

• Published in: IEEE internet of things journal Vol. 4; no. 3; pp. 696 - 704
• Main Authors: Mo Sha, Gunatilaka, Dolvara, Chengjie Wu, Chenyang Lu
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01-06-2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Automation; Bursting; Channel hopping; Channels; Communities; Computer networks; Computer simulation; Correlation; Energy consumption; Energy efficiency; Energy management; Failure; Internet of Things; Internet of Things (IoT); Links; Network reliability; Power efficiency; Protocol (computers); Protocols; Real time; Reliability; Routing; Routing (telecommunications); Series (mathematics); Synchronization; System reliability; Wireless communication; Wireless communications; Wireless networks; Wireless sensor networks; wireless sensor–actuator networks (WSANs); WirelessHART
• ISSN: 2327-4662; 2327-4662
• DOI: 10.1109/JIOT.2017.2653362

Wireless sensor-actuator networks (WSANs) offer an appealing communication technology for process automation applications to incorporate the Internet of Things (IoT). In contrast to other IoT applications, process automation poses unique challenges for industrial WSAN due to its critical demands on reliable and real-time communication. While industrial WSANs have received increasing attention in the research community recently, most published results to date have focused on the theoretical aspects and were evaluated based on simulations. There is a critical need for experimental research on this important class of WSANs. We developed an experimental testbed by implementing several key network protocols of WirelessHART, an open standard for WSANs that has been widely adopted in the process industries based on the HART. We then performed a series of empirical studies showing that graph routing leads to significant improvement over source routing in terms of worst-case reliability, but at the cost of longer latency and higher energy consumption. It is therefore important to employ graph routing algorithms specifically designed to optimize latency and energy efficiency. Our studies also suggest that channel hopping can mitigate the burstiness of transmission failures; a larger channel distance can reduce consecutive transmission failures over links sharing a common receiver. Based on these insights, we developed a novel channel hopping algorithm that utilizes far away channels for transmissions. Furthermore, it prevents links sharing the same destination from using channels with strong correlations. Our experimental results demonstrate that our algorithm can significantly improve network reliability and energy efficiency.