A Graph Route-Based Superframe Scheduling Scheme in WirelessHART Mesh Networks for High Robustness

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 sched...

Full description

Saved in:
Bibliographic Details
Published in:Wireless personal communications 2013-08, Vol.71 (4), p.2431-2444
Main Authors: Dang, Kui, Shen, Ji-Zhong, Dong, Li-Da, Xia, Yong-Xiang
Format: Article
Language:English
Subjects:
Access methods and protocols, osi model
Applied sciences
Channels
Communications Engineering
Computer Communication Networks
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Delay
Engineering
Exact sciences and technology
Graphs
Networks
Protocol (computers)
Radiocommunications
Robustness
Scheduling
Signal,Image and Speech Processing
Software
Strategy
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0929-6212
1572-834X
DOI:10.1007/s11277-012-0946-2