A comprehensive DCF performance analysis in noisy industrial wireless networks

Abstract

Summary The use of wireless technology in industrial networks is becoming more popular because of its flexibility, reduction of cable cost, and deployment time. Providing an accurate model to study the most important parameters of these networks, the timeliness and reliability, is essential in assessing the network metrics and choosing proper protocol settings. The Institute of Electrical and Electronics Engineers (IEEE) 802.11 is a common and established wireless technology, and several analytical models have been proposed to assess its performance; however, most of them are accurate only for a limited network situation, especially data networks that have large packet payloads and are used at high signal to noise ratios, and cannot be applied to study the performance of industrial networks that have short packet lengths and are used in harsh and noisy environments. In this paper, a novel three‐dimensional discrete‐time Markov chain model has been proposed for the IEEE 802.11‐based industrial wireless networks using the distributed coordination function as the medium access control mechanism in the worst‐case saturated traffic. It considers both causes of the backoff freezing: busy channel and the successive interframe space waiting time. In this way, it provides a much more accurate estimation of the channel access and error probabilities, resulting in a more accurate network parameter calculation. Also, based on the proposed model, a comprehensive packet delay analysis, including average, jitter, and cumulative distribution function, has been provided for the near 100% reliable industrial scenario and error‐prone channel condition, which in comparison with similar pieces of work provides much more accurate results. Copyright © 2014 John Wiley & Sons, Ltd.

A Novel Channel Access Mechanism for IEEE 802.15.4e to Promote Internet of Things

“…Madani et al in [10] considers the backoff freezing and busy channel to estimate the collision probabilities more accurately. Similar to the previous work, Motamedi et al in [11] evaluate the DCF in noisy wireless networks. They also present models the slotted CSMA/CA to find various metrics under saturation conditions.…”

“…Similarly, the probability of resetting the back-off timer to zero after reaching the maximum retry limit is given by (12) and (14). Going to the first back-off stage after a retransmission is given by (11), and the probability to go to idle state is given by (12), (13), (14) and (15). Using the equation (2)-(15), the closed form expression is given by , ,0…”

Refining TCP's RTT dependent mechanism by utilizing link retransmission delay measurement in Wireless LAN

“…Motivated by the fact that most of today's 802.11 devices operate in the DCF mode only [38], this section describes the basic DCF operations. Two coordination functions are defined, namely, the mandatory distributed coordination function (DCF) based on Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) and the optional point coordination function (PCF) based on poll and response mechanism.…”

“…Two coordination functions are defined, namely, the mandatory distributed coordination function (DCF) based on Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) and the optional point coordination function (PCF) based on poll and response mechanism. Motivated by the fact that most of today's 802.11 devices operate in the DCF mode only [38], this section describes the basic DCF operations.…”

Fog-based healthcare systems: A systematic review

“…End devices such as access points and set-top-boxes could host these services. This distributed computing architecture enables applications to run in the closest point to captured data explored from things, people, or processes [ 39 , 60 , 61 ]. Frankly speaking, fog computing is a type of cloud computing close to the 'ground' that automatically creates the response.…”