Reliable and Energy Efficient Routing Algorithm for WirelessHART

Zhang, Qun; Feng, Li; Ju, Lei; Jia, Zhiping; Zhang, Zhaopeng

doi:10.1007/978-3-319-11197-1_15

Cited by 10 publications

(10 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In general routing must be addressed as part of the mapping of an application to the available hardware, since it in uences how intermediate nodes need to forward tra c, and therefore the loads experienced at these nodes. Several approaches have been used for route determination in systems derived from WirelessHART, which generally incorporate graph routing to/from a sink node; for example Han graph routing [20], Zhang graph routing [42], and Q-learning route construction [26]. Here we, initially take a simpler approach, since we are assuming a static industrial application with peer to peer tra c, in which the topology remains constant and routes can be pre-programmed.…”

Section: Routing Heuristicmentioning

confidence: 99%

The AirTight Protocol for Mixed Criticality Wireless CPS

Harbin

Burns

Davis

et al. 2019

ACM Trans. Cyber-Phys. Syst.

View full text Add to dashboard Cite

This paper describes the motivation, design, analysis and con guration of the criticality-aware multi-hop wireless communication protocol AirTight. Wireless communication has become a crucial part of the infrastructure of many cyber-physical applications. Many of these applications are real-time and also mixed-criticality, in that they have components/subsystems with di erent consequences of failure. Wireless communication is inevitably subject to levels of external interference. In this paper we represent this interference using a criticality-aware fault model; for each level of temporal interference in the fault model we guarantee the timing behaviour of the protocol (i.e. we guarantee that packet deadlines are satis ed for certain levels of criticality). Although a new protocol, AirTight is built upon existing standards such as IEEE 802.15.4. A prototype implementation and protocol-accurate simulator have been produced. This paper develops a series of schedulability analysis techniques for single-channel and multichannel wireless Cyber-Physical Systems (CPS). Heuristics are speci ed and evaluated as the starting point of design space exploration. Genetic algorithms are then de ned and evaluated to assess their performance in developing schedule tables incorporating multichannel allocations in these systems. CCS Concepts: • Computer systems organization → Embedded and cyber-physical systems; Realtime systems; • Software and its engineering → Software veri cation;

show abstract

Section: Routing Heuristicmentioning

confidence: 99%

The AirTight Protocol for Mixed Criticality Wireless CPS

Harbin

Burns

Davis

et al. 2019

ACM Trans. Cyber-Phys. Syst.

View full text Add to dashboard Cite

show abstract

“…Re-add is a routing algorithm proposed by [ 64 ] that applies a weighted priority function together with an uplink graph construction algorithm to determine the routes for a WirelessHART network. Starting from the original topology, the algorithm assigns degrees (minimum hop count to the gateway) to each node and deletes the links between nodes with the same degree, just as in the JRMNL.…”

Section: State-of-the-art For Wirelesshart Routing Schemesmentioning

confidence: 99%

“…The process of defining the weights starts from a user-defined matrix that makes a pairwise comparison of the optimization criteria, determining whether each one of them is more, equal or less important than each of the others. Then, a judgment matrix is calculated (see [ 64 ] for details), and the weights are calculated by a consistency check.…”

Section: State-of-the-art For Wirelesshart Routing Schemesmentioning

confidence: 99%

“…The results suggest that re-add outperforms the other algorithms in terms of reliability and network lifetime. See [ 64 ] for further details.…”

Section: State-of-the-art For Wirelesshart Routing Schemesmentioning

confidence: 99%

“…Objective: In terms of the objective, all of the proposals have the same concern for maximizing the network lifetime, which is relevant in a battery-powered IWSN environment. However, the most recent re-add [ 64 ] proposal includes in its objectives the robustness of the network, reaffirming the WirelessHART robustness feature.…”

Section: State-of-the-art For Wirelesshart Routing Schemesmentioning

confidence: 99%

See 2 more Smart Citations

Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey

Nobre

Silva

Guedes

2015

Sensors

View full text Add to dashboard Cite

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.

show abstract

Clustering-Based Data Aggregation and Routing for Real-Time WirelessHART Communication

Feng

Wang

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Reliable and Energy Efficient Routing Algorithm for WirelessHART

Cited by 10 publications

References 13 publications

The AirTight Protocol for Mixed Criticality Wireless CPS

The AirTight Protocol for Mixed Criticality Wireless CPS

Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey

Clustering-Based Data Aggregation and Routing for Real-Time WirelessHART Communication

Contact Info

Product

Resources

About