Next Article in Journal
Adaptive Control of the Packet Transmission Period with Solar Energy Harvesting Prediction in Wireless Sensor Networks
Previous Article in Journal
Analysis and Experimental Kinematics of a Skid-Steering Wheeled Robot Based on a Laser Scanner Sensor
Article Menu

Export Article

Open AccessArticle
Sensors 2015, 15(5), 9703-9740; doi:10.3390/s150509703

Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey

1
Department of Computer Engineering and Automation, Federal University of Rio Grande do Norte, Campus Universitario, 59078-900 Natal, Brazil
2
Metropole Digital Institute, Federal University of Rio Grande do Norte, Campus Universitario, 59078-900 Natal, Brazil
*
Author to whom correspondence should be addressed.
Academic Editor: Leonhard M. Reindl
Received: 27 February 2015 / Revised: 13 April 2015 / Accepted: 16 April 2015 / Published: 24 April 2015
(This article belongs to the Section Sensor Networks)
View Full-Text   |   Download PDF [530 KB, uploaded 24 April 2015]   |  

Abstract

Wireless communication is a trend nowadays for the industrial environment. A number of different technologies have emerged as solutions satisfying strict industrial requirements (e.g., WirelessHART, ISA100.11a, WIA-PA). As the industrial environment presents a vast range of applications, adopting an adequate solution for each case is vital to obtain good performance of the system. In this context, the routing and scheduling schemes associated with these technologies have a direct impact on important features, like latency and energy consumption. This situation has led to the development of a vast number of routing and scheduling schemes. In the present paper, we focus on the WirelessHART technology, emphasizing its most important routing and scheduling aspects in order to guide both end users and the developers of new algorithms. Furthermore, we provide a detailed literature review of the newest routing and scheduling techniques forWirelessHART, discussing each of their features. These routing algorithms have been evaluated in terms of their objectives, metrics, the usage of theWirelessHART structures and validation method. In addition, the scheduling algorithms were also evaluated by metrics, validation, objectives and, in addition, by multiple superframe support, as well as by the redundancy method used. Moreover, this paper briefly presents some insights into the main WirelessHART simulation modules available, in order to provide viable test platforms for the routing and scheduling algorithms. Finally, some open issues in WirelessHART routing and scheduling algorithms are discussed. View Full-Text
Keywords: industrial wireless sensors networks; WirelessHART; routing; scheduling; mesh networks industrial wireless sensors networks; WirelessHART; routing; scheduling; mesh networks
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Nobre, M.; Silva, I.; Guedes, L.A. Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey. Sensors 2015, 15, 9703-9740.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top