Measurements of a wireless link in an industrial environment using an IEEE 802.11-compliant physical layer

Abstract

Abstract-The design and simulation of coding schemes, Medium Access Control (MAC), and link-layer protocols for future industrial wireless local area networks can be supported by some understanding of the statistical properties of the bit error patterns delivered by a wireless link (which is an ensemble of transmitter, channel, receiver, modems). We present results of bit error measurements taken with an IEEE 802.11-compliant radio modem in an industrial environment. In addition to reporting the most important results, we draw some conclusions for the design of MAC and link-layer protocols. Furthermore, we show that the popular Gilbert/Elliot model and a modified version of it are a useful tool for simulating bit errors on a wireless link, despite their simplicity and failure to match certain measured statistics.Index Terms-IEEE 802.11 wireless local area network (WLAN), industrial environment, Medium Access Control (MAC) design, stochastic bit error models, wireless error measurements.

Pushback: A hidden Markov model based scheme for energy efficient data transmission in sensor networks

“…The former paper points out that the instantaneous packet error probability varies by approximately 30% around its mean. The latter paper, as well as Willig et al [3], both show that the packet-error stochastic process exhibits significant long-term dependence.…”

A rate adaptation algorithm for IEEE 802.11 WLANs based on MAC-layer loss differentiation

“…Measurements conducted on the wireless channel in an IEEE 802.11 WLAN [22] show that the Gilbert-Elliot model gives a good prediction of WLAN performance. To evaluate the performance of the proposed LD-ARF algorithm under variable conditions and compare with that of the ARF algorithm, in this paper we use an extension model of the original Gilbert-Elliot model.…”

Hybrid Systems: Computation and Control

“…The last line of Table 1 refers to a simulation where N 2 = N 1 , which results in the most precise estimation, because at each step at least one data (and at most two) for the network state estimate is available. As experimental validation, we have run Algorithm 3.1 on a dataset obtained from a real wireless sensor network composed of Telos T-mote Sky nodes where an object was sometimes shadowing the receiver node, similarly to what discussed in [6]. Part of the dataset was used to estimate the transition probabilities of the Markov chain, and the packet drops probabilities in each state, obtaining p R,U = 10 −3 , p U,U = 1.5 · 10 −3 , p r = 0.10, p u = 0.75.…”