Delay-Reliability Trade-off in MIMO-Enabled IEEE 802.11-Based Wireless Sensor and Actuator Networks

Maadani, Mohsen; Motamedi, Seyed Ahmad; Safdarkhani, Hadi

doi:10.1016/j.procs.2011.07.133

Cited by 8 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the models have extended the Bianchi's model to account for other parameters and situations, such as nonsaturated traffic and finite buffer size , finite retransmission attempts , error‐prone channel , channel capture , hidden terminal , and improving the accuracy of the model in predicting performance metrics by considering backoff freezing and so on . From a traffic point of view, most papers assume the saturation condition; each node always has a packet waiting to be transmitted . This can be considered as the worst‐case scenario that simplifies the network analysis and also results in an upper (lower) bound estimation about the normal/noncongested situation of the network delay (throughput).…”

Section: Related Pieces Of Workmentioning

confidence: 99%

“…Using the IEEE 802.11 technology in industrial wireless networks has recently been studied by experimental measurement and SIM which shows satisfactory performance for soft‐real‐time applications. Tian et al .…”

Section: Related Pieces Of Workmentioning

confidence: 99%

“…Here are some simplifying assumptions used in this paper, which are mostly common among the literature: All nodes always have a packet waiting to be transmitted (saturation traffic condition, similar to ). It somehow represents the worst‐case scenario, from the system performance point of view. The collision probability of a packet transmitted by each station is constant and independent, regardless of the number of retransmission already suffered (accurate for fairly large number of competing nodes ). Because of the industrial applications, the PL is assumed to be 32 bytes (the typical value for monitoring/control applications ). The basic access mechanism of the DCF is used. Because of the small size of the PL in industrial applications, the four‐way request to send/clear to send (RTS/CTS) mechanism is not practical .…”

Section: Markov Chain Model and Packet Delay Analysismentioning

confidence: 99%

See 2 more Smart Citations

A comprehensive DCF performance analysis in noisy industrial wireless networks

Maadani

Motamedi

2014

Int J Communication

View full text Add to dashboard Cite

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.

show abstract

Section: Related Pieces Of Workmentioning

confidence: 99%

Section: Related Pieces Of Workmentioning

confidence: 99%

Section: Markov Chain Model and Packet Delay Analysismentioning

confidence: 99%

See 1 more Smart Citation

A comprehensive DCF performance analysis in noisy industrial wireless networks

Maadani

Motamedi

2014

Int J Communication

View full text Add to dashboard Cite

show abstract

“…F OR MANY years, the IEEE 802.11 distributed coordination function (DCF) has been widely used as a dominant MAC protocol in wireless networks such as wireless local area networks (WLANs) [1]- [3], wireless sensor networks [4], [5], and wireless cognitive radio networks [6], [7]. Its wide applicability triggered a significant number of research works in analyzing and improving its performance.…”

Section: Introductionmentioning

confidence: 99%

“…It then follows that . From(1)and(29), we finally obtain(5).which is the probability that there are exactly successful packet transmissions until time and We also can get by the same method. Observe that and Hence, we can get as the coefficient of in By using(32) and(33), we have…”

mentioning

confidence: 99%

Design and Analysis of Medium Access Protocol: Throughput and Short-Term Fairness Perspective

Kim

Hwang

2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

We consider a simple MAC protocol, called the renewal access protocol (RAP), that adopts all of the legacy 802.11 standard but the backoff stage feature. To meet two objectives in the design of the RAP-optimal throughput and high short-term fairness-we develop a mathematical model of the RAP and rigorously analyze the performance of the RAP. First, we show that the throughput performance of the RAP depends only on the expectation of the selection distribution where the backoff counter is selected, provided that the number of terminals is fixed, which is in accordance with a well-known result. Second, with the help of renewal and reliability theories, we analyze the short-term fairness of the RAP. We also show that if the RAP has a selection distribution of the New Better than Used in Expectation (NBUE) type, the RAP can guarantee high short-term fairness. Third, we construct a special binomial distribution that is obviously of the NBUE type that can achieve high short-term fairness as well as optimal throughput when used as the selection distribution of the RAP. Furthermore, by the Poisson approximation for binomial distributions, we propose to use in practice a Poisson distribution corresponding to the special binomial distribution. Numerical and simulation results are provided to validate our analysis.

show abstract