Routing and Scheduling Algorithms for WirelessHART Networks: A Survey

Sensors

Marcelo Nobre²  Ivanovitch Silva¹  Luiz Affonso Guedes² 

[1] Metropole Digital Institute, Federal University of Rio Grande do Norte, Campus Universitario, 59078-900 Natal, Brazil; E-Mail:;Department of Computer Engineering and Automation, Federal University of Rio Grande do Norte, Campus Universitario, 59078-900 Natal, Brazil; E-Mail:

关键词: industrial wireless sensors networks;    WirelessHART;    routing;    scheduling;    mesh networks;   

DOI  :  10.3390/s150509703

来源: mdpi

【 摘 要 】

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 for WirelessHART, discussing each of their features. These routing algorithms have been evaluated in terms of their objectives, metrics, the usage of the WirelessHART 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.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland.