Nederlands
Contact
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||
|
|
Zand, P. and Chatterjea, S. and Ketema, J. and Havinga, P.J.M.
(2012)
A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks.
In: Proceedings of the 17th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2012, 17-21 Sep 2012, Krakow, Poland.
pp. 1-4.
IEEE Industrial Electronics Society.
ISBN 978-1-4673-4737-2
Full text available as:
Official URL: http://dx.doi.org/10.1109/ETFA.2012.6489719 AbstractCurrent wireless standards and protocols for industrial applications, such as WirelessHART and ISA100.11a, typically use centralized network man-agement 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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||
