 Research
 Open Access
 Published:
Fairness analysis of throughput and delay in WLAN environments with channel diversities
EURASIP Journal on Wireless Communications and Networking volume 2011, Article number: 42 (2011)
Abstract
The article investigates fairness in terms of throughput and packet delays among users with diverse channel conditions due to the mobility and fading effects in IEEE 802.11 WLAN (wireless local area networks) environments. From our analytical results, it is shown that 802.11 CSMA/CA can present fairness among hosts with identical link qualities regardless of equal or different data rates applied. Our analytical results further demonstrate that the presence of diverse channel conditions can pose significant unfairness on both throughput and packet delays even with a link adaptation mechanism since the MCSs (modulation and coding schemes) available are limited. The simulation results validate the accuracy of our analytical model.
1. Introduction
Recently, IEEE 802.11 based wireless local area networks (WLAN) become increasingly prevailing with their ubiquitous nature and low cost infrastructure. The IEEE 802.11 standards [1] on medium access control (MAC) specify two fundamental mechanisms for channel arbitration, namely, distributed coordination function (DCF) and point coordination function (PCF). DCF is a random access mechanism based on the protocols of carrier sense multiple access with collision avoidance (CSMA/CA). PCF is a centralized scheduling protocol which uses a point coordinator at the access point (AP). Most of current 802.11 WLAN products employ DCF on account of its distributed nature for the simplicity of implementation [2]. To such networks, fairness is of particular concern since the overall system performance essentially depends on the allocation of transmission slots among users. It is considered over a short or long period of time separately for pertinently reflecting the performance of the specific applications or protocols. For example, the behavior of shortterm fairness can make a significant impact on TCP transfers or delaysensitive multimedia applications [3]. In general, shortterm fairness means around an order of 10 ms scales while longterm fairness may involve a transmission of thousand packets [4].
Throughput and packet delays are two key measures reflecting the fairness performance of IEEE 802.11 WLANs. Bianchi [5] first proposed a Markov model for IEEE 802.11 DCF to evaluate saturation throughput. Ziouva et al. [6] improved Bianchi's model by considering that the backoff counter is frozen when the channel is sensed busy. Based on the above two works, Xiao [7] developed an analytical model for enhanced distributed coordination function (EDCF) of IEEE 802.11e WLAN [8]. However, most of these works analyzed throughput performance of DCF protocols in homogeneous PHY situations, i.e. equal data rates and identical channel conditions, which are inconsistent with practical WLAN environments. Wireless channels actually are timevarying due to fading, noise, interference, mobility etc., and therefore the varying channel conditions can affect the used data rates. Consequently, these previous analytical approaches considering only homogeneous PHY situations may be insufficient to tackle realistic WLAN environments.
The fairness performance of IEEE 802.11 WLAN is essentially affected by both the MAClayer protocol and PHY channel diversity (also called multiuser diversity) [9], i.e., varied channel conditions among stations and unequal data rates determined by the applied link adaptation scheme. The authors in previous work [9–11] used experiments and simulations to study throughput performance of 802.11 DCF with channel diversities. However, they did not offer a complete theoretical analysis which can be the most important base for understanding the userdiversity impact on the system performance of DCF. We are thus motivated to propose in this article an analytical model to analyze the fairness performance of DCF protocols with the crosslayer effects of PHY channel diversities. Our analytical approach is developed by extending a twodimensional Markov chain model of DCF proposed by Bianchi [5] for considering timevarying channel conditions. However, our analytical model takes into account more realistic factors, including the finite retransmission limit, the probability that the backoff counter is frozen when the channel is sensed busy, errorprone channels, and also multiple data rates. Thus, by comparison with previous work [5, 7, 12], our approach can more efficiently reflect the behavior of the present 802.11 protocols performing in realistic environments.
The contribution of this work is that we offer a theoretical model to thoroughly analyze the crosslayer impact of PHY channel diversities on the fairness performance of 802.11 DCF in terms of both throughput and packet delays. Through our analyses, it is shown that 802.11 CSMA/CA can present fairness only on condition that the link qualities of all the hosts are equal in a statistical average sense. It is also observed that diverse channel conditions can pose significant unfairness of both throughput and packet delays even with a link adaptation mechanism since MCSs (modulation and coding schemes) available are limited. We validate our analytical model via simulations and the results demonstrate its accuracy, showing the impracticality of providing performance analysis for DCF with only the consideration of homogeneous PHY conditions. The remainder of this article is organized as follows. In 'Related work' section, we discuss the related work. 'An analytical model of 802.11 DCF in errorprone channels' section, presents our analytical model of 802.11 DCF. In 'Validations' section, we validate the accuracy of this model via simulations. 'The numerical results and discussion' section shows analytical results which demonstrate the unfairness of 802.11 DCF due to diverse channel conditions. 'Conclusion' section draws our conclusions.
2. Related work
The fairness of IEEE 802.11 DCF has been largely studied with theoretical analyses, simulations, or experiments in previous work [2–4, 10, 13–35]. The fairness problems generally are discussed, respectively, with userdatagramprotocol (UDP) flows and transmissioncontrolprotocol (TCP) flows due to different behaviors of the two transport layer protocols. The considered transmission scenarios are further classified as two categories: transmissions among uplink flows or transmissions among uplink and downlink flows. A taxonomy table of the fairness problems in wireless networks is shown in Figure 1. With respect to UDP transmission scenarios, the authors in [13] propose an approach that reduces AP's channel sensing time from DCF interframe space (DIFS) to PCF interframe space (PIFS) in order to meet the required utilization ratio for downlink traffic flows. This approach grants AP the highest priority to transmit its data frames immediately, but may cause the entire channel slots occupied by AP before the required utilization ratio is matched. The work [14] develops a new distributed contention control (DCC) algorithm that combines transient and stationary characteristics of slot utilization to better estimate congestion level of the medium. The work [15] presents a dynamic contention window control scheme based on the number of downlink flows to achieve perflow fairness. Nevertheless, it does not consider some dynamics in WLAN environments such as channel conditions and traffic loads that can greatly impact the performance of fairness. The authors in [17] use an analytical approach to find optimal contention window sizes based on the observed idle slot intervals to achieve utility fairness between AP and wireless stations. However, the approaches proposed in [17] may need substantial modifications in the MAC layer protocols.
In general, the traffic load of downlink flows may be much heavier than that of uplink flows. The work in [2, 27, 28] investigate weighted fairness in case that the downlink and uplink traffic loads are asymmetric. The authors in [2] present the bidirectional DCF (BDCF) which provides a preferential treatment to downlink traffic by piggybacking AP's data packets after acknowledge (ACK) frames. This approach can provide a ratio of downlink throughput to uplink throughput up to 1. The work [27] develops adaptive schemes to achieve weighted fairness between uplink/downlink traffic flows by dynamically adjusting the backoff counters of AP and stations. The authors in [28] apply differentiated minimum contention windows (CW) for AP and wireless stations to tune their channel utilization ratio.
The TCP unfairness problems in wireless networks have been researched in [29–33]. The work [29] provides a detail analysis of perflow and perstation fairness for TCP flows. In [30] the authors propose a differentiated approach which involves multidimensional parameters including minimum CWs, arbitration interframe space (AIFS), and transmission opportunity (TXOP), to solve the TCP fairness problem between uplink and downlink traffic flows in 802.11e WLANs. The authors in [31] develop a crosslayer feedback approach to achieve perstation fairness by estimating each station's access time and queue length. The work [32] solves the TCP fairness problem by using a dual queue scheme in which one queue is specified for data packets of downlink TCP flows and the other is for ACK packets.
Most of the previous work present the observation that DCF is fair over long time scales but can not provide shortterm fairness. Koksal et al. [3] argued that shortterm unfairness is due to a phenomenon posed by the backoff protocol in CSMA/CA: a host capturing the channel will likely keep it after a contention period, which is similar to the wellknown 'capture effect' shown in Ethernet [36]. However, BergerSabbatel et al. [4, 22] provided a contrary perception that DCF indeed presents pretty fine shortterm fairness and consequently provides longterm fairness while shortterm fairness implies longterm fairness, but not vice versa [3]. They argued that the confusion of fairness problem in the previous work [3] is as a result of using the CSMA/CA protocol specific to Wavelan system [37] instead of that characterized in 802.11 standards. Indeed, there is an important difference between the two access methods: the Wavelan CSMA/CA protocol executes exponential backoff when the channel is sensed busy, whereas 802.11 protocol does that only when a collision is experienced. Although the analysis of BergerSabbatel et al. [4, 22] is rather consistent with the behavior of the present 802.11 protocols, however, the conclusion is valid only under the assumption of homogeneous transmission qualities among the participating hosts, which may be unrealistic while hosts can experience unequal channel conditions due to mobility, fading, interference factors, and so on. Since an 802.11 exponential backoff performed is actually due to not only a transmission collision but also a packet corruption with bad signal qualities, the backoff behavior of hosts will be varied with their own link qualities, thereby leading to an unequal sharing of transmission channels.
3. An analytical model of 802.11 DCF in errorprone channels
In this section, we analyze IEEE 802.11 DCF protocols under UDP transmission scenarios by extending a twodimensional Markov chain model first proposed by Bianchi [5]. Our analytical model can be used to evaluate the statistical performance of DCF in realistic WLAN environments since it takes more factors into account including the finite retransmission limit, the probability that the backoff counter is frozen when the channel is sensed busy, errorprone channels, and multiple data rates. Furthermore, we provide performance analyses for both throughput and packet delay.
3.1. Overview of IEEE 802.11 DCF
First we briefly introduce 802.11 DCF based on CSMA/CA. DCF consists of two access schemes, namely, basic scheme and fourway handshaking scheme. In the basic scheme, a host with a packet ready for transmission senses the medium first. While the medium is sensed idle for a period equal to a DCF interframe space (DIFS), the packet will be transmitted immediately. If the packet is then received successfully, the receiver host will send an acknowledgement (ACK) packet to the sender host after a short interframe space (SIFS). Otherwise, the sender host would choose an interval randomly from the backoff window before retransmitting the packet. The backoff counter is decremented in terms of slot time when the channel keeps idle. The counter is frozen when the channel is sensed busy and reactivated when the channel is sensed idle again for more than a DIFS. When the counter reaches 0, the packet is retransmitted. If the packet retransmission is failed, the sender will increase its backoff window exponentially and perform another retransmission until the retry times come to a certain limit. In fourway handshaking scheme, the sender host transmits a requesttosend (RTS) packet first. If the receiver host hears RTS, it replies with a cleartosend (CTS) packet. After receiving the CTS, the sender transmits the data packet. When successfully receiving the packet, the receiver replies with an ACK packet.
3.2. The analytical model
In this model, we consider K IEEE 802.11 hosts in nonperfect channels. Assume that these hosts are within the transmission range of each other with each one always having a packet to send (i.e., operating in saturation conditions). To host i (i = 0 to K 1), let p_{ i, c } denote the probability of a packet collided with other hosts. That is:
where τ_{ h } is the probability for host h transmitting a packet in a given slotted time. To host i, let p_{ i, e } denote the probability of a packet corrupted due to errorprone channels. p_{ i, e } basically depends on SNR (signaltonoise ratio), the used MCS, and the transmitting frame size [38]. Consider uncoded modulations like what are adopted from 802.11b standards and assume that the BER (bit error rate) of host i, p_{ i, b } is unchanged inside each packet. Thus, p_{ i, e } can be expressed as:
where FS _{ i } is the frame size in bytes. To host i, the probability of a transmission failed, p_{ i, f } , which consists of the probability of a packet collided and a collisionfree packet corrupted can be expressed as:
In 802.11, a host needs to wait for a random backoff time before the next transmission to avoid a collision with other hosts. The random backoff timer is uniformly chosen in the interval (0, CW1), where CW is the contention window size. After each retransmission due to a collision or a corruption, the CW will be doubled until the number of retries comes to a certain limit, L_{retry}. Let CW_{min} denote the initial CW, and CW _{ j } denote the CW in the j th backoff stage. Once the CW reaches a maximum value CW_{max}, it will remain at the value until it is reset. Therefore, the relationships among CW_{j}, CW_{min}, CW_{max}, and L_{retry} are shown as follows:
For host i, let s(i, t) and c(i, t) be the stochastic process representing the backoff stage and backoff time counter at time t, respectively. The twodimensional process {s(i, t), c(i, t)} can be modeled with the discretetime Markov chain shown in Figure 2. For the simplicity of illustration, we adopt the notation,
Thus, from the twodimensional Markov chain we can obtain the following equations:
The first equation in (5) represents the fact that the backoff counter is decremented when the channel is sensed idle with the probability of (1p_{ i, c } ) or frozen otherwise. The second equation accounts for the situation that a successful packet transmission with the probability of (1p_{ i, f } ) will return to backoff stage 0 and the counter is uniformly chosen in the interval (0, CW_{min}1). The third equation considers the case of unsuccessful packet transmission that a retransmission due to collision or corruption will enter into the next backoff stage. Finally, the forth equation accounts for the fact that if the number of retries reaches the maximum value L_{retry}, the backoff stage will be reset to 0 no matter the consequent transmission is successful or failed.
Let be the stationary state probabilities of the Markov chain shown in Figure 2. From the chain regularity and by means of a simple computation, the following equations can be derived:
Equations 6 and 7 express all b_{ i, j, l } values as a function of b_{ i,0,0 } , p_{ i, c } and p_{ i, e } . With the following normalization condition imposed,
finally b_{i,0,0}is given by (9):
Since a given host transmits when its backoff timer reaches 0, the probability that host i transmits a packet in a randomly chosen slotted time, τ_{ i } , can be derived as:
From Equation 10 we can see that τ_{ i } depends on the probability of transmission failure p_{ i, f } , which is determined with the collision probability p_{ i, c }and the corruption probability p_{ i, e } . From Equations 2 to 4 and 9 and 10, we can solve unknown parameters τ_{ i } and p_{ i, f } numerically with a given set of frame size (FS_{1}, FS_{2}....FS_{K}) and BERs (p_{1, b}, p_{2, b}....p_{ K, b } ) corresponding to the K hosts.
3.3. Throughput analysis
Let P_{tr} be the probability that at least one station transmits in the considered slotted time:
Let P_{i, single}denote the probability that only host i transmits and the remaining K1 stations are idle on condition that at least one station transmits. Thus, it is expressed as:
Considering a given slot, the channel idle probability is (1P_{tr}). The channel busy probability is P_{tr}, which consists of the following parts: the probability of a successful transmission of host i, the probability of a successful transmission of host h (h≠i), ; the probability of a failed transmission due to nonperfect channel conditions, ; and the probability f a failed transmission due to collision, . Hence the average length of a random slot normalized with the slotted time T_{slot}, E[slot] is derived from Equation13:
where Ts_{ h } , Te_{ h } are the time of host h processing a successful transmission and experiencing a failed transmission due to a corruption respectively; T c is the period of a collision. The values of Ts_{ h } and T c depend on the channel access mechanism. In case of the basic scheme, they can be expressed as:
and for the fourway handshaking scheme, they are:
Te_{ h } is equal to Ts_{ h } in both of the basic and fourway handshaking scheme. DIFS, SIFS, H, ACK and γ denote DIFS time, SIFS time, the time to transmit the header, the time to transmit an ACK, and the time of propagation delay, respectively. Tl* is the time of the longest payload transmitted in a collision; Tl_{ h } denotes the time of host h transmitting its payload. It can be expressed as:
where PL _{ h } is the payload length of host h in bytes and r_{ h } is the used data rate of host h for transmitting data packets.
The normalized saturation throughput of host i, nS_{ i } , which is defined as the fraction of time that the channel is used for host i to successfully transmit payload, can be expressed as:
Finally, the saturated throughput of host i, S_{ i } is thus given by:
3.4. Delay analysis
A delay for a successfully transmitted packet is defined as the duration from the time the packet is at the front of the MAC queue ready to be transmitted, until an acknowledgement informing this packet is received [12]. To calculate the average delay, the knowledge of packetdropping probability and average packetdropping time is necessary. Let P_{i, drop}denote the packetdropping probability of host i. Since a packet is dropped if it encounters L_{retry} + 1 failures, the probability P_{i, drop}is equal to:
To host i, let E_{ i } [T_{drop}] be the average number of slots required for a packet to experience L_{retry} + 1 failures in the (0,1,...,L_{retry}) stages. The average number of slots required for a packet waiting for transmission in the j stage is (CW_{j}+1)/2, and thus E_{ i } [T_{drop}] can be expressed as:
The average number of slots required for host i to successfully transmit a packet, E_{ i } [X], is given by:
where is the probability that a packet that is not dropped reaches stage j. After calculation, Equation 19 becomes (20):
Thus the average packet delay of host i, E_{ i } [D], provided that this packet is not discarded, is then derived with Equations 13 and 20:
4. Validations
In this section, we conduct simulations to validate our analytical model. We adopt in this model the same parameters as those in the analytical model shown in Table 1. The IEEE 802.11 simulation model is developed using the C++ programming language based on IEEE 802.11b standard (e.g., the initial backoff window is 32) [1]. For demonstration purposes, the data rate is 1 Mbps and the transmitting packet length is fixed as 1023 bytes. The packet is sent once every 10 ms to simulate a saturated traffic condition. Each result comes from the simulation of 100000 transmissions of packets.
In particular, we examine both the cases of equal and unequal channel conditions for transmitting stations. Figure 3 presents the simulation results and numerical results of the average throughputs of a station (the number of stations ranges from two to twenty) while all the transmitting stations are in perfect channel conditions (i.e., BER = 0). As shown in the figure, we have a rather good match between the simulation results and analytical results (the maximum error is 1.89%). Figure 4 shows the throughput of two stations individually in case that one station (denoted as IC host) is in perfect channel conditions while the other one (denoted as EC host) is in errorprone channels with the BER ranging from 0 to 8E5. It is observed in Figure 4 that when the channel conditions become more diverse, the difference between the simulation results and our analytical results generally are enlarged (the maximum error is 8.35%). We think that the increasing error might be caused by the implementation of a statistical channelerror model using the eventdriven simulation program (e.g., to implement BER on the occurrence of transmission failures). As illustrated in these figures, the analytical results and simulation results essentially can match pretty well. The simulation results demonstrate the accuracy of our analytical model.
5. The numerical results and discussion
In this section, we provide numerical results to demonstrate the unfairness of 802.11 DCF due to diverse channel conditions. The transmission scenario is as follows. Consider an 802.11b WLAN environment with two stations. Both the two stations transmit a saturated traffic flow with a fixed packet size using the basic CSMA/CA scheme. The adopted system parameters are presented in Table 1. We provide performance analyses in both cases of stations transmitting at an equal data rate and at different data rates with a link adaptation mechanism. Then we use the Jain fairness index [3] associated with the analytical results to evaluate the fairness performance of IEEE 802.11 DCF. This index is represented as:
where K is the number of stations. x_{ i } can be the throughput or delay associated with station i. The index has a range of (0, 1] to evaluate fairness. Furthermore, we provide an example in Subsection 5.2 to show that applying the link adaptation cannot completely get rid of the effect of diverse link qualities due to limited MCSs available, and this can pose severe unfairness as we show in Subsection 5.1 and 5.3 later.
5.1. Diverse link qualities with equal data rates
First we analyze the scenario the hosts transmit at an equal data rate to demonstrate the unfairness due to diverse link qualities. Consider the two hosts use the same data rate of 1 Mbps. Assume one of them, named idealchannel (IC) host, is always in a stationary and ideal channel condition (i.e., BER = 0), whereas the other one, named errorpronechannel (EC) host, is initially in an ideal condition and later suffer from channel degradation due to the mobility with an average BER ranging from 0 to 8E5.
The saturated throughput and packet delay of each host are derived from Equations 16 and 21, respectively, and presented in Figures 5 and 6 with respect to the BER of EC host. It is shown that when the two hosts are in an ideal condition initially, their performances are equal no matter in terms of throughput or delay. When the BER of EC host deteriorates later, the performance variation of the two hosts is gradually enlarged. For instance if both the two hosts are in an ideal channel, the achievable throughput of each one is about 436 kbps as shown in Figure 5. In case EC host's BER deteriorates as 2E5, its throughput degrades to 319 kbps, whereas the throughput of IC host with ideal conditions increases to 494 Kbps. The performance variation is as large as 40.3% (176 kbps/436 kbps = 40.3%). The corresponding Jain fairness indices associated with throughput and packet delay are derived from Equation 22 and shown in Figures 7 and 8, respectively. It is also indicated that with the increasing difference of link qualities, fairness degrades as the indices associated with throughput and delay decrease from 1 to about 0.64 and 0.68, respectively.
The performance variation arises by the following facts. Due to its higher BER, EC host averagely experiences more retries to succeed a transmission than IC host does. When a retransmission is performed, according to CSMA/CA standards, the backoff window size will be increased exponentially until the retries come to a certain limit. Thus EC host would averagely adopt a larger backoff timer and then has less chance to access the channel. Such the unfair behavior is similar to the scenarios of asymmetric information among nodes [39]. Our analytical results also demonstrated that when all the hosts transmit at an equal data rate, 802.11 CSMA/CA can only present fairness on condition of homogeneous link qualities; the presence of diverse link qualities can cause significant unfairness.
5.2. The discussion of diverse transmission qualities
In this subsection, we provide an example to show that in the presence of diverse channel conditions, applying multiple data rates with a link adaptation mechanism cannot completely equalize transmission qualities, thereby causing a similar unfair behavior as shown in Subsection 5.1. Consider IEEE 802.11b WLAN environments in which the MCSs available are uncoded differential binary phase shift keying (DBPSK), differential quadrature phase shift keying (DQPSK), complementary code keying 5.5 (CCK 5.5), and CCK 11 providing the data rate at 1, 2, 5.5, and 11 Mbps, respectively. With a given SNR, the BER performed with these MCSs can be obtained empirically with experiments or theoretically with analyses. Figure 9 shows the BER vs. SNR of the 4 802.11b PHY modes provided empirically with Intersil WLAN product called HFA3861B in the environment with additive white Gaussian noise (AWGN) [40]. A link adaptation mechanism will dynamically select one MCS such that BER of the selected MCS with the highest data rate is within a prescribed performance bound, e.g., a range less than 10^{4} to 10^{6}[41]. Consider that host A and host B have respectively experienced SNRs of 4 and 13 dB and both use the MCS of CCK 11 in a given time. Thus BERs for host A and host B are about 4 × 10^{2} and 1 × 10^{6}, respectively, as shown in Figure 9, presenting a variation as large as about 4 × 10^{4} times. By using the link adaptation scheme described above, MCS for host A changes to DQPSK with a much lower BER of 2 × 10^{5}. The link quality is effectively improved and the diversity of BER between hosts is greatly narrowed. However, the link qualities still present a certain difference of around 20 times, which can pose significant unfairness of channel sharing as we show in Subsection 5.3 later. From this example, it is shown that applying a link adaptation mechanism cannot completely get rid of the effect of diverse link qualities at most of the time due to limited MCSs available.
5.3. Diverse link qualities with unequal data rates
Now we use the scenario which hosts transmit at unequal data rates with a link adaptation mechanism for demonstrating the unfairness due to diverse link qualities. Consider that the link adaptation mechanism is applied with a performance bound, BER < 10^{4}. Assume that IC host transmits at a data rate of 1 Mbps in a stationary and perfect channel condition, whereas EC host transmits at 11 Mbps in an ideal condition initially and later suffers from channel degradation with an average BER ranging from 0 to 8 × 10^{5}. Figure 10 presents the saturated throughput of the two hosts. It is shown that when both of them are with ideal channel conditions initially, they present identical performances. This phenomenon is so called 'performance anomaly' [10] meaning that if at least one host transmits at a lower data rate, the throughput of the others at higher rates will be degraded below the level of the lower rate. The analytical results demonstrate that 802.11 CSMA/CA can present fairness regardless of the same or different data rates under the condition of homogeneous link qualities.
However, when the difference of channel conditions of the two hosts later enlarges gradually, the throughput of EC host suffers from more and more starvation whereas that of IC host remaining in a good condition is progressively increased. For example, if both the two hosts are in ideal conditions, their throughputs are equal as about 782 kbps. When the BER degrades to 4E5 later, EC host's throughput is extremely degraded to 320 Mbps whereas that of IC host is increased to 824 kbps. The throughput variation between the two stations is as large as 65% (504/782 kbps = 64.75%). Note that the throughput performance of a host does not correspond with its used data rates (i.e., the throughput of EC host using the data rate of 11 Mbps is even lower than that of IC host with 1 Mbps) due to diverse link qualities. The corresponding Jain fairness index shown in Figure 11 also indicates that the throughputbased fairness gradually fades away such that the index decreases from 1 to about 0.64. From these results, we show that the skewed performance of throughput and packet delay is caused by diverse link qualities rather than unequal data rates. The diverse link qualities can cause the severe unfairness to hosts either at an equal rate or at different rates with a link adaptation mechanism.
6. Conclusion
In this article, we study the fairness of throughput and packet delays in IEEE 802.11 WLAN environments with diverse channel conditions. In this article, we exploit an analytical approach which extends a wellused two dimensional Markov chain model of DCF. From our analytical results, it is shown that 802.11 CSMA/CA can present fairness only provided that the link qualities of all the hosts are equal in a statistical average sense. It is also shown that the presence of diverse channel conditions can cause severe unfairness of channel sharing even with a link adaptation mechanism. We validate our analytical model via simulations and the results demonstrate its accuracy.
Abbreviations
 ACK:

