A Graph Route-Based Superframe Scheduling Scheme in WirelessHART Mesh Networks for High Robustness
A Graph Route-Based Superframe Scheduling Scheme in WirelessHART Mesh Networks for High Robustness
复制标题
WirelessHART网状网络中基于图路由的超帧调度方案以实现高鲁棒性
DOI：
10.1007/s11277-012-0946-2
复制
发表时间：
2013-08-01
影响因子：
2.2
通讯作者：
Xia, Yong-Xiang
中科院分区：
文献类型：
--
作者：
Dang, Kui;Shen, Ji-Zhong;Xia, Yong-Xiang
与其他类似的无线网络相比，WirelessHART具有较高的鲁棒性，被认为是最有前途的无线网络协议之一。其高鲁棒性来源于其独特的路由协议和冗余超帧调度方案。研究了无线通信的时隙调度和信道分配问题，提出了一种基于图路由的超帧调度方案。为了提高通信可靠性，本方案在多跳多信道环境下采用跳级重传机制。同时考虑了时隙冲突和信道干扰，提出了有效的解决策略。为了满足实时通信的要求，按照实际通信顺序分配时隙，可以有效地减少重传时延。在此基础上，提出了该方案的实现算法。性能分析表明，该调度方案比传统的无冗余调度方案具有更高的鲁棒性。
WirelessHART is considered to be one of the most promising wireless network protocols for its high robustness comparing to other similar wireless networks. The high robustness comes from its unique routing protocol and redundant superframe scheduling scheme. This paper focuses on the time-slot scheduling and channel assignment of WirelessHART and a graph route-based superframe scheduling scheme is proposed. In order to improve the communication reliability, our scheme applies hop-level retransmission mechanism in a multi-hop and multi-channel circumstance. Moreover, time-slot conflict and channel interference are considered and an effective solution strategy is proposed. To meet the real-time communication requirements, time-slots are assigned in the order of actual communication sequence which can effectively reduce the retransmission delay. Further more, we propose the implementation algorithm of our scheme. The performance analysis shows that our scheduling scheme has a higher robustness than the traditional non-redundancy scheme.