Performance analysis of IEEE 802.11 DCF in presence of transmission errors

Chatzimisios, Periklis; Boucouvalas, Anthony C.; Vitsas, V.

doi:10.1109/icc.2004.1313274

Cited by 138 publications

(111 citation statements)

References 6 publications

Supporting

Mentioning

110

Contrasting

Unclassified

Order By: Relevance

“…(15) and (17) into Eq. (18), becomes the following: (19) The error probability of transmitting an RTS frame is defined as the following: (20) The error probability of transmitting a CTS frame is defined as the following:…”

Section: = (15)mentioning

confidence: 99%

See 1 more Smart Citation

Linear Approximation Model Throughput Performance Analysis of IEEE 802.11 Distributed Coordinated Function in Wireless Lossy Channel

Abdulghani¹

2018

IJCA

View full text Add to dashboard Cite

One source of performance degradation in wireless networks is the frame error that occurs because of nonideal channel conditions. Most previous works assume an ideal transmission channel (i.e., no error in transmission), whereas other works assume that the error is constant and exists only in data packets. These previous works do not consider transmission errors in control frames (i.e., RTS, CTS, and ACK). Therefore, this paper proposes an analytical approximation model to computes the saturation throughput, conditional collision probability, and packet transmission probability, of IEEE 802.11 distributed coordination function (DCF) in the presence of a determinate number of nodes (n) and a wireless noise channel condition. The transmission error that occurs in the data packets and control frames are considered for the computation of the saturation throughput. Furthermore, the effect of network size (n), maximum backoff stage (m), packet length, and minimum backoff window size (W) on the saturation throughput is investigated. The results indicate that the performance of IEEE 802.11 DCF strongly depends on number of nodes, packet length, and BER.

show abstract

Section: = (15)mentioning

confidence: 99%

“…A model that calculates the throughput, average packet delay, and packet drop probability has been proposed in [19], [20]. The authors considered the channel bit errors and packet retry limits of the basic access method and assumed that an error exists in the data frame.…”

Section: Introductionmentioning

confidence: 99%

Linear Approximation Model Throughput Performance Analysis of IEEE 802.11 Distributed Coordinated Function in Wireless Lossy Channel

Abdulghani¹

2018

IJCA

View full text Add to dashboard Cite

show abstract

“…802.11, 1999;Wu et al, 2002;Chatz imisios et al, 2004;Prakash and Thangaraj, 2010). In (Chatzimisios et al, 2004), the performance of IEEE 802.11 assumes that there is a finite transmission and presence of transmission error. In an adhoc network (Priakanth and Thangaraj, 2009), proposed an efficient packets scheduling and queuing algorithm by achieving better fairness in Medium Access Control (MAC) protocol.…”

Section: Introductionmentioning

confidence: 99%

Analytical Modeling of IEEE 802.11e Enhanced Distributed Channel Access under a Non-Saturation Condition

Prakash¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: The IEEE 802.11e EDCA protocol with different access Categories (ACs) supporting for Quality-of-Service (QoS). Due to internal or external packet collision, the Contention Window (CW) of the station increases the channel idle time under high Bit Error Rate (BER). Approach: In this study, we propose an analytical model for performance evaluation of IEEE 802.11e EDCA scheme under non-saturation condition and error prone channel. The new markov chain model have decrease the channel idle time in IEEE 802.11 EDCA and considerably increases the throughput for minimum number of station. Results: We develop an expression for the nonsaturation throughput as a function of the number of stations, packet sizes and BER. Conclusion: We validate the accuracy of our analysis with simulation expression. Using this model, the contention factors can be set appropriately to attain particular Quality-of-Service (QoS) requirements.

show abstract

“…The performance of the DCF in the presence of transmission error was evaluated in [4] [5]. For effective management of wireless resources, Ki et al proposed a Binary Negative-Exponential Backoff (BNEB) algorithm [6].…”

Section: Introductionmentioning

confidence: 99%

Performance Evaluation of Binary Negative-Exponential Backoff Algorithm in Presence of a Channel Bit Error Rate

Choi

Chung

et al. 2007

Computational Science – ICCS 2007

View full text Add to dashboard Cite

Abstract. The IEEE 802.11 standard basically uses a DCF (Distributed Coordination Function) to access a wireless channel. However, the DCF uses wireless resource ineffectively when there are many contending stations and a high bit error rate. To enhance the performance of the wireless LAN, Ki et al. proposed a Binary Negative-Exponential Backoff (BNEB) algorithm. We found that the performance of the BNEB algorithm was better than the conventional DCF. However, erroneous channel environment was not considered. In our work, we propose an analytical model for the BNEB algorithm in the presence of transmission error and compare the performance of the DCF with the BEB algorithm to that with the BNEB algorithm. From the result, the BNEB algorithm yields better performance than the DCF when the bit error rate (BER) ≤ 10 −5 .

show abstract

Performance analysis of IEEE 802.11 DCF in presence of transmission errors

Cited by 138 publications

References 6 publications

Linear Approximation Model Throughput Performance Analysis of IEEE 802.11 Distributed Coordinated Function in Wireless Lossy Channel

Linear Approximation Model Throughput Performance Analysis of IEEE 802.11 Distributed Coordinated Function in Wireless Lossy Channel

Analytical Modeling of IEEE 802.11e Enhanced Distributed Channel Access under a Non-Saturation Condition

Performance Evaluation of Binary Negative-Exponential Backoff Algorithm in Presence of a Channel Bit Error Rate

Contact Info

Product

Resources

About