acknowledge
 AIFS:

arbitration interframe space
 AP:

access point
 AWGN:

additive white Gaussian noise
 BDCF:

bidirectional DCF
 BER:

bit error rate
 CCK 5.5:

complementary code keying 5.5
 CSMA/CA:

carrier sense multiple access with collision avoidance
 CTS:

cleartosend
 CW:

contention windows
 DBPSK:

differential binary phase shift keying
 DCC:

distributed contention control
 DCF:

distributed coordination function
 DIFS:

DCF interframe space
 DQPSK:

differential quadrature phase shift keying
 EC:

errorpronechannel
 EDCF:

enhanced distributed coordination function
 IC:

idealchannel
 MAC:

medium access control
 MCSs:

modulation and coding schemes
 PCF:

point coordination function
 PIFS:

PCF interframe space
 RTS:

requesttosend
 SIFS:

short interframe space
 SNR:

signaltonoise ratio
 TCP:

transmissioncontrolprotocol
 TXOP:

transmission opportunity
 UDP:

userdatagramprotocol
 WLAN:

wireless local area networks.
References
 1.
IEEE 802.11a/b: Wireless LAN medium access control (MAC) and physical layer (PHY) specifications, standard. IEEE 1999.
 2.
Nandiraju NSP, Gossain H, Cavalcanti D, Chowdhury KR, Agrawa DP: Achieving fairness in wireless LANs by enhanced IEEE 802.11 DCF. In Proceedings of IEEE Conference on Wireless and Mobile Computing, Networking and Communications (WiMob). Montreal, Canada; 2006:132139.
 3.
