WirelessHART is an emerging wireless sensor network protocol. In this paper, a joint graph routing algorithm for maximizing the network lifetime (JRMNL) in WirelessHART is proposed. Node communication load factor is approximately estimated by matrix operations for the first time. Then node communication load, the residual energy, and the link transmission power are integrated as a link cost function that is accurately measured in this algorithm. A node chooses the optimal next hop by comparing the link cost function of all its neighbor nodes, which guarantees the energy balancing of the whole network. Simulation results show that the proposed algorithm can extend network lifetime by a factor of 2 relative to the maximum residual energy selection algorithm and prolong the network lifetime by a factor of 7 relative to the minimum transmission power routing algorithm, but the average energy consumption per route will increase by 2 dBm compared with the minimum transmission power routing algorithm.

No abstract

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.

No abstract