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

Authors:
Kui Dang;Ji-Zhong Shen;Li-Da Dong;Yong-Xiang Xia
Affiliations:
Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China 310027;Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China 310027;Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China 310027;Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China 310027
Venue:
Wireless Personal Communications: An International Journal
Year:
2013

Citing 15
Cited 0

A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
The coverage problem in a wireless sensor network

Mobile Networks and Applications
Channel allocation and medium access control for wireless sensor networks

Ad Hoc Networks
Cross-Layer, Energy-Efficient Design for Supporting Continuous Queries in Wireless Sensor Networks: A Quorum-Based Approach

Wireless Personal Communications: An International Journal
Cross-layer Scheduling Algorithms for IEEE 802.16 Based Wireless Mesh Networks

Wireless Personal Communications: An International Journal
Optimal link scheduling and channel assignment for convergecast in linear wirelessHART networks

WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
A route-based scheduling in wireless multi-hop mesh networks for collision avoidance

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Methodology and tools for controller-networking codesign in wirelessHART

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Multihop multi-channel scheduling for wireless control in wirelessHART networks

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Design of an efficient message collecting scheme for the slot-based wireless mesh network

AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
Real-Time Scheduling for WirelessHART Networks

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks

RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
REUSE: A combined routing and link scheduling mechanism for wireless mesh networks

Computer Communications
A control loop reduction scheme for wireless process control on traffic light networks

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
Design of a slot assignment scheme for link error distribution on wireless grid networks

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.