Koksal CE, Kassab H, Balakrishnan H: An analysis of shortterm fairness in wireless media access protocols. In Proceedings of ACM SIGMETRICS. California, USA; 2000:118119.
 4.
BergerSabbatel G, Duda A, Gaudoin O, Heusse M, Rousseau F: Fairness and its impact on delay in 802.11 networks. In Proceediings of IEEE GLOBECOM. Texas, USA; 2004:29672973.
 5.
Bianchi G: Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J Sel Areas Commun 2000, 18(3):535547. 10.1109/49.840210
 6.
Ziouva E, Antonakopoulos T: CSMA/CA performance under high traffic conditions: throughput and delay analysis. Comput Commun 2002, 25: 313321. 10.1016/S01403664(01)003693
 7.
Xiao Y: An analysis for differentiated services in IEEE 802.11 and IEEE 802.11e wireless LANs. In Proceedings of IEEE International Conference on Distributed Computing Systems. Tokyo, Japan; 2004:3239.
 8.
IEEE 802.11e/D5.0: Draft Supplement to Part 11: wireless medium access control (MAC) and physical layer (PHY) specifications: medium access control (MAC) enhancements for quality of service (QoS). 2003.
 9.
Choi S, Park K, Kim C: Performance impact of interlayer dependence in infrastructure WLANs. IEEE Trans Mobile Comput 2006, 5(7):829845.
 10.
