Distributed Graph Routing for WirelessHART Networks
Abstract
Communication reliability in a Wireless Sensor and Actuator Network (WSAN) has a high impact on stability of industrial process monitoring and control. To make reliable and real-Time communication in highly unreliable environments, industrial WSANs such as those based on WirelessHART adopt graph routing. In graph routing, each packet is scheduled on multiple time slots using multiple channels, on multiple links along multiple paths on a routing graph between a source and a destination. While high redundancy is crucial to reliable communication, determining and maintaining graph routing is challenging in terms of execution time and energy consumption for resource constrained WSAN. Existing graph routing algorithms use centralized approach, do not scale well in terms of these metrics, and are less suitable under network dynamics. To address these limitations, we propose the first distributed graph routing protocol for WirelessHART networks. Our distributed protocol is based on the Bellman-Ford Algorithm, and generates all routing graphs together using a single algorithm.We prove that our proposed graph routing can include a path between a source and a destination with cost (in terms of hop-count) at most 3 times the optimal cost. We implemented our proposed routing algorithm on TinyOS and evaluated through experiments on TelosB motes and simulations using TOSSIM. The results show that it is scalable and consumes at least 40% less energy and needs at least 65% less time at the cost of 1kB of extra memory compared to the state-of-The-Art centralized approach for generating routing graphs.
Recommended Citation
V. P. Modekurthy et al., "Distributed Graph Routing for WirelessHART Networks," Proceedings of the 19th International Conference on Distributed Computing and Networking (2018, Varanasi, India), Association for Computing Machinery (ACM), Jan 2018.
The definitive version is available at https://doi.org/10.1145/3154273.3154335
Meeting Name
19th International Conference on Distributed Computing and Networking, ICDCN 2018 (2018: Jan. 4-7, Varanasi, India)
Department(s)
Computer Science
Research Center/Lab(s)
Intelligent Systems Center
Second Research Center/Lab
Center for High Performance Computing Research
Keywords and Phrases
Distributed Algorithm; Graph Routing; Wireless Sensor Actuator Networks; WirelessHART
International Standard Book Number (ISBN)
978-145036372-3
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2018 Association for Computing Machinery (ACM), All rights reserved.
Publication Date
07 Jan 2018