A distributed scheduling algorithm for real-time (D-SAR) industrial wireless sensor and actuator networks

Current wireless standards and protocols for industrial applications, such as WirelessHART and ISA100.11a, typically use centralized network management for communication scheduling and route establishment. However, due to their centralized nature, these protocols have difficulty coping with dynamic...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012) pp. 1 - 4
Main Authors: Zand, Pouria, Chatterjea, Supriyo, Ketema, Jeroen, Havinga, Paul
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2012
Subjects:
Actuators
Delays
Logic gates
Peer-to-peer computing
Quality of service
Real-time systems
Routing protocols
Switching circuits
Wireless communication
Wireless sensor networks
ISBN:9781467347358, 1467347353
ISSN:1946-0740
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Current wireless standards and protocols for industrial applications, such as WirelessHART and ISA100.11a, typically use centralized network management for communication scheduling and route establishment. However, due to their centralized nature, these protocols have difficulty coping with dynamic large-scale networks. To address this problem, we propose D-SAR, a distributed resource reservation algorithm that allows source nodes to meet the Quality-of-Service requirements for peer-to-peer communication. D-SAR uses concepts derived from circuit switching and Asynchronous Transfer Mode (ATM) networks and applies them to wireless sensor and actuator networks. Simulations show that latency in connection setup is 93% less in D-SAR compared to WirelessHART and that 89% fewer messages are sent during connection setup in case the distance from source to destination is 12 hops.
ISBN:9781467347358
1467347353
ISSN:1946-0740
DOI:10.1109/ETFA.2012.6489719