Heusse M, Rousseau F, BergerSabbatel G, Duda A: Performance anomaly of 802.11b. In Proceedings of IEEE INFOCOM. San Francisco, USA; 2003:836843.
 11.
Yang Y, Marina M, Bagrodia R: Experimental evaluation of application performance with 802.11 PHY rate adapatation mechanisms in diverse environments. In Proceedings of IEEE WCNC. Las Vegas; 2006:22732278.
 12.
Chatzimisios P, Boucouvalas AC, Vitsas V: IEEE 802.11 packet delaya finite retry limit analysis. In Proceedings of IEEE GLOBECOM. San Francisco, USA; 2003:950954.
 13.
Kim SW, Kim BS, Fang Y: Downlink and Uplink Resource Allocation in IEEE 802.11 Wireless LANs. IEEE Trans Vehicul Technol 2005, 54(1):320327. 10.1109/TVT.2004.838887
 14.
Hu J, Erriksson K: A new distributed contention control protocol for the IEEE 802.11 MAC layer. In Proceedings of the 1st International Conference on EBusiness and Telecommunication Networks. Setubal, Portugal; 2004:393401.
 15.
Abeysekera BAHS, Matsuda T, Takine T: Dynamic contention window control to achieve fairness between uplink and downlink flows in IEEE 802.11 WLANs. In Proceedings of IEEE Wireless Communications and Networking Conference. Hong Kong, China; 2007:21092114.
 16.
