Routing and scheduling algorithms for wirelessHART networks: a survey

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

Full description

Bibliographic Details
Authors: Nobre, Marcelo, Silva, Ivanovitch, Guedes, Luiz Affonso
Format: article
Status:Published version
Publication Date:2015
Country:Brasil
Institution:Universidade Federal do Rio Grande do Norte (UFRN)
Repository:Repositório Institucional da UFRN
Language:English
OAI Identifier:oai:repositorio.ufrn.br:123456789/22291
Online Access:https://repositorio.ufrn.br/jspui/handle/123456789/22291
Access Level:Open access
Keyword:industrial wireless sensors networks
WirelessHART
routing
scheduling
mesh networks
Description
Summary: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