Abstract—In this paper load-balancing routing algorithm for WirelessHART standard is proposed. WirelessHART is open standard for Industrial automation to fulfill specific requirements of industrial environments, WirelessHART is secure, time synchronized mesh network with frequency hopping and graph routing. Graph routing is used in WirelessHART to provide path redundancy. Whereas in proposed algorithm; not only path redundancy is considered but also minimum hop end to end communication to fulfill stringent real time requirements as well as device load balancing is considered to increase overall network life. Results show that network life with proposed algorithm is dramatically increased in comparison with minimum hop graph routing.
Index Terms—Graph routing, load balancing, minimum hop, wirelessHART
Abdul Aziz Memon is working as an Assistant Professor at department of Electrical Engineering, Sukkur Institute of Business Administration Sukkur, Pakistan(e-mail: email@example.com)
Seung Ho Hong is working as a Professor at department of electronic and information system engineering, Hanyang University South Korea. (e-mail: firstname.lastname@example.org).
Cite: Abdul Aziz Memon and Seung Ho Hong, "Minimum-Hop Load-Balancing Graph Routing Algorithm for Wireless HART," International Journal of Information and Electronics Engineering vol. 3, no. 2, pp. 221-225, 2013.