Abeysekera BAHS, Matsuda T, Takine T: Dynamic contention window control mechanism to achieve fairness between uplink and downlink flows in IEEE 802.11 wireless LANs. IEEE Trans Mobile Comput 2008, 7(9):35173525.
 17.
Heusse M, Rousseau F, Guillier R, Duda A: Idle sense: an optimal access method for high throughput and fairness in rate changeful wireless LANs. In Proceedings of ACM SIGCOMM '05. Volume 35. Philadelphia, USA; 2005:121132.
 18.
Aquilera EL, Heusse M, Grunenberger Y, Rousseau F, Duda A, Casademont J: An asymmetric access point for solving the unfairness problem in WLANs. IEEE Trans Mobile Comput 2008, 7(10):12131227.
 19.
Trunganont A, Visoottiviseth V: Adaptive wireless bandwidth allocation for perstation fairness. In Proceedings of International Symposium on Communications and Information Technology (ISCIT). Incheon, Korea; 2009:12861291.
 20.
Bredel M, Fidler M: Understanding fairness and its impact on quality of service in IEEE 802.11. In Proceedings of IEEE INFOCOM. Rio de Janeiro, Brazil; 2009:10981106.
 21.
Khademi N, Othman M: Guaranteeing per station and per flow fairness of downstream and upstream flows over IEEE 802.11 WLAN. In Proceedings of International Conference on Information and Multimedia Technology (ICIMT). Jeju Island, Korea; 2009:431435.
 22.
