适用于WirelessHART网络中实现图路由机制的R-Dijkstra算法  

R-Dijkstra Algorithm for Realization of Graph Route Mechanism in WirelessHART Networks

作　　者：李世兴[1,2] 王宏[1] 周桂平[3] 

机构地区：[1]中国科学院沈阳自动化研究所网络化控制系统实验室,辽宁沈阳110016 [2]中国科学院大学,北京100039 [3]国网辽宁省电力有限公司电力科学研究院,辽宁沈阳110055

出　　处：《仪表技术与传感器》2015年第6期131-134,共4页Instrument Technique and Sensor

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

摘　　要：在Wireless HART协议中,提出了图路由的路由机制,但并未给出具体的实现算法。针对Wireless HART协议中图路由的特点,结合Dijkstra算法,设计了一种适用于图路由实现的R-Dijkstra算法。R-Dijkstra算法把Wireless HART网络定义为一个非负权重的连通图,通过引入冗余度参数和路径优化目标,实现了图路由传输路径选择。描述了图路由机制和算法步骤,给出了算法实现过程。应用实例表明,该算法能够满足图路由的要求。WirelessHART protocol presents graph route mechanism without providing the specific realization algorithm. Aiming at the features of graph route in WirelessHART protocol,integrating Dijkstra algorithm,R-Dijkstra algorithm was suitable for graph route realization. R-Dijkstra algorithm defined WirelessHART network as a connected graph. By means of introducing redundancy parameter and route optimization goal,R-Dijkstra algorithm can select the transmission path. The graph route mechanism and R-Dijkstra algorithm steps described the algorithm realization process. The application example confirms that R-Dijkstra algorithm can meet the demands of graph routes.

关 键 词：WIRELESSHART 图路由 R-Dijkstra 冗余 

分 类 号：TP23[自动化与计算机技术—检测技术与自动化装置]