计算机技术与发展Issue(11)：23-27,31,6.DOI:10.3969/j.issn.1673-629X.2014.11.006
无线HART网络点到点图路由的研究与实现
Study and Realization of Peer-to-peer Graph Routing in WirelessHART Network
摘要
Abstract
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/点到点通信/图路由Key words
WirelessHART/peer-to-peer communication/graph routing分类
信息技术与安全科学引用本文复制引用
张茜,秦雅娟,朱昊清,杨冬..无线HART网络点到点图路由的研究与实现[J].计算机技术与发展,2014,(11):23-27,31,6.基金项目
国家科技重大专项(2012ZX03005003) （2012ZX03005003）
国家自然科学基金资助项目(61271201,61100217,61100219) （61271201,61100217,61100219）
国家“973”重点基础研究发展计划项目(2013CB329101) （2013CB329101）
SRFDP(20110009120004) （20110009120004）