BergerSabbatel G, Duda A, Heusse M, Rousseau F: Shortterm fairness of 802.11 networks with several hosts. In Proceedings of Sixth IFIP IEEE International Conference on Mobile and Wireless Communication Networks. Paris, France; 2004:263274.
 23.
Barrett CL, Marathe MV, Engelhart DC, Sivasubramaniam A: Analyzing the shortterm fairness of IEEE 802.11 in wireless multihop radio networks. In Proceedings of IEEE International Conference on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems. Texas, USA; 2002:137144.
 24.
He J, Pung HK: A fairer multiple access protocol for multihop wireless networks: hybrid asynchronous time division multiple access protocol (HATDMA). In Proceedings of IEEE International Conference on Local Computer Network. Bonn/Königswinter, Germany; 2003:356365.
 25.
Kwon Y, Fang Y, Latchman H: A novel MAC protocol with fast collision resolution for wireless LANs. In Proceedigns of IEEE INFOCOM. San Francisco, USA; 2003:853862.
 26.
Nandagopal T, Kim TE, Gao X, Bharghavan V: Achieving MAC layer fairness in wireless packet networks. In Proceedings of ACM International Symposium on Mobile Computing and Networking (MOBICOM). Boston, USA; 2000:8798.
 27.
Jeong J, Choi S, Kim CK: Achieving Weighted Fairness between Uplink and Downlink in IEEE 802.11DCFBased WLANs. In Proceedings of 2nd ACM International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine). Lake Vista, Florida, USA; 2005:1022.
 28.
