无线HART网络点到点图路由的研究与实现  

Study and Realization of Peer-to-peer Graph Routing in Wireless HART Network

作　　者：张茜[1] 秦雅娟[1] 朱昊清 杨冬[1] 

机构地区：[1]北京交通大学电子信息工程学院,北京100044

出　　处：《计算机技术与发展》2014年第11期23-27,31,共6页Computer Technology and Development

基　　金：国家科技重大专项(2012ZX03005003);国家自然科学基金资助项目(61271201;61100217;61100219);国家"973"重点基础研究发展计划项目(2013CB329101);SRFDP(20110009120004)

摘　　要：无线HART是一个开放的用于工业测量和控制的无线通信标准。无线HART标准在网络层采用图路由机制,通过提供链路冗余,以满足工业应用中安全、可靠的通信需求。现有的图路由算法研究仅局限于集中式通信,文中设计并实现了局部分布式通信的点到点图路由算法。该算法利用跳数、链路质量作为度量进行选路,提供跳间冗余以保证路由健壮性,并通过对跳间链路数的限定以及路由图范围的集中,可以为网络中任意两点间建立会话,减少控制时延,有效避免通信资源的浪费。该算法实现的通信模式不仅保留了集中式图路由的可靠性,也可以满足无线工业控制的灵活性和实时性需求。WirelessHART is an open wireless communication protocol for industrial measurement and control. The graph routing protocol proposed by WirelessHART is meant to meet the requirements for reliable communications in industrial applications via providing link re-dundancies. Since algorithms on graph routing are mostly limited to the centralized communications at present,a peer-to-peer graph rou-ting algorithm is designed and implemented to realize sectional distributed communications in this paper. By measuring hops and link quality,the routing algorithm provides hop-by-hop multipath to ensure the routing robustness,and by limiting the number of links be-tween devices and the scale of the graph,communication resources can avoid being wasted. The communication pattern supported by this algorithm not only keeps the advantage of reliability provided by centralized graph routing,but also satisfies the requirements for flexibil-ity and real-time performance in wireless industrial control.

关 键 词：无线HART 点到点通信 图路由 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]