基于RSL筛选的WirelessHART最短路径路由算法  

Shortest-path routing algorithm based on selected RSL in WirelessHART

作　　者：党魁 沈继忠[1] 董利达[1] 

机构地区：[1]浙江大学信息与电子工程学系,杭州310027

出　　处：《计算机工程与应用》2012年第6期69-72,83,共5页Computer Engineering and Applications

摘　　要：无线HART网络协议中提出的Graph路由是同类无线网络中健壮性最好的路由方式之一。针对目前实现该路由方式的算法非常少且性能不佳的现状,提出一种基于BFS的Graph路由算法。该算法得到的路由具有跳间冗余的特点,能够最大限度地增加路由健壮性,并且路径最短;引入RSL作为链路质量衡量标准,剔除质量较差的链路,同时对每跳的邻居数设置上限,保证了路由的健壮性,同时避免了低质量的链路带来的通信资源浪费。此外,论证了协议所没有提及的广播路由存在的必要,并给出了实现算法。The Graph routing proposed by WirelessHART is one of the routing protocols which with best robustness among all the wire- less 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 WireIessHART has not mentioned is demonstrated and the reality algorithm is also proposed.

关 键 词：无线HART Graph路由 BFS算法 接收信号强度 广播路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]