Bottigliengo M, Casetti C, Chiasserini CF, Meo M: Smart traffic scheduling in 802.11 WLANs with access point. In Proceedings of IEEE VTCFall. Orlando, USA; 2003:22272231.
 29.
Seyedzadegan M, Othman M, Subramaniam S, Zukarnain Z: The TCP fairness in WLAN: a review. In Proceedings of IEEE Telecommunications and Malaysia International Conference on Communication. Penang, Malaysia; 2007:644648.
 30.
Leith DJ, Clifford P, Malone D, Ng A: TCP fairness in 802.11e WLANs. IEEE Commun Lett 2005, 9(11):964966. 10.1109/LCOMM.2005.11004
 31.
Park EC, Kim DY, Kim H, Choi CH: A crosslayer approach for perstation fairness in TCP over WLANs. IEEE Trans Mobile Comput 2008, 7(7):898910.
 32.
Ha J, Choi CH: TCP fairness for uplink and downlink flows in WLANs. In Proceedings of IEEE GLOBECOM. San Francisco, USA; 2006.
 33.
Wu Y, Niu Z, Zheng J: Study of the TCP upstream/downstream unfairness issue with perflow queuing over infrastructuremode WLANs. Wireless Commun Mobile Comput 2005, 5(4):459471. 10.1002/wcm.303
 34.
