Limits...
Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey.

Nobre M, Silva I, Guedes LA - Sensors (Basel) (2015)

Bottom Line: 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 Article: PubMed Central - PubMed

Affiliation: Department of Computer Engineering and Automation, Federal University of Rio Grande do Norte, Campus Universitario, 59078-900 Natal, Brazil. marcelonobre@dca.ufrn.br.

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.

No MeSH data available.


WirelessHART architecture compared to wired HART and the OSI stack. OSI, Open Systems Interconnection.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4481989&req=5

f2-sensors-15-09703: WirelessHART architecture compared to wired HART and the OSI stack. OSI, Open Systems Interconnection.

Mentions: WirelessHART technology implements five layers: a physical layer, a data link layer, a network layer, a transport layer and an application layer. Thus, when compared to the traditional OSI (Open Systems Interconnection) stack model, the presentation layer and session layer do not have direct equivalents in the WirelessHART stack [41], as can be seen in Figure 2. Figure 2 also presents the equivalences and differences of the traditional wired HART technology and the WirelessHART. It is worth noting that WirelessHART devices are fully compatible with a traditional HART network [7].


Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey.

Nobre M, Silva I, Guedes LA - Sensors (Basel) (2015)

WirelessHART architecture compared to wired HART and the OSI stack. OSI, Open Systems Interconnection.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4481989&req=5

f2-sensors-15-09703: WirelessHART architecture compared to wired HART and the OSI stack. OSI, Open Systems Interconnection.
Mentions: WirelessHART technology implements five layers: a physical layer, a data link layer, a network layer, a transport layer and an application layer. Thus, when compared to the traditional OSI (Open Systems Interconnection) stack model, the presentation layer and session layer do not have direct equivalents in the WirelessHART stack [41], as can be seen in Figure 2. Figure 2 also presents the equivalences and differences of the traditional wired HART technology and the WirelessHART. It is worth noting that WirelessHART devices are fully compatible with a traditional HART network [7].

Bottom Line: 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 Article: PubMed Central - PubMed

Affiliation: Department of Computer Engineering and Automation, Federal University of Rio Grande do Norte, Campus Universitario, 59078-900 Natal, Brazil. marcelonobre@dca.ufrn.br.

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.

No MeSH data available.