An Energy-Balanced Graph Routing Algorithm for WirelessHART Networks

Aiming at the high reliable wirelessHART protocol, an innovative energy-balanced graph routing algorithm (EBGRA) is proposed in this paper. Firstly, the network topology is established and initialized Based on graph routing. During the routing update process, by synthesizing the remaining energy, the communication cycles of nodes and the links in the network, the network manager calculates the robust coefficient of each node as the metric for nodes to select the proper next hop and generate the optimal path. Meanwhile, an upper threshold for the number of neighbors of each node is set so that the neighbors with smaller robust coefficient can be removed. EBGRA considers both the nodes´ communication load and residual energy, not only making each path the shortest, but also greatly extending the lifetime of the network. Finally, simulations are carried out to demonstrate the long network lifetime and the high reliability of the proposed algorithm.