When HART goes wireless: Understanding and implementing the WirelessHART standard

Kim, A.N.; Hekland, F.; Petersen, Stig; Doyle, P.A.

doi:10.1109/etfa.2008.4638503

Cited by 123 publications

(61 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, a fourlevel priority classification is supported. (Kim et al, 2008) The development of the WirelessHART specification is still in progress. For example, the current specification does not consider mobility, interference from time-varying wireless channels, localisation, and effective handover when operator moves from one network /device to another or constant change in topology.…”

Section: Standardsmentioning

confidence: 99%

“…For example, the current specification does not consider mobility, interference from time-varying wireless channels, localisation, and effective handover when operator moves from one network /device to another or constant change in topology. For more details about WirelessHART, refer to (Kim et al, 2008); (Lennvall & Svensson, 2008).…”

Section: Standardsmentioning

confidence: 99%

“…Together with the network manager, a security manager is utilised to prevent possible attacks and intrusions. (Kim et al, 2008) The WirelessHART standard specifies the communication protocol stack using the OSI model, and supports also cross-layer design. The PHY layer of wireless HART is based on IEEE 802.15.4-2006, operating on 2.4 GHz unlicensed band, with maximum data rate of 250 kbps.…”

Section: Standardsmentioning

confidence: 99%

See 2 more Smart Citations

Wireless Sensor Networks in Industrial Automation

Paavola¹,

Leiviskä²

2010

Factory Automation

View full text Add to dashboard Cite

Section: Standardsmentioning

confidence: 99%

Section: Standardsmentioning

confidence: 99%

Section: Standardsmentioning

confidence: 99%

See 1 more Smart Citation

Wireless Sensor Networks in Industrial Automation

Paavola¹,

Leiviskä²

2010

Factory Automation

View full text Add to dashboard Cite

“…Most of dedicated studies on WirelessHART focus mainly on the evaluation of the performances of this protocol and its capabilities to operate in an industrial environment and its capacity to meet real-time requirements [5,6,7].…”

Section: Related Workmentioning

confidence: 99%

Security Analysis of WirelessHART Communication Scheme

Bayou

Espes²,

Cuppens-Boulahia³

et al. 2016

Foundations and Practice of Security

View full text Add to dashboard Cite

Abstract. Communication security is a major concern in industrial process management. Indeed, in addition to real-time requirements, it is very important to ensure that sensing data sent by field sensors are not altered or modified during their transmission. This is more true in Wireless Sensor Networks where communication can be hijacked and false data injected. Therefore wireless communication protocols include several security mechanisms to ensure data confidentiality and integrity. In this paper, we present an attack against WirelessHART, the leading wireless communication protocol in industrial environment. We show that an insider attacker can bypass security mechanisms and inject false commands in the network. Such attacks can have harmful economical consequences or even more can threaten human lives. We propose also some solutions that can be applied for detecting and mitigating this kind of attacks.

show abstract

“…In view of the rigorous timing and reliability constraints, an appropriate medium access method, which addresses how to resolve potential contentions and collisions when using the wireless medium, is needed to adapt existing wireless technologies and protocols to industrial settings, or, when this is not sufficient, to develop new ones [7]. Existed medium access control (MAC) protocols utilising the back-off mechanisms and retransmission mechanisms would result in long latency and more collisions, while the time division multiple access (TDMA) method that could greatly eliminate collisions and obtain a bound on the time required to complete communication becomes the preferred choice.…”

Section: Introductionmentioning

confidence: 99%

Optimal convergecast scheduling for hierarchical wireless industrial systems: performance bounds and two‐stage algorithms

2015

View full text Add to dashboard Cite

Increased mobility coupled with a possible reduction of cabling costs and deployment time makes wireless communication an attractive alternative for the industrial process monitoring and control. The major obstacles towards the utilisation of wireless industrial systems are predominantly the timing and reliability requirements. In this study, the authors take jointly the timing and reliability requirements, limited wireless resources and the cyclic data feature into consideration, and study the performance bounds and two-stage time-and channel-optimal convergecast scheduling algorithms for wireless industrial systems with hierarchical star and mesh architecture. Specifically, they consider the convergecast communication for wireless industrial systems operating according to the recent wireless network for industrial automation-process automation standard; and they will provide bounds on the minimum convergecast schedule length and bounds on the minimum number of channels for cluster-line and cluster-tree routing structures. In both cases, they propose time-and channel-optimal twostage scheduling algorithms. They evaluate the author's two-stage scheduling algorithms by both simulation and real hardwares. Numerical results demonstrate that their algorithms are efficient compared with traditional time division multiple access-based convergecast scheduling algorithms.

show abstract

When HART goes wireless: Understanding and implementing the WirelessHART standard

Cited by 123 publications

References 15 publications

Wireless Sensor Networks in Industrial Automation

Wireless Sensor Networks in Industrial Automation

Security Analysis of WirelessHART Communication Scheme

Optimal convergecast scheduling for hierarchical wireless industrial systems: performance bounds and two‐stage algorithms

Contact Info

Product

Resources

About