面向WIA-PA工业无线传感器网络的确定性调度算法  

Deterministic Scheduling Algorithms for WIA-PA Industrial Wireless Sensor Networks

作　　者：王恒[1] 陈鹏飞[1] 王平[1] 

机构地区：[1]重庆邮电大学工业物联网与网络化控制教育部重点实验室,重庆400065

出　　处：《电子学报》2018年第1期68-74,共7页Acta Electronica Sinica

基　　金：国家863高技术研究发展计划(No.2015AA043801)

摘　　要：WIA-PA(Wireless Networks for Industrial Automation-Process Automation)是我国自主制定的工业无线传感器网络标准,确定性调度技术是其中一项关键技术.但目前已有的确定性调度算法主要集中在通用传感器网络或Wireless HART,ISA100.11a等遵循国外标准的工业无线传感器网络中,未能针对WIA-PA网络进行优化设计.鉴于此,本文提出了一种适用于WIA-PA网络的基于回溯法的最优确定性调度算法,能够获取调度解的最大成功率;并以此为基础,进一步提出了一种基于最小时间裕度优先的时分多址调度算法(Least Slack First on Time Division Multiple Access,LSF-TDMA).仿真实验结果表明,所提出的LSF-TDMA算法能够满足WIA-PA网络端到端数据传输的确定性需求,在调度解获取成功率接近于最优的同时,有效降低了算法复杂度.Wireless Networks for Industrial Automation Process Automation（ WIA-PA） is China＇s national standard for industrial wireless sensor networks. Deterministic scheduling is one of the key technologies for WIA-PA networks. However,current deterministic scheduling algorithms mainly focus on the common wireless sensor networks or WirelessHART and ISA100. 11 a networks, and they are not optimized for WIA-PA networks. Therefore, an optimal backtracking scheduling algorithm is proposed and achieves the optimal schedulable ratio for WIA-PA networks. And based on this, another deterministic scheduling algorithm called Least Slack First on Time Division Multiple Access（ LSF-TDMA） is further presented.Simulation results demonstrate that LSF-TDMA algorithm can meet the deterministic demand of end-to-end data transmissions in WIA-PA networks. It obtains a near-optimal schedulable ratio while effectively reducing the algorithm complexity.

关 键 词：确定性调度 时间裕度 工业无线传感器网络 WIA-PA网络 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]