Shortest-path routing algorithm based on selected RSL in WirelessHART

The Graph routing proposed by WirelessHART is one of the routing protocols which with best robustness among all the wireless networks.Since there is little algorithm on Graph routing at present and the routing performance is poor,a shortest-path Graph routing algorithm based on BFS(Breadth-First Search)is presented.The routing algorithm has a character of neighbor redundancies,which can maximize to increase the routing robustness.With the introduction of RSL(Receive Signal Level)as a link quality measurement, removing the links with poor quality,setting an upper limit to the number of neighbors in each hop,both methods are aimed to increase the routing robustness and minimize the waste communication resources.In addition,the necessary of broadcast routing which Wire- lessHART has not mentioned is demonstrated and the reality algorithm is also proposed.