基于通信链路质量的无线HART图路由算法实现  

Implementation of graph routing algorithm based on quality of communication link in wireless HART

作　　者：封岸松[1,2,3] 王宏[1] 

机构地区：[1]中国科学院沈阳自动化研究所,辽宁沈阳110016 [2]沈阳化工大学信息工程学院,辽宁沈阳110142 [3]中国科学院大学,北京100039

出　　处：《电子技术应用》2015年第4期119-121,124,共4页Application of Electronic Technique

基　　金：国家高技术研究发展计划资助项目(863计划)(2011AA040103)

摘　　要：图路由是无线HART提出的路由机制,目前对图路由算法的研究较少。提出了一种基于通信链路质量的无线HART图路由算法,引入路径稳定度作为判断链路质量的机制。采用基于路径稳定度的分层算法,保证跳数最少和通信可靠性;依据层间节点的路径稳定度选择层间路由,保证层间路由冗余性和可靠性,实现了无线HART的图路由算法,并应用到无线HART网络管理者中。The graph routing proposed by wireless HART is researched seldom at present. A graph routing algorithm based on quality of the communication link was presented in the paper. The quality discrimination mechanism based on path stability about the communication link was proposed. The hierarchical algorithm based on path stability of the communication channel was adopted and guaranteed the least hop and communication reliability. Path stability about the communication link was used to select the rout- ing between the two layers. The network manager of the Wireless HART realizes the graph routing in wireless HART and ensures the reliability and redundancy of communication with the routing algorithm.

关 键 词：图路由 通信链路质量 无线HART 路径稳定度 

分 类 号：TN92[电子电信—通信与信息系统]