Maximizing network lifetime of WirelessHART networks under graph routing

Chengjie Wu; Dolvara Gunatilaka; Abusayeed Saifullah; Mo Sha; Paras Babu Tiwari; Chenyang Lu; Yixin Chen

doi:10.1109/IoTDI.2015.43

Maximizing network lifetime of WirelessHART networks under graph routing

Chengjie Wu
, Dolvara Gunatilaka
, Abusayeed Saifullah
, Mo Sha
, Paras Babu Tiwari
, Chenyang Lu
, Yixin Chen

Washington University
Missouri University of Science and Technology
State University of New York at Binghamton

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

40 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	176-186
Number of pages	11
ISBN (Electronic)	9781467399487
DOIs	https://doi.org/10.1109/IoTDI.2015.43
Publication status	Published - 17 May 2016
Externally published	Yes
Event	1st IEEE International Conference on Internet-of-Things Design and Implementation, IoTDI 2016 - Berlin, Germany Duration: 4 Apr 2016 → 8 Apr 2016

Publication series

Name	Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016

Conference

Conference	1st IEEE International Conference on Internet-of-Things Design and Implementation, IoTDI 2016
Country/Territory	Germany
City	Berlin
Period	4/04/16 → 8/04/16

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Keywords

Graph routing
Industrial wireless sensoractuator networks
Network lifetime maximization
WirelessHART

Access to Document

10.1109/IoTDI.2015.43

Cite this

Wu, C., Gunatilaka, D., Saifullah, A., Sha, M., Tiwari, P. B., Lu, C., & Chen, Y. (2016). Maximizing network lifetime of WirelessHART networks under graph routing. In Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016 (pp. 176-186). Article 7471361 (Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IoTDI.2015.43

Wu, Chengjie ; Gunatilaka, Dolvara ; Saifullah, Abusayeed et al. / Maximizing network lifetime of WirelessHART networks under graph routing. Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 176-186 (Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016).

@inproceedings{18d17332fead43ed849a57a6e37cf33e,

title = "Maximizing network lifetime of WirelessHART networks under graph routing",

abstract = "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.",

keywords = "Graph routing, Industrial wireless sensoractuator networks, Network lifetime maximization, WirelessHART",

author = "Chengjie Wu and Dolvara Gunatilaka and Abusayeed Saifullah and Mo Sha and Tiwari, \{Paras Babu\} and Chenyang Lu and Yixin Chen",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 1st IEEE International Conference on Internet-of-Things Design and Implementation, IoTDI 2016 ; Conference date: 04-04-2016 Through 08-04-2016",

year = "2016",

month = may,

day = "17",

doi = "10.1109/IoTDI.2015.43",

language = "English",

series = "Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "176--186",

booktitle = "Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016",

}

Wu, C, Gunatilaka, D, Saifullah, A, Sha, M, Tiwari, PB, Lu, C & Chen, Y 2016, Maximizing network lifetime of WirelessHART networks under graph routing. in Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016., 7471361, Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016, Institute of Electrical and Electronics Engineers Inc., pp. 176-186, 1st IEEE International Conference on Internet-of-Things Design and Implementation, IoTDI 2016, Berlin, Germany, 4/04/16. https://doi.org/10.1109/IoTDI.2015.43

Maximizing network lifetime of WirelessHART networks under graph routing. / Wu, Chengjie; Gunatilaka, Dolvara; Saifullah, Abusayeed et al.
Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 176-186 7471361 (Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Maximizing network lifetime of WirelessHART networks under graph routing

AU - Wu, Chengjie

AU - Gunatilaka, Dolvara

AU - Saifullah, Abusayeed

AU - Sha, Mo

AU - Tiwari, Paras Babu

AU - Lu, Chenyang

AU - Chen, Yixin

PY - 2016/5/17

Y1 - 2016/5/17

N2 - 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.

AB - 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.

KW - Graph routing

KW - Industrial wireless sensoractuator networks

KW - Network lifetime maximization

KW - WirelessHART

UR - https://www.scopus.com/pages/publications/84977636180

U2 - 10.1109/IoTDI.2015.43

DO - 10.1109/IoTDI.2015.43

M3 - Conference contribution

AN - SCOPUS:84977636180

T3 - Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016

SP - 176

EP - 186

BT - Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1st IEEE International Conference on Internet-of-Things Design and Implementation, IoTDI 2016

Y2 - 4 April 2016 through 8 April 2016

ER -

Wu C, Gunatilaka D, Saifullah A, Sha M, Tiwari PB, Lu C et al. Maximizing network lifetime of WirelessHART networks under graph routing. In Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 176-186. 7471361. (Proceedings - 2016 IEEE 1st International Conference on Internet-of-Things Design and Implementation, IoTDI 2016). doi: 10.1109/IoTDI.2015.43

Maximizing network lifetime of WirelessHART networks under graph routing

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this