期刊文献+

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

Deterministic Scheduling Algorithms for WIA-PA Industrial Wireless Sensor Networks
在线阅读 下载PDF
导出
摘要 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.
出处 《电子学报》 EI CAS CSCD 北大核心 2018年第1期68-74,共7页 Acta Electronica Sinica
基金 国家863高技术研究发展计划(No.2015AA043801)
关键词 确定性调度 时间裕度 工业无线传感器网络 WIA-PA网络 deterministic scheduling slack industrial wireless sensor networks WIA-PA networks
  • 相关文献

参考文献5

二级参考文献64

  • 1郭浩波,王颖龙,曾辉.采用遗传模拟退火算法研究导弹预警卫星传感器调度[J].电光与控制,2006,13(4):71-74. 被引量:19
  • 2顾小洪,吴秋峰.无线网络在工业企业中应用的一些探讨[J].工业控制计算机,2006,19(11):1-2. 被引量:14
  • 3谢海波,崔毅东,徐惠民.一种联合路由层信息设计的多跳AdHocMAC层协议[J].电子学报,2006,34(12):2129-2133. 被引量:8
  • 4李春林,程健.工业自动化领域中的无线技术[J].工业仪表与自动化装置,2007(1):15-17. 被引量:18
  • 5China Industry Wireless Alliance . Wireless industry automation specification for porocess automation[Z]. 2008, IEC Pass/62601.
  • 6Grable D A, Panconesi A. Nearly optimal distributed edge colouring in O ( log log n) rounds [C ]. In Proc. of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms: New Orleans, Louisiana, United States: ACM 1997:278-285.
  • 7Misra J,Gries D. A constructive proof of vizing's theorem[ C]. Inf. Proc. Lett., 41,1992:131 - 133.
  • 8Marathe M V, Panconesi A, Risinger L D. An experimental study of a simple, distributed edge coloring algorithm[ A]. Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures[C]. New York, NY, USA: ACM Press, 2000:166- 175.
  • 9Gandham S, Dawande M, Prakash R. Link scheduling in sensor networks: distributed edge coloring revisited [ A ]. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies ( INFOCOM '05 ) [ C]. New York, NY, USA: ACM Press,4, 2005:2492-2501.
  • 10Zhang Xue-dan , Hong Jun, Zhang Lin,et al. Li: CC-TDMA:coloring- and coding-based multi-channel TDMA scheduling for wireless ad hoc networks [ C ]. Proc. of IEEE WCNC 2007, Hong Kong, China,March, 2007:133-137.

共引文献25

同被引文献95

引证文献15

二级引证文献63

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部