A Novel Markov Chain Model to Derive the Expected Contention Window Size and Backoff Counter for IEEE 802.11 WLAN Nodes

2015 ◽  
pp. 3-13
Author(s):  
Yi-Hua Zhu ◽  
Chaoran Zhu ◽  
Xianzhong Tian
Keyword(s):  
Markov Chain ◽  
Ieee 802.11 ◽  
Markov Chain Model ◽  
Window Size ◽  
Contention Window ◽  
Chain Model ◽  
Ieee 802.11 Wlan ◽  
Contention Window Size ◽  
802.11 Wlan

Several Contention Window Adjustment Techniques for Improving Unsaturated throughput of Wireless LANs

2014 ◽  
Vol 931-932 ◽  
pp. 952-956
Author(s):  
Jesada Sartthong ◽  
Suvepon Sittichivapak ◽  
Nitthita Chirdchoo
Keyword(s):  
Load Condition ◽  
Window Size ◽  
Traffic Load ◽  
Contention Window ◽  
Area Network ◽  
Chain Model ◽  
Function Concept ◽  
Contention Window Size ◽  
Comparison Results ◽  
Size Adjustment

This paper proposes the several contention window adjustment schemes in backoff process as well-known backoff algorithm (BA) for improving the performance of wireless local area network (WLAN). In addition, this research introduces a new unsaturated discrete Markov chain model in fixed backoff stages and fixed contention window sizes technique (FBFC). The proposed contention window adjustment schemes are designed by applying the moment generating function concept in random variable and process theorem. Unsaturated throughput parameters are used to compare the performance of all contention window size adjustment techniques based on IEEE802.11b WLAN standards. The comparison results show that Bernoulli and Double adjustment schemes are good contention window size adjustments at light traffic load, and the Even contention window size adjustment operates well at high traffic load condition.

Sign in / Sign up

Export Citation Format

Share Document