Please use this identifier to cite or link to this item:
Title: Routing and scheduling algorithms for wirelessHART networks: a survey
Authors: Nobre, Marcelo
Silva, Ivanovitch
Guedes, Luiz Affonso
Keywords: industrial wireless sensors networks;WirelessHART;routing;scheduling;mesh networks
Issue Date: 2015
Citation: NOBRE, Marcelo.; Silva, Ivanovitch.; GUEDES, Luiz . Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey. Sensors (Basel), v. 15, p. 9703-9740, 2015. Disponível em: <>. Acesso em: 25 out. 2016.
Portuguese 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
Appears in Collections:IMD - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
RoutingAndScheduling_2015.pdf530.42 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.