Wang C, Lin T: On fairness in heterogeneous WLAN environments. In Proceedings of IEEE GLOBECOM. San Francisco, USA; 2006.
 35.
Fang Z, Bensaou B, Wang Y: Performance evaluation of a fair backoff algorithm for IEEE 802.11 DFWMAC. In Proceedings of ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC). Lausanne, Switzerland; 2002:4857.
 36.
Deng S: Capture effect in residential Ethernet LAN. Proceedings of IEEE GLOBECOM, Singapore 1995, 16781682.
 37.
The Lucent Home Page[http://www.lucent.com/]
 38.
Qiao D, Choi S, Shin KG: Goodput analysis and link adaptation for IEEE 802.11a wireless LANs. IEEE Trans Mobile Comput 2002, 1(4):278292. 10.1109/TMC.2002.1175541
 39.
Kanodia V, Sabharwal A, Sadeghi B, Knightly E: Ordered packet scheduling in wireless ad hoc networks: mechanisms and performance analysis. In Proceediings of ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC). Lausanne, Switzerland; 2002:5870.
 40.
Pavon JdP, Chio S: Link adaptation strategy for IEEE 802.11 WLAN via received signal strength measurement. In Proceedings of IEEE ICC. Alaska, USA; 2003:11081113.
 41.
Liu Q, Zhou S, Giannakis GB: CrossLayer combining of adaptive Modulation and coding with truncated ARQ over wireless links. IEEE Trans Wireless Commun 2004, 3(5):17461755. 10.1109/TWC.2004.833474
Acknowledgements
This work was supported in part by Taiwan National Science Council under Grant 982221E003009 and 992221E003005.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Wang, C., Lo, H. & Fang, S. Fairness analysis of throughput and delay in WLAN environments with channel diversities. J Wireless Com Network 2011, 42 (2011). https://doi.org/10.1186/16871499201142
Received:
Accepted:
Published:
Keywords
 Wireless Local Area Network
 Packet Delay
 Contention Window
 Distribute Coordination Function
 Backoff Stage