Exploiting Multi-User Diversity in Wireless LANs with Channel-Aware CSMA/CA

Size: px
Start display at page:

Download "Exploiting Multi-User Diversity in Wireless LANs with Channel-Aware CSMA/CA"

Transcription

1 Exploiting Multi-User Diversity in Wireless LANs with Channel-Aware CSMA/CA Xiaowei Wang, Mahsa Derakhshani, Tho Le-Ngoc Department of Electrical & Computer Engineering, McGill University, Montreal, QC, Canada Department of Electrical & Computer Engineering, University of Toronto, Toronto, ON, Canada Abstract This paper presents a channel-aware access scheme for Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA aiming to take advantage of multi-user diversity and improve throughput, while supporting distributed and asynchronous operation. By dynamically adjusting the contention window of each station (STA according to its channel state, this method prioritizes STAs that gain most from using a channel, and hence, enhances channel utilization in comparison with a simple random access scheme. To model the proposed Adaptive CSMA/CA (A-CSMA/CA protocol, a three-dimensional Markov chain is developed. With the aid of such model, performance of the proposed A-CSMA/CA is analytically studied in terms of saturation throughput. Furthermore, illustrative results confirm that A-CSMA/CA significantly improves the throughput, specifically in a large network. I. INTRODUCTION The IEEE based wireless local area networks (WLANs are becoming more popular and widely deployed around the world. One of the reasons for such success is the robust medium access control (MAC protocol, employing Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA [1]. However, in comparison with contention-free scheduling MAC protocols, CSMA/CA degrades the channel utilization because of collision avoidance overhead and inevitable collisions among STAs. Since the MAC protocol mainly determines the efficiency in spectrum sharing, efforts have been exerted on optimizing IEEE MAC operation to achieve higher efficiency and throughput. An important approach to improve spectrum efficiency is to optimize backoff algorithm using instantaneous channel state information (CSI of STAs, which can take advantage of multiuser diversity (MUD. Among such works that explore MUD, there are both centralized and distributed approaches proposed in the literature. In the centralized schemes (e.g., [2], [3], AP is responsible for scheduling, and thus CSIs need to be fed back to the AP (e.g., through multicast RTS/CTS [2] by STAs. Such schemes will add overheads to the protocol and degrade the performance. To exploit MUD in a distributed manner, there are many works focused on p-persistent CSMA (e.g., [4] and non-persistent CSMA (e.g., [5] rather than CSMA/CA. These works contribute to the understanding of how to use the locally available CSI and MUD in CSMA/CA. But, since p-persistent and non-persistent CSMAs are different from CSMA/CA, it is difficult to implement the developed schemes while vendor products mostly use Distributed Coordination Function (DCF protocol employing CSMA/CA. Considering DCF protocol and CSMA/CA, there are few works aiming to achieve MUD in a distributed manner. For instance, to differentiate the STAs channel access opportunities according to their CSIs, [6] proposes a scheme in which minimum contention window and frame size are adjusted according to their data rates. But, in this scheme, additional overheads are needed for the STAs to measure channel time of other STAs. Furthermore, [7] introduces an additional waiting duration, i.e., an inter-frame gap (IFG, that is adaptive to the channel state of STAs after the random backoff of DCF. However, the additional IFG requires much modification over the original DCF protocol. Moreover, [8] includes a binary refinement process into CSMA/CA before backoff mechanism to sift out only the STAs with good channel conditions. However, to implement such additional process, major modifications are required to harmonize it with DCF. In addition, the number of STAs must be known to achieve the best system performance. Aiming to avoid major modifications over CSMA/CA-based DCF, in this work, a channel-aware CSMA/CA is presented to benefit from MUD. In the proposed adaptive CSMA/CA (A- CSMA/CA, prioritizing STAs with a good channel quality is based on adjusting the contention window independently by each STA, instead of centrally as in [2], [3]. Consequently, A-CSMA/CA can support fully distributed and asynchronous operation on STA-side. Since the contention window is adaptive to the backoff stage, the modification on the DCF protocol is minor as compared to the approaches in [6] [8]. To evaluate the performance of A-CSMA/CA and study the impacts of specific system parameters on the saturation throughput, we develop a three-dimensional Markov chain modeling A-CSMA/CA protocol. With this model, the system throughput under different configurations are analyzed and compared with simulation results. The remainder of this paper is organized as follows. Section II presents an overview of the system model. In Section III, the A-CSMA/CA scheme is introduced. Also, a three-dimensional Markov chain is developed to model the A-CSMA/CA protocol. Next, in Section IV, the saturation throughput of the proposed A-CSMA/CA is analyzed. Furthermore, Section V provides illustrative results to validate the throughput analysis and illustrate throughput improvement offered by A- CSMA/CA comparing to the conventional CSMA/CA. Finally,

2 probability 1 if t is lager than a block length. However, if t is smaller than a block length, a block transition will happen only if t n falls in the last period of duration t in a block, as shown in Figure 2. As a result, the probability of block transition from t n to t n+1 can be computed as, Fig. 1: Channel power gain distribution and range for AMC modes Fig. 2: Block fading channel model Section VI presents the concluding remarks. II. SYSTEM MODEL We consider an IEEE WLAN consists of an Access Point (AP and N stations (STAs. We assume that the network is saturated, i.e., the STAs always have data for transmission. A Physical Layer In WLANs, the modulation scheme and code-rate can be adjusted according to the channel state. An STA chooses its transmission mode based on its instantaneous signal-to-noise ratio (SNR to guarantee a certain packet-errorrate (PER. For simplicity, in this paper, we assume that the CSI is available at the STAs. Assume that M physical modes can be used at the physical layer (including the mode with extremely low SNR where no transmission is possible. For simplicity of analysis, we assign an index s (s = 0, 1,..., M 1 to each mode, where a larger s corresponds to a mode with lower SNR and data rate. To guarantee a minimum PER at each physical mode s, there is a lower bound SNR s on the received SNR at the receiver. Assuming that g [0, is the channel power gain between an STA and the AP, the SNR of this link is SNR = P g/σ 2 where P is the transmitted power and σ 2 is the noise power. Given fixed P and σ 2, SNR s corresponds to a lower bound of the channel power gain g s. For a distribution f g (g of the channel power gain g, Figure 1 shows that the channel power gain region for each mode s can be represented by [g s, g s 1 (g 1 =. For any s {0, 1,..., M 1}, the probability distribution of each region can be calculated as follows α s = P{g s g < g s 1 } = B. Block Fading Channel Model gs 1 g s f g (gd g. We assume a block fading channel model, i.e., the channel power gain remains the same during a time block of length L b and varies independently from one block to another. Given a sequence of time {t 1, t 2,..., t n,... }, the channel states {s 1, s 2,..., s n,... } form a discrete Markov chain. If time t n and t n+1 belong to different fading blocks of an STA, we say that it experienced a block transition. Given that t n+1 t n = t, the STA will experience a block transition with w(t = { t L b, if t < L b 1, otherwise Furthermore, for a time interval of t, the channel state transition probability θs,s t (i.e., the probability that the channel state changes from s to s in a time duration of t can be computed. Assuming t n+1 t n = t, then θs,s t is the conditional probability that the channel state at time t n+1 is s n+1 = s, given that the channel state at time t n is s n = s. More specifically, if s = s, θs,s t can be computed as the sum of the probability that no block transition happens from t n to t n+1 (1 w(t and the probability that a block transition happens with the channel state changing to s (w(tα s. If s s, θs,s t is simply w(tα s. In summary, { θs,s t = 1 w(t + w(tα s, if s = s w(tα s, if s (2 s (1 Based on the definition of w(t in (1, θs,s t becomes 1 + t θs,s t L = b (α s 1 if t < L b, s = s t L b α s if t < L b, s s (3 α s if t L b III. ADAPTIVE CSMA/CA AND MARKOV CHAIN MODEL In this section, we introduce the adaptive CSMA/CA design and present a three-dimentional Markov chain to mathematically model the A-CSMA/CA protocol. A. Adaptive CSMA/CA Protocol To exploit the MUD, the basic idea of A-CSMA/CA is to give transmission priority to the STAs in good channel states by controlling its contention window. More specifically, the higher is the channel power gain of a STA, the smaller contention window is chosen by that STA. The smaller contention window leads to a smaller expected backoff time, with which the STA can get access to the channel with a higher probability. The A-CSMA/CA protocol is built on DCF and preserves most of its characteristics, such as DIFS, SIFS, ACK, and the binary exponential backoff rules. A brief review of DCF can be found in [9]. The key differences of the proposed scheme compared with DCF are summarized as follows. 1 Adaptive Contention Window: In CSMA/CA, the contention window CW of an STA is a function of the backoff stage i (i.e., CW = 2 i CW min. In A-CSMA/CA, we set the contention window adaptive to both the backoff stage and the instantaneous channel state s, i.e, CW = f(i, scw min. Whenever an STA finishes a transmission, it will adjust its backoff stage i and adaptively set its contention window to be a function of i and the channel state s. More specifically, if the data frame was successfully transmitted, the STA would

3 Fig. 3: Three-dimensional Markov chain model for one STA in A-CSMA/CA set i = 0 and CW = f(i, scw min. If a collision happened, the STA would set i = min(i + 1, m (m is the maximum number of backoff stages and CW = f(i, scw min where f(i, s is considered to be a general function of i and s. For instance, f(i, s = 2 i β s, where β [1, ] is called channel backoff factor, implying that a lower channel power gain (i.e., having a larger s results in a larger contention window and thus a lower priority for transmission. 2 Fixed Transmission Duration: As proposed in IEEE e amendment, we use the concept of transmission opportunity to reduce the backoff overhead. For each transmission opportunity, the STA transmits multiple back-to-back packets for a fixed duration of time T. The data volume (including header and payload transmitted is R s T bits, where R s is the data rate for the current channel state s. B. Three-Dimensional Markov Chain Model for A-CSMA/CA To analyze the throughput of A-CSMA/CA protocol, we provide a three-dimensional Markov chain for the state transition of an STA based on the classic two-dimensional Markov chain model for DCF proposed by Bianchi in [10]. The additional dimension represents the channel state of an STA. 1 Markov Chain Model: Let define three stochastic processes for a given STA: v(t denotes its backoff stage, which takes a value from {0, 1,..., m}; b(t denotes its backoff counter, which takes a value from {0, 1,..., CW (v(t, M 1 1}; and c(t denotes its channel state, which takes a value from {0, 1,..., M 1}. The three-dimensional Markov chain {v(t, b(t, c(t} can represent the state of a STA when it is in the A-CSMA/CA process. As in [10], we assume that the conditional collision probability for each transmission (seen by a STA is constant, p, given that the number of STAs in the WLAN is fixed. According to the A-CSMA/CA protocol, the state transition of an STA can be summarized in Figure 3, where θs,s T and θt s,s are the channel transition probabilities for time durations of T (the fixed transmission duration and T (the expected time for the STA to count down from k + 1 to k, which will be calculated in the forthcoming section. 2 Transition Rules: We elaborate more on the three kinds of transitions that can happen in this Markov chain. The first kind is transition after a successful transmission. As shown by the purple lines, when an STA starts a transmission at {i 1, 0, s}, the total probability that this transmission succeeds is 1 p. After the transmission duration of T, the channel state of this STA may change from s to s with probability θs,s T. If the STA is at the channel state s once its transmission ends, according to the A-CSMA/CA protocol, it will uniformly pick a random backoff counter k from [0, CW (0, s for its next transmission. Thus, the STA moves to the state {0, k, s } with probability (1 pθt s,s CW (0,s. The second kind is transition after a collision. As shown by the blue lines, when the STA starts a transmission from state {i 1, 0, s}, the probability that this transmission fails due to collision is p. After the collision, the STA will backoff to stage min(i, m, while the channel state may change from s to s with probability θ T s,s. If the STA is at the channel state s once the collision ends, according to the A-CSMA/CA protocol, the STA will move to the state {min (i, m, k, s } with probability pθ T s,s CW (min (i,m,s, k [0, CW (min(i, m, s ]. The third kind is transitions during the count down process. As shown by the black lines, when the STA is in a state {i, k, s} where k > 0, it decrements its backoff counter after the channel is sensed idle for a time-slot. Assuming that the

4 b i,k,s = m s =0 i =0 b i,0,s (1 pθt s,s/cw (i, s i = 0, s = M 1, k = CW (i, s 1 ( m b i,0,s (1 pθt s,s /CW (i, s + b i,k+1,s θt s,s i = 0, s = M 1, k = 0 : CW (i, s 2 s =0 i =0 0 i = 0, s = 0 : M 2, k = CW (i, M 1 1 s =0 b i,k+1,s θt ( m s =0 i =0 s,s i = 0, s = 0 : M 2, k = CW (i, s : CW (i, M 1 2 b i,0,s (1 pθt s,s /CW (i, s + b i,k+1,s θt s,s i = 0, s = 0 : M 2, k = 0 : CW (i, s 1 s =0 b i 1,0,s pθt s,s/cw (i, s i = 1 : m 1, s = M 1, k = CW (i, s 1 ( s =0 b i 1,0,s pθs T,s /CW (i, s + b i,k+1,s θt s,s i = 1 : m 1, s = M 1, k = 0 : CW (i, s 2 0 i = 1 : m 1, s = 0 : M 2, k = CW (i, M 1 1 s =0 b i,k+1,s θt s,s, i = 1 : m 1, s = 0 : M 2, k = CW (i, s : CW (i, M 1 2 ( s =0 b i 1,0,s pθs T,s /CW (i, s + b i,k+1,s θt s,s i = 1 : m 1, s = 0 : M 2, k = 0 : CW (i, s 1 s =0 (b i 1,0,s + b i,0,s pθt s,s/cw (i, s i = m, s = M 1, k = CW (i, s 1 ( (b i 1,0,s + b i,0,s pθs T,s /CW (i, s + b i,k+1,s θt s,s i = m, s = M 1, k = 0 : CW (i, s 2 s =0 0 i = m, s = 0 : M 2, k = 0 : CW (i, M 1 1 ( s =0 b i,k+1,s θ T s,s i = m, s = 0 : M 2, k = CW (i, s : CW (i, M 1 2 ( (b i 1,0,s + b i,0,s pθs T,s /CW (i, s + b i,k+1,s θt s,s i = m, s = 0 : M 2, k = 0 : CW (i, s 1 s =0 expected time needed to count down from k to k 1 is T, the STA move to the state {i, k 1, s } with probability θ T s,s. IV. THROUGHPUT ANALYSIS Based on the proposed three-dimentional Markov chain in Section III-B, here we analyze the throughput of an STA that follows the A-CSMA/CA protocol. The throughput is defined as the ratio of the expected number of bits transmitted in a general time slot to the expected duration of a general time slot. The fixed probability that an STA spends in each state at the stationary point of the Markov chain is computed in Section IV-A. Based on these probabilities, the probability that an STA will start a transmission in each channel state can be computed. With these transmission probabilities, the expected amount of information transmitted in a general time slot and the duration of a general time slot is calculated in Section IV-B to get the throughput of an STA. A. Transmission Probability 1 Estimation of T : As discussed earlier, T denotes the expected time required for an STA to count down from k to k 1. Since an STA has to freeze its backoff counter once the channel is sensed busy while counting down, T is not simply equal to an idle time-slot. Following the A-CSMA/CA protocol, the channel is sensed busy if there is a successful transmission or a collision. In either case, the channel will be busy for a time duration of T. Since the STA will only count down when the channel is idle and freeze its backoff counter when the channel is busy, T can be computed as, T T b = P idlet b + (1 P idle T P idle T b (5 where T b is the duration of an idle backoff time-slot and P idle is the probability that channel sensed idle in a general timeslot by a given STA. Considering that each STA transmits in a general time-slot with probability τ, P idle = (1 τ N 1. Based on (5, T can be calculated as T = T b + ((1 τ 1 N 1T (6 2 Stationary Distribution: Let b i,k,s = lim t P {v(t = i, b(t = k, c(t = s}, {i, k, s} be the stationary distribution of the presented Markov chain. Since the STA will start a transmission in the states {i, 0, s}. The transmission probability of each STA at the channel state s is τ s = m b i,0,s, s {0, 1,..., M 1}. (7 i=0 Subsequently, the total transmission probability τ is m τ = τ s = b i,0,s (8 s=0 s=0 i=0 Thus, aiming to find τ, we need to calculate the stationary distribution of the Markov chain, i.e., b i,k,s. Since at the stationary point, the incoming probability flow and outgoing probability flow for each state has to be equal to make the distribution probability constant. Each b i,k,s can be represented by a linear equation of all other b i,k,s as in (4. Furthermore, by the normalization condition, we have, m s=0 i=0 CW (i, 1 k=0 (4 b i,k,s = 1. (9 Given the fixed conditional collision probability p and transmission probability τ, (4 and (9 create a system m of s=0 i=0 CW (i, M linear equations in m i=0 CW (i, M 1 variables (i.e., b i,k,s. By solv- s=0

5 ing this system of linear equations, we can derive b i,k,s (τ, p as functions of τ and p. The conditional collision probability p can also be expressed as a function of τ. By the definition, p is the collision probability that any transmission experiences. Thus, it is the probability that at least one of the remaining (N 1 STAs (except the transmitting STA starts a transmission. Mathematically, p = 1 (1 τ N 1. (10 Consequently, (8 and (10 represent a system of two nonlinear equations in p and τ for a fixed number of STAs in the WLAN. By solving these equations numerically, τ and p can be derived. Then, by substituting τ and p back into b i,k,s (τ, p, the stationary transmission probability in each channel state, i.e., τ s, can also be computed. B. Saturation Throughput In [10], the saturation throughput for CSMA/CA-based DCF is defined and calculated as the number of successfully delivered information bits per second. Mathematically, the throughput of an STA can be expressed as T = P s E[I] (1 P tr T b + P s T s + (P tr P s T c (11 where P s is the probability that a successful transmission occurs in a general time-slot, P tr is the probability that at least one transmission, either successful or not, happens in a general time-slot, T s and T c are the average time that the channel is sensed busy because of a successful transmission and a collision, respectively. Furthermore, E[I] is the expected amount of payload information transmitted in a successful transmission. More specifically, s=0 E[I] = T E[R] H = T R sτ s s=0 τ H (12 s where E[R] denotes the expected data rate, R s is the data rate can be offered at the channel state s, τ s is the transmission probability at the channel state s calculated in (7, and H is the size of PHY and MAC header. In the saturation throughput expression (11, the numerator represents the average amount of information bits that successfully transmitted in a general time-slot, i.e., P s E[I]. In the denominator, the average length of a general time-slot is presented. In particular, a general time-slot is either idle with probability (1 P tr, it contains a successful transmission with probability P s, or it contains a collision with probability P c = P tr P s [10]. To analyze the saturation throughput in (11, we first need to define P s and P tr. In a general slot, the probability that there is at least one transmission in the network is P tr = 1 (1 τ N. (13 A transmitted data frame will be received successfully, if exactly one STA transmits on the channel. Thus, the probability of successful transmission (i.e., P s becomes P s = Nτ(1 τ N 1 (14 Based on (11, to specifically compute the saturation throughput, it is required to specify the values of T s and T c. As in [10], Assuming that δ denotes the propagation delay, we have T s = T + δ + SIF S + ACK + δ + DIF S T c = T + δ + DIF S V. ILLUSTRATIVE RESULTS (15a (15b To evaluate the accuracy of the Markov chain model and the performance of the proposed protocol, we implement the A-CSMA/CA and CSMA/CA protocols in Matlab. The MAC layer parameters are set as follows: T b = 9µs, δ = 1µs, T = 8ms, SIFS = 10µs, DIFS = 30µs, ACK = 40µs, H = 400 bits. The channel bandwidth B = 20 MHz. We set SNR to 10 db for all STAs. Furthermore, the channel power gains g j are randomly generated according to the Rayleigh distribution assuming E g [g j ] = 1. The a physical layer is used to determine the transmission rate for each STA. Table I details the data rates and corresponding SNR ranges. Each data rate corresponds to a physical mode in the Markov chain. A. Varying Backoff Exponents In the proposed A-CSMA/CA scheme in Section III, CW (i, s is defined as a general function of i and s. Here, we aims to explore the effects of different possible backoff schemes with respect to s on the achieved throughput. Figure 4 show the saturation throughput when exponential backoff is adopted. More specifically, CW (i, s = CW min 2 i β s where β is called the channel backoff factor. Figure 4 demonstrate the throughput for β = 2, 3 and 4, in comparison with the basic CSMA/CA (i.e., β = 1. As can be observed, the larger β, the higher achieved throughput. This is simple to explain since the larger β implies stronger preference towards the STAs with good channel states. Consequently, this prioritizing can improve the overall throughput of the network. B. Varying CW min The minimum contention window CW min is a key parameter in the A-CSMA/CA protocol that significantly affects the achievable throughput. This is mainly because a larger CW min can reduce the collision probability, while a smaller CW min can reduce the collision avoidance overhead. To investigate the effects of CW min, Figures 5 illustrates the saturation throughput of the A-CSMA/CA scheme with β = 4. As shown in Figure 5, when the number of STAs in the WLAN is 1, the achievable throughput decreases as CW min increases. This is due to the fact that the larger CW min means a longer expected backoff time before each transmission, and thus, the lower achievable throughput. However, for N = 5 and N = 40, the throughput is first increasing and eventually falls down after a certain point. This happens because a larger contention window can also provide a better collision

6 SNR Range [6,9 [9,11 [11,14 [14,17 [17,20 [20,23 [23,26 [26, Data Rate (Mbps TABLE I: SNR ranges and corresponding data rates used in the illustrative results Fig. 4: Throughput vs. number of STAs for different β Fig. 5: Throughput vs. CW min for different number of STAs resolution among the STAs. Thus, to achieve the maximum throughput, it is clear that CW min needs to be designed as a function of the number of STAs in the network. For instance, the optimal value of CW min is around 4 for a network with 5 STAs, while CW min = 8 gives a better throughput performance when N = 40. C. Varying Transmission Duration T Figure 6 shows the system saturation throughput versus T for CSMA and A-CSMA. For A-CSMA/CA, we set β = 4 and CW min = 1. In addition, the coherence time L b is set to 200 ms and T is varied from 1 ms to 200 ms. It is evident that A-CSMA/CA achieves higher throughput than CSMA/CA. As T increases, the throughput of CSMA/CA first increases fast and then slows down, which is not exactly the case for A-CSMA/CA. The throughput of A-CSMA/CA first increases in T (from 0 ms to 60 ms. But, further increase in T will decrease the achievable throughput. This is because the proposed A-CSMA/CA protocol prioritizes users based on observation of the current channel state. But, if T is large relative to the value of coherence time, when the STA gets an opportunity for transmission, its current channel condition might already be different from the channel condition when the priority decision was made. That is why the throughput of A- CSMA/CA decreases as T increases after a certain threshold. This result suggests that the value of T should optimally be selected according to the channel coherence time. Fig. 6: Throughput vs. T VI. CONCLUSION This paper presents an adaptive CSMA/CA scheme to improve throughput by slightly modifying the random backoff mechanism of IEEE DCF. As a result, throughput is improved since STAs with better channel qualities are given higher priority to transmit. To evaluate the performance of the proposed A-CSMA/CA protocol, a three-dimensional Markov chain is established to model the state transition of an STA. Illustrative simulation and analytical results confirm the precision of the proposed Markov chain model and also performance gain, i.e., high throughput, offered by the proposed A-CSMA/CA-based access strategy in comparison to conventional CSMA/CA. REFERENCES [1] L. Kleinrock and F. Tobagi, Packet switching in radio channels: Part I carrier sense multiple-access modes and their throughput-delay characteristics, IEEE Trans. Commun., vol. 23, no. 12, pp , Dec [2] J. Zhang, Y. Chen, and I. Marsic, MAC scheduling using channel state diversity for high-throughput IEEE mesh networks, IEEE Commun. Mag., vol. 45, no. 11, pp , Nov [3] T. Mishima, S. Miyamoto, S. Sampei, and W. Jiang, Novel DCF-based multi-user MAC protocol and dynamic resource allocation for OFDMA WLAN systems, in Proc. IEEE Int. Conf. on Computing, Networking and Communications (ICNC, Jan. 2013, pp [4] C.-S. Hwang, K. Seong, and J. Cioffi, Opportunistic p-persistent CSMA in wireless networks, in Proc. IEEE Intl. Conf. Commun. (ICC, vol. 1, Jun. 2006, pp [5] Y. Zhang, X. Zhang, and D. Yang, Performance analysis of channelaware multichannel CSMA in wireless networks, in Proc. IEEE Veh. Tech. Conf. (VTC, May 2008, pp [6] D.-Y. Yang, T.-J. Lee, K. Jang, J.-B. Chang, and S. Choi, Performance enhancement of multirate IEEE WLANs with geographically scattered stations, IEEE Trans. Mobile Comput., vol. 5, no. 7, pp , Jul [7] D. R. Chen and Y. Zhang, Distributed MAC strategy for exploiting multi-user diversity in multi-rate IEEE wireless LANs, in Proc. IEEE Int. Conf. on Mobile Adhoc and Sensor Systems (MCSS, Oct. 2007, pp [8] M. Derakhshani and T. Le-Ngoc, Adaptive access control of CSMA/CA in wireless LANs for throughput improvement, in Proc. IEEE Global Commun. Conf. (GLOBECOM, Dec. 2013, pp [9], Cognitive MAC designs: Background, in Cognitive MAC Designs for OSA Networks. Springer International Publishing, 2014, pp [10] G. Bianchi, Performance analysis of the IEEE distributed coordination function, IEEE J. Sel. Areas Commun., vol. 18, no. 3, pp , Mar

Mohammad Hossein Manshaei 1393

Mohammad Hossein Manshaei 1393 Mohammad Hossein Manshaei manshaei@gmail.com 1393 1 An Analytical Approach: Bianchi Model 2 Real Experimentations HoE on IEEE 802.11b Analytical Models Bianchi s Model Simulations ns-2 3 N links with the

More information

An Efficient Scheduling Scheme for High Speed IEEE WLANs

An Efficient Scheduling Scheme for High Speed IEEE WLANs An Efficient Scheduling Scheme for High Speed IEEE 802.11 WLANs Juki Wirawan Tantra, Chuan Heng Foh, and Bu Sung Lee Centre of Muldia and Network Technology School of Computer Engineering Nanyang Technological

More information

Analysis of Throughput and Energy Efficiency in the IEEE Wireless Local Area Networks using Constant backoff Window Algorithm

Analysis of Throughput and Energy Efficiency in the IEEE Wireless Local Area Networks using Constant backoff Window Algorithm International Journal of Computer Applications (975 8887) Volume 6 No.8, July Analysis of Throughput and Energy Efficiency in the IEEE 8. Wireless Local Area Networks using Constant backoff Window Algorithm

More information

A Backoff Algorithm for Improving Saturation Throughput in IEEE DCF

A Backoff Algorithm for Improving Saturation Throughput in IEEE DCF A Backoff Algorithm for Improving Saturation Throughput in IEEE 80.11 DCF Kiyoshi Takahashi and Toshinori Tsuboi School of Computer Science, Tokyo University of Technology, 1404-1 Katakura, Hachioji, Tokyo,

More information

WLAN Performance Aspects

WLAN Performance Aspects Mobile Networks Module C- Part 1 WLAN Performance Aspects Mohammad Hossein Manshaei Jean-Pierre Hubaux http://mobnet.epfl.ch 1 Performance Evaluation of IEEE 802.11(DCF) Real Experimentations HoE on IEEE

More information

A Novel Contention Window Control Scheme Based on a Markov Chain Model in Dense WLAN Environment

A Novel Contention Window Control Scheme Based on a Markov Chain Model in Dense WLAN Environment 05 Third International Conference on Artificial Intelligence, Modelling and Simulation A Novel Contention Window Control Scheme Based on a Markov Chain Model in Dense WLAN Environment Yoshiaki Morino,

More information

Survey on OFDMA based MAC Protocols for the Next Generation WLAN

Survey on OFDMA based MAC Protocols for the Next Generation WLAN Survey on OFDMA based MAC Protocols for the Next Generation WLAN Bo Li, Qiao Qu, Zhongjiang Yan, and Mao Yang School of Electronics and Information Northwestern Polytechnical University, Xi an, China Email:

More information

2 Related Work. 1 Introduction. 3 Background

2 Related Work. 1 Introduction. 3 Background Modeling the Performance of A Wireless Node in Multihop Ad-Hoc Networks Ping Ding, JoAnne Holliday, Aslihan Celik {pding, jholliday, acelik}@scu.edu Santa Clara University Abstract: In this paper, we model

More information

Analysis of CSMA/CA Systems under Carrier Sensing Error: Throughput, Delay and Sensitivity

Analysis of CSMA/CA Systems under Carrier Sensing Error: Throughput, Delay and Sensitivity Analysis of CSMA/CA Systems under Carrier Sensing Error: Throughput, Delay and Sensitivity Jo oon Chong, Youngchul Sung, and Dan Keun Sung School of EECS, KAIST 373- Guseong-dong, Yuseong-gu, Daejeon 35-7,

More information

Expanding the use of CTS-to-Self mechanism to improving broadcasting on IEEE networks

Expanding the use of CTS-to-Self mechanism to improving broadcasting on IEEE networks Expanding the use of CTS-to-Self mechanism to improving broadcasting on IEEE 802.11 networks Christos Chousidis, Rajagopal Nilavalan School of Engineering and Design Brunel University London, UK {christos.chousidis,

More information

Analysis of Frequency Channel Division Strategy for CSMA/CA with RTS/CTS Mechanism

Analysis of Frequency Channel Division Strategy for CSMA/CA with RTS/CTS Mechanism Analysis of Frequency Channel Division Strategy for CSMA/CA with RTS/CTS Mechanism Baher Mawlawi, Jean-Baptiste Doré, Nikolai Lebedev, Jean-Marie Gorce To cite this version: Baher Mawlawi, Jean-Baptiste

More information

Modeling of Partially Overlapping Wireless Personal Area Networks

Modeling of Partially Overlapping Wireless Personal Area Networks Modeling of Partially Overlapping Wireless Personal Area Networks 21. ComNets-Workshop Mobil- und Telekommunikation Dipl.-Ing. Holger Rosier March 16, 2012 ComNets Research Group RWTH Aachen University,

More information

Comparison of pre-backoff and post-backoff procedures for IEEE distributed coordination function

Comparison of pre-backoff and post-backoff procedures for IEEE distributed coordination function Comparison of pre-backoff and post-backoff procedures for IEEE 802.11 distributed coordination function Ping Zhong, Xuemin Hong, Xiaofang Wu, Jianghong Shi a), and Huihuang Chen School of Information Science

More information

Numerical Analysis of IEEE Broadcast Scheme in Multihop Wireless Ad Hoc Networks

Numerical Analysis of IEEE Broadcast Scheme in Multihop Wireless Ad Hoc Networks Numerical Analysis of IEEE 802.11 Broadcast Scheme in Multihop Wireless Ad Hoc Networks Jong-Mu Choi 1, Jungmin So 2, and Young-Bae Ko 1 1 School of Information and Computer Engineering Ajou University,

More information

Collision Probability in Saturated IEEE Networks

Collision Probability in Saturated IEEE Networks in Saturated IEEE 80.11 Networks Hai L. Vu Centre for Advanced Internet Architectures (CAIA) ICT Faculty, Swinburne University of Technology Hawthorn, VIC 31, Australia h.vu@ieee.org Taka Sakurai ARC Special

More information

Characterising the Behaviour of IEEE Broadcast Transmissions in Ad Hoc Wireless LANs

Characterising the Behaviour of IEEE Broadcast Transmissions in Ad Hoc Wireless LANs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2009 Characterising the Behaviour of IEEE 802.11 Broadcast Transmissions

More information

Two-Tier WBAN/WLAN Healthcare Networks; Priority Considerations

Two-Tier WBAN/WLAN Healthcare Networks; Priority Considerations Two-Tier WBAN/WLAN Healthcare Networks; Priority Considerations Saeed Rashwand Department of Computer Science University of Manitoba Jelena Mišić Department of Computer Science Ryerson University Abstract

More information

Two-phase Collision Avoidance to Improve Scalability in Wireless LANs

Two-phase Collision Avoidance to Improve Scalability in Wireless LANs Two-phase Collision Avoidance to Improve Scalability in Wireless LANs Seongil Han, Yongsub Nam, Yongho Seok, Taekyoung Kwon and Yanghee Choi School of Computer Science and Engineering Seoul National University,

More information

The MAC layer in wireless networks

The MAC layer in wireless networks The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a /space problem Who transmits when?

More information

An Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks

An Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks An Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks First Author A.Sandeep Kumar Narasaraopeta Engineering College, Andhra Pradesh, India. Second Author Dr S.N.Tirumala Rao (Ph.d)

More information

Investigating MAC-layer Schemes to Promote Doze Mode in based WLANs

Investigating MAC-layer Schemes to Promote Doze Mode in based WLANs Investigating MAC-layer Schemes to Promote Doze Mode in 802.11-based WLANs V. Baiamonte and C.-F. Chiasserini CERCOM - Dipartimento di Elettronica Politecnico di Torino Torino, Italy Email: baiamonte,chiasserini

More information

Wireless Networking & Mobile Computing

Wireless Networking & Mobile Computing Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Lec #4: Medium Access Control - II Tamer Nadeem Dept. of Computer Science IEEE 802.11 Standards Page 2 Spring 2012 CS 752/852 - Wireless

More information

Outline. Wireless Channel Characteristics. Multi-path Fading. Opportunistic Communication - with a focus on WLAN environments -

Outline. Wireless Channel Characteristics. Multi-path Fading. Opportunistic Communication - with a focus on WLAN environments - Outline Opportunistic Communication - with a focus on WLAN environments - Jong-won Lee 2006. 02.20. Background? Wireless Channels? Opportunistic communication? Examples? Basics of WLAN Previous Works?

More information

Fu-Yi Hung ALL RIGHTS RESERVED

Fu-Yi Hung ALL RIGHTS RESERVED 009 Fu-Yi Hung ALL RIGHTS RESERVED PERFORMANCE ANALYSIS OF THE IEEE 80.-BASED WIRELESS NETWORKS IN THE PRESENCE OF HIDDEN STATIONS by FU-YI HUNG A Dissertation submitted to the Graduate School-New Brunswick

More information

A Comparative Analysis on Backoff Algorithms to Optimize Mobile Network

A Comparative Analysis on Backoff Algorithms to Optimize Mobile Network Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.771

More information

Payload Length and Rate Adaptation for Throughput Optimization in Wireless LANs

Payload Length and Rate Adaptation for Throughput Optimization in Wireless LANs Payload Length and Rate Adaptation for Throughput Optimization in Wireless LANs Sayantan Choudhury and Jerry D. Gibson Department of Electrical and Computer Engineering University of Califonia, Santa Barbara

More information

Multichannel Outage-aware MAC Protocols for Wireless Networks

Multichannel Outage-aware MAC Protocols for Wireless Networks Submitted - the 4th IEEE Conference on Industrial Electronics and Applications (ICIEA 29) Multichannel Outage-aware MAC Protocols for Wireless Networks Hyukjin Lee and Cheng-Chew Lim School of Electrical

More information

Performance analysis of Internet applications over an adaptive IEEE MAC architecture

Performance analysis of Internet applications over an adaptive IEEE MAC architecture Journal of the Franklin Institute 343 (2006) 352 360 www.elsevier.com/locate/jfranklin Performance analysis of Internet applications over an adaptive IEEE 802.11 MAC architecture Uthman Baroudi, Mohammed

More information

P B 1-P B ARRIVE ATTEMPT RETRY 2 1-(1-P RF ) 2 1-(1-P RF ) 3 1-(1-P RF ) 4. Figure 1: The state transition diagram for FBR.

P B 1-P B ARRIVE ATTEMPT RETRY 2 1-(1-P RF ) 2 1-(1-P RF ) 3 1-(1-P RF ) 4. Figure 1: The state transition diagram for FBR. 1 Analytical Model In this section, we will propose an analytical model to investigate the MAC delay of FBR. For simplicity, a frame length is normalized as a time unit (slot). 1.1 State Transition of

More information

AGOOD medium access control (MAC) protocol for wireless

AGOOD medium access control (MAC) protocol for wireless IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 3, MAY 2004 793 Design of MAC Protocols With Fast Collision Resolution for Wireless Local Area Networks Younggoo Kwon, Yuguang Fang, Senior Member,

More information

AN ANALYSIS OF THE MODIFIED BACKOFF MECHANISM FOR IEEE NETWORKS

AN ANALYSIS OF THE MODIFIED BACKOFF MECHANISM FOR IEEE NETWORKS AN ANALYSIS OF THE MODIFIED BACKOFF MECHANISM FOR IEEE 802.11 NETWORKS Marek Natkaniec, Andrzej R. Pach Department of Telecommunications University of Mining and Metallurgy al. Mickiewicza 30, 30-059 Cracow

More information

Analytical Model for an IEEE WLAN using DCF with Two Types of VoIP Calls

Analytical Model for an IEEE WLAN using DCF with Two Types of VoIP Calls Analytical Model for an IEEE 802.11 WLAN using DCF with Two Types of VoIP Calls Sri Harsha Anurag Kumar Vinod Sharma Department of Electrical Communication Engineering Indian Institute of Science Bangalore

More information

Providing Throughput Guarantees in IEEE e Wireless LANs

Providing Throughput Guarantees in IEEE e Wireless LANs Providing Throughput Guarantees in IEEE 802.11e Wireless LANs Albert Banchs a, Xavier Pérez-Costa a, Daji Qiao b a Network Laboratories, NEC Europe Ltd., Heidelberg, Germany b Real-Time Computing Laboratory,

More information

Throughput and Energy Consumption Analysis of IEEE Slotted CSMA/CA. T.R. Park, T.H. Kim, J.Y. Choi, S. Choi, and W.H.

Throughput and Energy Consumption Analysis of IEEE Slotted CSMA/CA. T.R. Park, T.H. Kim, J.Y. Choi, S. Choi, and W.H. Throughput and Energy Consumption Analysis of IEEE 802.15.4 Slotted CSMA/CA T.R. Park, T.H. Kim, J.Y. Choi, S. Choi, and W.H. Kwon We propose a new analytic model of the IEEE 802.15.4 slotted CSMA/CA from

More information

The MAC layer in wireless networks

The MAC layer in wireless networks The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a time/space problem Who transmits when?

More information

Impact of IEEE MAC Packet Size on Performance of Wireless Sensor Networks

Impact of IEEE MAC Packet Size on Performance of Wireless Sensor Networks IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 3, Ver. IV (May - Jun.2015), PP 06-11 www.iosrjournals.org Impact of IEEE 802.11

More information

Analysis of Broadcast Non-Saturation Throughput as a Performance Measure in VANETs

Analysis of Broadcast Non-Saturation Throughput as a Performance Measure in VANETs Analysis of Broadcast Non-Saturation Throughput as a Performance Measure in VANETs Gayathri Narayanan Department of Electronics and Communication Engineering Amrita School of Engineering, Amritapuri Campus,

More information

standard. Acknowledgement: Slides borrowed from Richard Y. Yale

standard. Acknowledgement: Slides borrowed from Richard Y. Yale 802.11 standard Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale IEEE 802.11 Requirements Design for small coverage (e.g. office, home) Low/no mobility High data rate applications Ability to

More information

Saturation Throughput of IEEE e EDCA Based on Mean Value Analysis

Saturation Throughput of IEEE e EDCA Based on Mean Value Analysis Saturation Throughput of IEEE 80.11e EDCA Based on Mean Value Analysis Yuxia Lin and Vincent W.S. Wong Department of Electrical and Computer Engineering The University of British Columbia 33 Main Mall,

More information

Performance Study on a CSMA/CA-Based MAC Protocol for Multi-User MIMO Wireless LANs

Performance Study on a CSMA/CA-Based MAC Protocol for Multi-User MIMO Wireless LANs IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, ACCEPTED FOR PUBLICATION Performance Study on a CSMA/CA-Based MAC Protocol for Multi-User MIMO Wireless LANs Shanshan Wu, Student Member, IEEE, Wenguang Mao,

More information

Evaluation of the backoff procedure of Homeplug MAC vs. DCF

Evaluation of the backoff procedure of Homeplug MAC vs. DCF Evaluation of the backoff procedure of Homeplug MAC vs. DCF Cristina Cano and David Malone Hamilton Institute National University of Ireland, Maynooth Co. Kildare, Ireland Email: {cristina.cano,david.malone}@nuim.ie

More information

June 20th, École Polytechnique, Paris, France. A mean-field model for WLANs. Florent Cadoux. IEEE single-cell WLANs

June 20th, École Polytechnique, Paris, France. A mean-field model for WLANs. Florent Cadoux. IEEE single-cell WLANs Initial Markov under Bianchi s École Polytechnique, Paris, France June 20th, 2005 Outline Initial Markov under Bianchi s 1 2 Initial Markov under Bianchi s 3 Outline Initial Markov under Bianchi s 1 2

More information

Analytical Modeling of TCP Clients in Wi-Fi Hot Spot Networks

Analytical Modeling of TCP Clients in Wi-Fi Hot Spot Networks Analytical Modeling of TCP Clients in Wi-Fi Hot Spot Networks Raffaele Bruno, Marco Conti, and Enrico Gregori Italian National Research Council (CNR) IIT Institute Via G. Moruzzi, 1-56100 Pisa, Italy {firstname.lastname}@iit.cnr.it

More information

Supporting Deadline Monotonic Policy over Average Service Time Analysis

Supporting Deadline Monotonic Policy over Average Service Time Analysis Supporting Deadline Monotonic Policy over 802. Average Service Time Analysis Inès El Korbi Ecole Nationale des Sciences de l Informatique Laboratoire Cristal Université de la Manouba, 200 Tunisia ines.korbi@gmail.com

More information

The IEEE Distributed Coordination Function in Small-Scale Ad-Hoc Wireless LANs

The IEEE Distributed Coordination Function in Small-Scale Ad-Hoc Wireless LANs International Journal of Wireless Information Networks, Vol. 10, No. 1, January 2003 ( 2003) The IEEE 802.11 Distributed Coordination Function in Small-Scale Ad-Hoc Wireless LANs Eustathia Ziouva and Theodore

More information

Saturated Throughput Analysis of IEEE e Using Two-Dimensional Markov Chain Model

Saturated Throughput Analysis of IEEE e Using Two-Dimensional Markov Chain Model Saturated Throughput Analysis of IEEE 80.e Using Two-Dimensional Markov Chain Model Lixiang Xiong and Guoqiang Mao School of Electrical and Information Engineering The University of Sydney NSW 006 Australia

More information

CSMA/CA Bottleneck Remediation in Saturation Mode with New Backoff Strategy

CSMA/CA Bottleneck Remediation in Saturation Mode with New Backoff Strategy CSMA/CA Bottleneck Remediation in Saturation Mode with New Backoff Strategy Baher Mawlawi, Jean-Baptiste Doré To cite this version: Baher Mawlawi, Jean-Baptiste Doré. CSMA/CA Bottleneck Remediation in

More information

Priority Collision Resolution - Distributed Coordination Function for Distributed Wireless Networks

Priority Collision Resolution - Distributed Coordination Function for Distributed Wireless Networks Priority Collision Resolution - Distributed Coordination Function for Distributed Wireless etworks Xiaohui Ye *, Xin Liu #, S. J. Ben Yoo *, and Zhi Ding * * Department of Electrical and Computer Engineering,

More information

Cooperative Communication Protocol based on Relay Node Grouping in Wireless Networks

Cooperative Communication Protocol based on Relay Node Grouping in Wireless Networks Cooperative Communication Protocol based on Relay Node Grouping in Wireless Networks Sunmyeng Kim Department of Computer Software Engineering, Kumoh National Institute of Technology 1 Daehak-ro, Gumi,

More information

IEEE Medium Access Control. Medium Access Control

IEEE Medium Access Control. Medium Access Control IEEE 802.11 Medium Access Control EECS3214 3 April 2018 Medium Access Control reliable data delivery access control MAC layer covers three functional areas: security 2 1 MAC Requirements To avoid interference

More information

Lecture 16: QoS and "

Lecture 16: QoS and Lecture 16: QoS and 802.11" CSE 123: Computer Networks Alex C. Snoeren HW 4 due now! Lecture 16 Overview" Network-wide QoS IntServ DifServ 802.11 Wireless CSMA/CA Hidden Terminals RTS/CTS CSE 123 Lecture

More information

Local Area Networks NETW 901

Local Area Networks NETW 901 Local Area Networks NETW 901 Lecture 4 Wireless LAN Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Contents What is a Wireless LAN? Applications and Requirements Transmission

More information

Department of Electrical and Computer Systems Engineering

Department of Electrical and Computer Systems Engineering Department of Electrical and Computer Systems Engineering Technical Report MECSE-6-2006 Medium Access Control (MAC) Schemes for Quality of Service (QoS) provision of Voice over Internet Protocol (VoIP)

More information

Saturated Throughput Analysis of IEEE e EDCA

Saturated Throughput Analysis of IEEE e EDCA Saturated Throughput Analysis of IEEE 80.e EDCA Lixiang Xiong, Guoqiang Mao School of Electrical and Information Engineering The University of Sydney, Sydney, NW 006, Australia Abstract IEEE 80.e standard

More information

Impact of IEEE n Operation on IEEE Operation

Impact of IEEE n Operation on IEEE Operation 2009 International Conference on Advanced Information Networking and Applications Workshops Impact of IEEE 802.11n Operation on IEEE 802.15.4 Operation B Polepalli, W Xie, D Thangaraja, M Goyal, H Hosseini

More information

Research Article The Performance Evaluation of an IEEE Network Containing Misbehavior Nodes under Different Backoff Algorithms

Research Article The Performance Evaluation of an IEEE Network Containing Misbehavior Nodes under Different Backoff Algorithms Hindawi Security and Communication Networks Volume 7, Article ID 45978, 8 pages https://doi.org/.55/7/45978 Research Article The Performance Evaluation of an IEEE 8. Network Containing Misbehavior Nodes

More information

A Medium Access Control Protocol with Retransmission using NACK and Directional Antennas for Broadcasting in Wireless Ad-Hoc Networks

A Medium Access Control Protocol with Retransmission using NACK and Directional Antennas for Broadcasting in Wireless Ad-Hoc Networks A Medium Access Control Protocol with Retransmission using NACK and Directional Antennas for Broadcasting in Wireless Ad-Hoc Networks Yoriko Utsunomiya, Michito Takahashi, Masaki Bandai, and Iwao Sasase

More information

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 14, NO. 10, OCTOBER Aimin Tang and Xudong Wang, Senior Member, IEEE

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 14, NO. 10, OCTOBER Aimin Tang and Xudong Wang, Senior Member, IEEE IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 14, NO. 10, OCTOBER 2015 5871 A-Duplex: Medium Access Control for Efficient Coexistence Between Full-Duplex and Half-Duplex Communications Aimin Tang

More information

Adaptive Packetization for Error-Prone Transmission over WLANs with Hidden Terminals

Adaptive Packetization for Error-Prone Transmission over WLANs with Hidden Terminals Adaptive Packetization for Error-Prone Transmission over 8.11 WLANs with Hidden Terminals Wei Song, Michael N. Krishnan, and Avideh Zakhor Video and Image Processing (VIP) Lab Department of Electrical

More information

CSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology

CSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology CSC344 Wireless and Mobile Computing Department of Computer Science COMSATS Institute of Information Technology Wireless Local Area Networks (WLANs) Part I Almost all wireless LANs now are IEEE 802.11

More information

COLLISION-AWARE ADAPTION OF CONTENTION WINDOW IN E WIRELESS LAN

COLLISION-AWARE ADAPTION OF CONTENTION WINDOW IN E WIRELESS LAN COLLISION-AWARE ADAPTION OF CONTENTION WINDOW IN 802.11E WIRELESS LAN Shih-Wei Pan, Jung-Shyr Wu and Ming-Wei You Department of Communication Engineering, National Central University, JhungLi City, Taiwan

More information

THE wireless local area network (WLAN) is emerging as. A Multichain Backoff Mechanism for IEEE WLANs Shiang-Rung Ye and Yu-Chee Tseng

THE wireless local area network (WLAN) is emerging as. A Multichain Backoff Mechanism for IEEE WLANs Shiang-Rung Ye and Yu-Chee Tseng IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 5, SEPTEMBER 2006 1613 A Multichain Backoff Mechanism for IEEE 802.11 WLANs Shiang-Rung Ye and Yu-Chee Tseng Abstract The distributed coordination

More information

Performance anomaly of b

Performance anomaly of b Laboratoire LSR Logiciels Systèmes Réseaux Software, Systems, Networks Performance anomaly of 802.11b Andrzej Duda LSR-IMAG Andrzej.Duda@imag.fr Joint work with Martin Heusse, Franck Rousseau, Gilles Berger-Sabbatel

More information

04/11/2011. Wireless LANs. CSE 3213 Fall November Overview

04/11/2011. Wireless LANs. CSE 3213 Fall November Overview Wireless LANs CSE 3213 Fall 2011 4 November 2011 Overview 2 1 Infrastructure Wireless LAN 3 Applications of Wireless LANs Key application areas: LAN extension cross-building interconnect nomadic access

More information

Research Article Performance Analysis of IEEE DCF under Nonsaturation Condition

Research Article Performance Analysis of IEEE DCF under Nonsaturation Condition Mathematical Problems in Engineering Volume 2008, Article ID 574197, 17 pages doi:10.1155/2008/574197 Research Article Performance Analysis of IEEE 802.11 DCF under Nonsaturation Condition Yutae Lee, 1

More information

CSCD 433 Network Programming Fall Lecture 7 Ethernet and Wireless

CSCD 433 Network Programming Fall Lecture 7 Ethernet and Wireless CSCD 433 Network Programming Fall 2016 Lecture 7 Ethernet and Wireless 802.11 1 Topics 802 Standard MAC and LLC Sublayers Review of MAC in Ethernet MAC in 802.11 Wireless 2 IEEE Standards In 1985, Computer

More information

MC-CDMA Based IEEE Wireless LAN

MC-CDMA Based IEEE Wireless LAN MC-CDMA Based IEEE 802.11 Wireless LAN Georgios Orfanos Jörg Habetha Ling Liu Aachen Univ. of Technology D-52074 Aachen, Germany Philips Research Laboratories, D-52066 Aachen, Germany Aachen Univ. of Technology

More information

PROPOSAL OF MULTI-HOP WIRELESS LAN SYSTEM FOR QOS GUARANTEED TRANSMISSION

PROPOSAL OF MULTI-HOP WIRELESS LAN SYSTEM FOR QOS GUARANTEED TRANSMISSION PROPOSAL OF MULTI-HOP WIRELESS LAN SYSTEM FOR QOS GUARANTEED TRANSMISSION Phuc Khanh KIEU, Shinichi MIYAMOTO Graduate School of Engineering, Osaka University 2-1 Yamada-oka, Suita, Osaka, 565-871 JAPAN

More information

Hands-On Exercises: IEEE Standard

Hands-On Exercises: IEEE Standard Hands-On Exercises: IEEE 802.11 Standard Mohammad Hossein Manshaei and Jean-Pierre Hubaux {hossein.manshaei,jean-pierre.hubaux}@epfl.ch Laboratory for Computer Communications and Applications (LCA) March

More information

Mohamed Khedr.

Mohamed Khedr. Mohamed Khedr http://webmail.aast.edu/~khedr Tentatively Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Week 7 Week 8 Week 9 Week 10 Week 11 Week 12 Week 13 Week 14 Week 15 Overview Packet Switching IP addressing

More information

Duck-Yong Yang, Tae-Jin Lee, Member, IEEE, Kyunghun Jang, Jin-Bong Chang and Sunghyun Choi, Member, IEEE. Abstract

Duck-Yong Yang, Tae-Jin Lee, Member, IEEE, Kyunghun Jang, Jin-Bong Chang and Sunghyun Choi, Member, IEEE. Abstract Performance Enhancement of Multi-Rate IEEE 802. WLANs with Geographically-Scattered Stations Duck-Yong Yang, Tae-Jin Lee, Member, IEEE, Kyunghun Jang, Jin-Bong Chang and Sunghyun Choi, Member, IEEE Abstract

More information

4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802.

4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802. 4.3 IEEE 802.11 Physical Layer 4.3.1 IEEE 802.11 4.3.2 IEEE 802.11b 4.3.3 IEEE 802.11a 4.3.4 IEEE 802.11g 4.3.5 IEEE 802.11n 4.3.6 IEEE 802.11ac,ad Andreas Könsgen Summer Term 2012 4.3.3 IEEE 802.11a Data

More information

CS 348: Computer Networks. - WiFi (contd.); 16 th Aug Instructor: Sridhar Iyer IIT Bombay

CS 348: Computer Networks. - WiFi (contd.); 16 th Aug Instructor: Sridhar Iyer IIT Bombay CS 348: Computer Networks - WiFi (contd.); 16 th Aug 2012 Instructor: Sridhar Iyer IIT Bombay Clicker-1: Wireless v/s wired Which of the following differences between Wireless and Wired affect a CSMA-based

More information

Chapter 4. The Medium Access Control Sublayer. Points and Questions to Consider. Multiple Access Protocols. The Channel Allocation Problem.

Chapter 4. The Medium Access Control Sublayer. Points and Questions to Consider. Multiple Access Protocols. The Channel Allocation Problem. Dynamic Channel Allocation in LANs and MANs Chapter 4 The Medium Access Control Sublayer 1. Station Model. 2. Single Channel Assumption. 3. Collision Assumption. 4. (a) Continuous Time. (b) Slotted Time.

More information

6.9 Summary. 11/20/2013 Wireless and Mobile Networks (SSL) 6-1. Characteristics of selected wireless link standards a, g point-to-point

6.9 Summary. 11/20/2013 Wireless and Mobile Networks (SSL) 6-1. Characteristics of selected wireless link standards a, g point-to-point Chapter 6 outline 6.1 Introduction Wireless 6.2 Wireless links, characteristics CDMA 6.3 IEEE 802.11 wireless LANs ( wi-fi ) 6.4 Cellular Internet Access architecture standards (e.g., GSM) Mobility 6.5

More information

Medium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols

Medium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols Medium Access Control MAC protocols: design goals, challenges, contention-based and contention-free protocols 1 Why do we need MAC protocols? Wireless medium is shared Many nodes may need to access the

More information

An Accurate Model for Energy Efficiency in IEEE WLANs

An Accurate Model for Energy Efficiency in IEEE WLANs An Accurate Model for Energy Efficiency in IEEE 802.11 WLANs Eleni-Constantina Davri, Emmanouil Kafetzakis, Kimon Kontovasilis, Charalabos Skianis National Centre for Scientific Research Demokritos, Athens,

More information

Wireless & Mobile Networking

Wireless & Mobile Networking Wireless & Mobile Networking CS 752/852 - Spring 2011 Lec #3: Medium Access Control - I Tamer Nadeem Dept. of Computer Science Data Link Layer (DLL) Main Task of the data link layer: Provide error-free

More information

A Novel Framework for Radio Resource Management in IEEE Wireless LANs

A Novel Framework for Radio Resource Management in IEEE Wireless LANs Dublin Institute of Technology ARROW@DIT Conference papers Communications Network Research Institute 2005-01-01 A Novel Framework for Radio Resource Management in IEEE 802.11 Wireless LANs Mark Davis Dublin

More information

Characterising the interactions between unicast and broadcast in IEEE ad hoc networks

Characterising the interactions between unicast and broadcast in IEEE ad hoc networks University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2008 Characterising the interactions between unicast and broadcast in

More information

Wireless MACs: MACAW/802.11

Wireless MACs: MACAW/802.11 Wireless MACs: MACAW/802.11 Mark Handley UCL Computer Science CS 3035/GZ01 Fundamentals: Spectrum and Capacity A particular radio transmits over some range of frequencies; its bandwidth, in the physical

More information

A Framework for Femtocells to Access Both Licensed and Unlicensed Bands

A Framework for Femtocells to Access Both Licensed and Unlicensed Bands Indoor and Outdoor Femto Cells A Framework for Femtocells to Access Both Licensed and Unlicensed Bands Feilu Liu, Erdem Bala, Elza Erkip and Rui Yang ECE Department, Polytechnic Institute of NYU, Brooklyn,

More information

Lesson 2-3: The IEEE x MAC Layer

Lesson 2-3: The IEEE x MAC Layer Module 2: Establishing Wireless Connectivity Lesson 2-3: The IEEE 802.11x MAC Layer Lesson Overview This lesson describes basic IEEE 802.11x MAC operation, beginning with an explanation of contention schemes

More information

Prioritization scheme for QoS in IEEE e WLAN

Prioritization scheme for QoS in IEEE e WLAN Prioritization scheme for QoS in IEEE 802.11e WLAN Yakubu Suleiman Baguda a, Norsheila Fisal b a,b Department of Telematics & Communication Engineering, Faculty of Electrical Engineering Universiti Teknologi

More information

The Impact of Transmission Overheads on IEEE Throughput: Analysis and Simulation

The Impact of Transmission Overheads on IEEE Throughput: Analysis and Simulation Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (JSAT), March Edition, 2011 The Impact of Transmission Overheads on IEEE 802.11 Throughput:

More information

A MAC Protocol based on Dynamic Time Adjusting in Wireless MIMO Networks

A MAC Protocol based on Dynamic Time Adjusting in Wireless MIMO Networks 212 7th International ICST Conference on Communications and Networking in China (CHINACOM) A MAC Protocol based on Dynamic Time Adjusting in Wireless MIMO Networks Yang Qin*, Xiaoxiong Zhong, Li Li, Zhenhua

More information

Unit 7 Media Access Control (MAC)

Unit 7 Media Access Control (MAC) Unit 7 Media Access Control (MAC) 1 Internet Model 2 Sublayers of Data Link Layer Logical link control (LLC) Flow control Error control Media access control (MAC) access control 3 Categorization of MAC

More information

Design and Analysis of an Adaptive Backoff Algorithm for IEEE DCF mechanism

Design and Analysis of an Adaptive Backoff Algorithm for IEEE DCF mechanism Design and Analysis of an Adaptive Backoff Algorithm for IEEE 802.11 DCF mechanism Mouhamad Ibrahim and Sara Alouf INRIA B.P. 93 06902 Sophia Antipolis France {mibrahim,salouf}@sophia.inria.fr Abstract.

More information

A Frame Aggregation Scheduler for IEEE n

A Frame Aggregation Scheduler for IEEE n A Frame Aggregation Scheduler for IEEE 802.11n Selvam T AU-KBC Research Centre MIT campus of Anna University Chennai, India selvam@au-kbc.org Srikanth S AU-KBC Research Centre MIT Campus of Anna University

More information

Enhancing the DCF mechanism in noisy environment

Enhancing the DCF mechanism in noisy environment Enhancing the DCF mechanism in noisy environment 1 LICP EA 2175 Université de Cergy-Pontoise 3 Av Adolph Chauvin 9532 Cergy-Pontoise France Email: {adlen.ksentini, mohamed.naimi}@dept-info.u-cergy.fr Adlen

More information

EVALUATION OF EDCF MECHANISM FOR QoS IN IEEE WIRELESS NETWORKS

EVALUATION OF EDCF MECHANISM FOR QoS IN IEEE WIRELESS NETWORKS MERL A MITSUBISHI ELECTRIC RESEARCH LABORATORY http://www.merl.com EVALUATION OF EDCF MECHANISM FOR QoS IN IEEE802.11 WIRELESS NETWORKS Daqing Gu and Jinyun Zhang TR-2003-51 May 2003 Abstract In this paper,

More information

Modeling and Analysis of MAC Protocol for LTE-U Co-existing with Wi-Fi

Modeling and Analysis of MAC Protocol for LTE-U Co-existing with Wi-Fi Modeling and Analysis of MAC Protocol for LTE-U Co-existing with Wi-Fi Ran Zhang Miao Wang Lin X. Cai Xuemin (Sherman) Shen Liang-Liang Xie Yu Cheng Abstract In this paper a new MAC protocol for LTE over

More information

Wireless Communication

Wireless Communication Wireless Communication Systems @CS.NCTU Lecture 9: MAC Protocols for WLANs Instructor: Kate Ching-Ju Lin ( 林靖茹 ) 1 Reference 1. A Technical Tutorial on the IEEE 802.11 Protocol By Pablo Brenner online:

More information

H-MMAC: A Hybrid Multi-channel MAC Protocol for Wireless Ad hoc Networks

H-MMAC: A Hybrid Multi-channel MAC Protocol for Wireless Ad hoc Networks H-: A Hybrid Multi-channel MAC Protocol for Wireless Ad hoc Networks Duc Ngoc Minh Dang Department of Computer Engineering Kyung Hee University, Korea Email: dnmduc@khu.ac.kr Choong Seon Hong Department

More information

Improving the Multiple Access Method of CSMA/CA Home Networks

Improving the Multiple Access Method of CSMA/CA Home Networks Improving the Multiple Access Method of CSMA/CA Home Networks Miguel Elias M. Campista, Luís Henrique M. K. Costa, and Otto Carlos M. B. Duarte Universidade Federal do Rio de Janeiro - PEE-COPPE/DEL-POLI

More information

CHAPTER 7 MAC LAYER PROTOCOLS. Dr. Bhargavi Goswami Associate Professor & Head Department of Computer Science Garden City College

CHAPTER 7 MAC LAYER PROTOCOLS. Dr. Bhargavi Goswami Associate Professor & Head Department of Computer Science Garden City College CHAPTER 7 MAC LAYER PROTOCOLS Dr. Bhargavi Goswami Associate Professor & Head Department of Computer Science Garden City College MEDIUM ACCESS CONTROL - MAC PROTOCOLS When the two stations transmit data

More information

Analysis of the IEEE e EDCA Under Statistical Traffic

Analysis of the IEEE e EDCA Under Statistical Traffic Analysis of the IEEE 82.11e EDCA Under tatistical Traffic Juki Wirawan Tantra, Chuan Heng Foh Centre for Multimedia and Network Technology chool of Computer Engineering Nanyang Technological University

More information

Chapter 12 Multiple Access 12.1

Chapter 12 Multiple Access 12.1 Chapter 12 Multiple Access 12.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 12.2 Figure 12.1 Data link layer divided into two functionality-oriented sublayers

More information

An Improved IEEE CSMA/CA Medium Access Mechanism Through the Introduction of Random Short Delays

An Improved IEEE CSMA/CA Medium Access Mechanism Through the Introduction of Random Short Delays An Improved IEEE 802.11 CSMA/CA Medium Access Mechanism Through the Introduction of Random Short Delays Nirmala Shenoy, John Hamilton, Andres Kwasinski and Kaiqi Xiong Rochester Institute of Technology,

More information

Performance Anomaly of b

Performance Anomaly of b Performance Anomaly of 8.11b Martin Heusse, Franck Rousseau, Gilles Berger-Sabbatel, Andrzej Duda LSR-IMAG Laboratory Grenoble, France email: {heusse, rousseau, gberger, duda}@imag.fr Abstract We analyze

More information