Industrial Wireless Sensor-Actuator Networks (WSANs) enable Internet of Things (IoT) to be incorporated in industrial plants. The dynamics of industrial environments and stringent reliability requirements necessitate high degrees of fault tolerance. WirelessHART is an important industrial standard for WSANs that have seen world-wide deployments. WirelessHART employs graph routing to enhance network reliability through multiple paths. Since many industrial devices operate on batteries in harsh environments where changing batteries is prohibitively labor-intensive, WirelessHART networks need to achieve a long network lifetime. To meet industrial demand for long-term reliable communication, this paper studies the problem of maximizing network lifetime for WirelessHART networks under graph routing. We first formulate the network lifetime maximization problem and prove it is NP-hard. Then, we propose an optimal algorithm based on integer programming, a linear programming relaxation algorithm and a greedy heuristic algorithm to prolong the network lifetime of WirelessHART networks. Experiments in a physical testbed and simulations show our algorithms can improve the network lifetime by up to 60% while preserving the reliability benefits of graph routing.
['Chengjie Wu', 'Dolvara Gunatilaka', 'Abusayeed Saifullah', 'Mo Sha', 'Paras Babu Tiwari', 'Chenyang Lu', 'Yixin Chen']
Maximizing Network Lifetime of WirelessHART Networks under Graph Routing