基于全网能量均衡的WirelessHART图路由算法

Energy aware graph routing algorithm for WirelessHART

如何均衡使用网络节点能量并生成高可靠路由是WirelessHART网络研究的一个难题,为此提出了一种GRAEB(graph routing algorithm based on energy balancing)图路由算法。首先,网络被初始化为连通的图结构,能够提高丰富的冗余路径。网络管理器根据全网节点剩余能量、通信周期、链路分布等因子生成节点鲁棒系数矩阵,节点通过比较邻居的鲁棒系数来选择最优路径。另外,规定了邻居节点数的上限阈值,每次路由更新只保留鲁棒系数最优的邻居。仿真结果表明GRAEB不仅提高了网络可靠性,而且延长了网络寿命。

In WirelessHART network, how to balance the energy consumption while ensuring its reliability is of great chal- lenge. This paper proposed GRAEB algorithm for WirelessHART. First of all, it established the network topology based on graph and it could provide rich redundant paths. The network manager, according to the matrix parameters of the remaining energy, communication cycle and link distribution, created a robust coefficient matrix for nodes to choose the best next hop. Furthermore, the algorithm set an upper threshold to the number of neighbors for each node and only kept the neighbors with higher robust coefficient. The simulation results show that GRAEB not only improves the network reliability, but also prolongs the network lifetime.