A routing algorithm for industrial wireless network based on ISA100.11a  

作　　者：王平 Yang Lihua Wang Heng Wu Guanchen Dai Qingchao 

机构地区：[1]Key Laboratory of Industrial Internet of Things & Networked Control,Ministry of Education Chongqing University of Posts and Telecommunications [2]Key Laboratory of Industrial Internet of Things & Networked Control,Ministry of Education,Chongqing University of Posts and Telecommunications

出　　处：《High Technology Letters》2015年第1期46-53,共8页高技术通讯（英文版）

基　　金：Supported by the National Natural Science Foundation of China(No.61301125);the National High Technology Research and Development Programme of China(No.0AA0401028003);National Science and Technology Major Project(No.2013ZX03005005);the Fundamental and Advanced Research Program of Chongqing(No.cstc2013jcyjA40008);the Youth Top-notch Talent Support Program of Chongqing(No.2013-139)

摘　　要：ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mechanism.For the timeslot delay caused by deterministic scheduling,a routing algorithm is presented for industrial environments.According to timeslot,superframe,links,channel and data retransmission of deterministic scheduling mechanisms that affect the design of the routing algorithm,the algorithm selects the link quality,timeslot delay and retransmission delay as the routing criteria and finds the optimum communication path by k shortest paths algorithm.Theoretical analysis and experimental verification show that the optimal paths selected by the algorithm not only have high link quality and low retransmission delay,but also meet the requirements of the deterministic scheduling.The algorithm can effectively solve the problem of packet loss and transmission delay during data transmission,and provide a valuable solution for efficient data transmission based on determinacy.ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mecha- nism. For the timeslot delay caused by deterministic scheduling, a routing algorithm is presented for industrial environments. According to timeslot, superframe, links, channel and data retransmission of deterministic scheduling mechanisms that affect the design of the routing algorithm, the algorithm selects the link quality, timeslot delay and retransmission delay as the routing criteria and finds the optimum communication path by k shortest paths algorithm. Theoretical analysis and experimental verification show that the optimal paths selected by the algorithm not only have high link quality and low retransmission delay, but also meet the requirements of the deterministic scheduling. The algo- rithm can effectively solve the problem of packet loss and transmission delay during data transmission, and provide a valuable solution for efficient data transmission based on determinacy.

关 键 词：industrial wireless network ISA100.11 a k shortest paths algorithm transmission delay link quality superframe 

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