Spectrum Utilization and Congestion of IEEE 802.11 Networks in the 2.4 GHz ISM Band

Wi-Fi technology, plays a major role in society thanks to its widespread availability, ease of use and low cost. To assure its long term viability in terms of capacity and ability to share the spectrum efficiently, it is of paramount to study the spectrum utilization and congestion mechanisms in live environments. In this paper the service level in the 2.4 GHz ISM band is investigated with focus on todays IEEE 802.11 WLAN systems with support for the 802.11e extension. Here service level means the overall Quality of Service (QoS), i.e. can all devices fulfill their communication needs? A crosslayer approach is used, since the service level can be measured at several levels of the protocol stack. The focus is on monitoring at both the Physical (PHY) and the Medium Access Control (MAC) link layer simultaneously by performing respectively power measurements with a spectrum analyzer to assess spectrum utilization and packet sniffing to measure the congestion. Compared to traditional QoS analysis in 802.11 networks, packet sniffing allows to study the occurring congestion mechanisms more thoroughly. The monitoring is applied for the following two cases. First the influence of interference between WLAN networks sharing the same radio channel is investigated in a controlled environment. It turns out that retry rate, Clear-ToSend (CTS), Request-To-Send (RTS) and (Block) Acknowledgment (ACK) frames can be used to identify congestion, whereas the spectrum analyzer is employed to identify the source of interference. Secondly, live measurements are performed at three locations to identify this type of interference in real-live situations. Results show inefficient use of the wireless medium in certain scenarios, due to a large portion of management and control frames compared to data content frames (i.e. only 21% of the frames is identified as data frames)

Performance modelling of fairness in IEEE 802.11 wireless LAN protocols

PhD ThesisWireless communication has become a key technology in the modern world, allowing network services to be delivered in almost any environment, without the need for potentially expensive and invasive fixed cable solutions. However, the level of performance experienced by wireless devices varies tremendously on location and time. Understanding the factors which can cause variability of service is therefore of clear practical and theoretical interest. In this thesis we explore the performance of the IEEE 802.11 family of wireless protocols, which have become the de facto standard for Wireless Local Area Networks (WLANs). The specific performance issue which is investigated is the unfairness which can arise due to the spatial position of nodes in the network. In this work we characterise unfairness in terms of the difference in performance (e.g. throughput) experienced by different pairs of communicating nodes within a network. Models are presented using the Markovian process algebra PEPA which depict different scenarios with three of the main protocols, IEEE 802.11b, IEEE 802.11g and IEEE 802.11n. The analysis shows that performance is affected by the presence of other nodes (including in the well-known hidden node case), by the speed of data and the size of the frames being transmitted. The collection of models and analysis in this thesis collectively provides not only an insight into fairness in IEEE 802.11 networks, but it also represents a significant use case in modelling network protocols using PEPA. PEPA and other stochastic process algebra are extremely powerful tools for efficiently specifying models which might be very complex to study using conventional simulation approaches. Furthermore the tool support for PEPA facilitates the rapid solution of models to derive key metrics which enable the modeller to gain an understanding of the network behaviour across a wide range of operating conditions. From the results we can see that short frames promote a greater fairness due to the more frequent spaces between frames allowing other senders to transmit. An interesting consequence of these findings is the observation that varying frame length can play a role in addressing topological unfairness, which leads to the analysis of a novel model of IEEE 802.11g with variable frame lengths. While varying frame lengths might not always be practically possible, as frames need to be long enough for collisions to be detected, IEEE 802.11n supports a number of mechanisms for frame aggregation, where successive frames may be sent in series with little or no delay between them. We therefore present a novel model of IEEE 802.11n with frame aggregation to explore how this approach affects fairness and, potentially, can be used to address unfairness by allowing affected nodes to transmit longer frame bursts.Kurdistan Region Government of Iraq (KRG) sponso

Performance modelling and enhancement of wireless communication protocols

In recent years, Wireless Local Area Networks(WLANs) play a key role in the data communications and networking areas, having witnessed significant research and development. WLANs are extremely popular being almost everywhere including business,office and home deployments.In order to deal with the modem Wireless connectivity needs,the Institute of Electrical and Electronics Engineers(IEEE) has developed the 802.11 standard family utilizing mainly radio transmission techniques, whereas the Infrared Data Association (IrDA) addressed the requirement for multipoint connectivity with the development of the Advanced Infrared(Alr) protocol stack. This work studies the collision avoidance procedures of the IEEE 802.11 Distributed Coordination Function (DCF) protocol and suggests certain protocol enhancements aiming at maximising performance. A new, elegant and accurate analysis based on Markov chain modelling is developed for the idealistic assumption of unlimited packet retransmissions as well as for the case of finite packet retry limits. Simple equations are derived for the through put efficiency, the average packet delay, the probability of a packet being discarded when it reaches the maximum retransmission limit, the average time to drop such a packet and the packet inter-arrival time for both basic access and RTS/CTS medium access schemes.The accuracy of the mathematical model is validated by comparing analytical with OPNET simulation results. An extensive and detailed study is carried out on the influence of performance of physical layer, data rate, packet payload size and several backoff parameters for both medium access mechanisms. The previous mathematical model is extended to take into account transmission errors that can occur either independently with fixed Bit Error Rate(BER) or in bursts. The dependency of the protocol performance on BER and other factors related to independent and burst transmission errors is explored. Furthermore, a simple-implement appropriate tuning of the back off algorithm for maximizing IEEE 802-11 protocol performance is proposed depending on the specific communication requirements. The effectiveness of the RTS/CTS scheme in reducing collision duration at high data rates is studied and an all-purpose expression for the optimal use of the RTS/CTS reservation scheme is derived. Moreover, an easy-to-implement backoff algorithm that significantly enhances performance is introduced and an alternative derivation is developed based on elementary conditional probability arguments rather than bi-dimensional Markov chains. Finally, an additional performance improvement scheme is proposed by employing packet bursting in order to reduce overhead costs such as contention time and RTS/CTSex changes. Fairness is explored in short-time and long-time scales for both the legacy DCF and packet bursting cases. AIr protocol employs the RTS/CTS medium reservation scheme to cope with hidden stations and CSMA/CA techniques with linear contention window (CW) adjustment for medium access. A 1-dimensional Markov chain model is constructed instead of the bi-dimensional model in order to obtain simple mathematical equations of the average packet delay.This new approach greatly simplifies previous analyses and can be applied to any CSMA/CA protocol.The derived mathematical model is validated by comparing analytical with simulation results and an extensive Alr packet delay evaluation is carried out by taking into account all the factors and parameters that affect protocol performance. Finally, suitable values for both backoff and protocol parameters are proposed that reduce average packet delay and, thus, maximize performance

A fair access mechanism based on TXOP in IEEE 802.11e wireless networks

IEEE 802.11e is an extension of IEEE 802.11 that provides Quality of Service (QoS) for the applications with different service requirements. This standard makes use of several parameters such as contention window; inter frame space time and transmission opportunity to create service differentiation in the network. Transmission opportunity (TXOP), that is the focus point of this paper, is the time interval, during which a station is allowed to transmit packets without any contention. As the fixed amounts of TXOPs are allocated to different stations, unfairness appears in the network. And when users with different data rates exist, IEEE 802.11e WLANs face the lack of fairness in the network. Because the higher data rate stations transfer more data than the lower rate ones. Several mechanisms have been proposed to solve this problem by generating new TXOPs adaptive to the network's traffic condition. In this paper, some proposed mechanisms are evaluated and according to their evaluated strengths and weaknesses, a new mechanism is proposed for TXOP determination in IEEE 802.11e wireless networks. Our new algorithm considers data rate, channel error rate and data packet lengths to calculate adaptive TXOPs for the stations. The simulation results show that the proposed algorithm leads to better fairness and also higher throughput and lower delays in the network.

STUDY OF MOBILITY AND QoS OF 802.11 AND 802.11e WIRELESS LAN STANDARDS

Quality of service (QoS) is a key problem in wireless environments where bandwidth is scarce and channel conditions are time varying and sometimes implies highly packet losses. IEEE 802.11b/g/a wireless LAN (WLAN) are the most widely used WLAN standards today, and the IEEE 802.11e QoS enhancement standard exists and introduces QoS support for multimedia applications. This paper presents a class based admission control algorithm for 802.11e based wireless local area networks . The strengths of our admission control is dynamicity and flexibility of the algorithm, which adapts to the situation of the BSS, like global load, number of best effort AC, and position of QSTA by report of QAP. Thus it achieves higher throughput than other admission control for 802.11 e. A summary of many good solutions on admission control for 802.11e is be done, and the model of our admission control is presented. The 802.11e standard starves the low priority traffic in case of high load, and leads to higher collision rates, and did not make a good estimate of weight of queues, so there is an unbalance enters the flows with high priorities. A discussion is presented in detail using simulation-based evaluations, with an aim of comparing results of our admission control algorithm, with the 802.11e standard and the FHCF algorithm. Results reveal an improvement of the network load and a decrease of the number of collisions

Performance analysis of the IEEE 802.11e block ACK scheme in a noisy channel

A block ACK (BTA) scheme has been proposed in IEEE 802.11e to improve medium access control (MAC) layer performance. It is also a promising technique for next-generation high-speed wireless LANs (WLANs) such as IEEE 802.11n. We present a theoretical model to evaluate MAC saturation throughput of this scheme. This model takes into account the effects of both collisions and transmission errors in a noisy channel. The accuracy of this model is validated by NS-2 simulations

Performance modelling and enhancement of wireless communication protocols

In recent years, Wireless Local Area Networks(WLANs) play a key role in the data communications and networking areas, having witnessed significant research and development. WLANs are extremely popular being almost everywhere including business,office and home deployments.In order to deal with the modem Wireless connectivity needs,the Institute of Electrical and Electronics Engineers(IEEE) has developed the 802.11 standard family utilizing mainly radio transmission techniques, whereas the Infrared Data Association (IrDA) addressed the requirement for multipoint connectivity with the development of the Advanced Infrared(Alr) protocol stack. This work studies the collision avoidance procedures of the IEEE 802.11 Distributed Coordination Function (DCF) protocol and suggests certain protocol enhancements aiming at maximising performance. A new, elegant and accurate analysis based on Markov chain modelling is developed for the idealistic assumption of unlimited packet retransmissions as well as for the case of finite packet retry limits. Simple equations are derived for the through put efficiency, the average packet delay, the probability of a packet being discarded when it reaches the maximum retransmission limit, the average time to drop such a packet and the packet inter-arrival time for both basic access and RTS/CTS medium access schemes.The accuracy of the mathematical model is validated by comparing analytical with OPNET simulation results. An extensive and detailed study is carried out on the influence of performance of physical layer, data rate, packet payload size and several backoff parameters for both medium access mechanisms. The previous mathematical model is extended to take into account transmission errors that can occur either independently with fixed Bit Error Rate(BER) or in bursts. The dependency of the protocol performance on BER and other factors related to independent and burst transmission errors is explored. Furthermore, a simple-implement appropriate tuning of the back off algorithm for maximizing IEEE 802-11 protocol performance is proposed depending on the specific communication requirements. The effectiveness of the RTS/CTS scheme in reducing collision duration at high data rates is studied and an all-purpose expression for the optimal use of the RTS/CTS reservation scheme is derived. Moreover, an easy-to-implement backoff algorithm that significantly enhances performance is introduced and an alternative derivation is developed based on elementary conditional probability arguments rather than bi-dimensional Markov chains. Finally, an additional performance improvement scheme is proposed by employing packet bursting in order to reduce overhead costs such as contention time and RTS/CTSex changes. Fairness is explored in short-time and long-time scales for both the legacy DCF and packet bursting cases. AIr protocol employs the RTS/CTS medium reservation scheme to cope with hidden stations and CSMA/CA techniques with linear contention window (CW) adjustment for medium access. A 1-dimensional Markov chain model is constructed instead of the bi-dimensional model in order to obtain simple mathematical equations of the average packet delay.This new approach greatly simplifies previous analyses and can be applied to any CSMA/CA protocol.The derived mathematical model is validated by comparing analytical with simulation results and an extensive Alr packet delay evaluation is carried out by taking into account all the factors and parameters that affect protocol performance. Finally, suitable values for both backoff and protocol parameters are proposed that reduce average packet delay and, thus, maximize performance.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

An admission control scheme for IEEE 802.11e wireless local area networks

Includes bibliographical references (leaves 80-84).Recent times has seen a tremendous increase in the deployment and use of 802.11 Wireless Local Area Networks (WLANs). These networks are easy to deploy and maintain, while providing reasonably high data rates at a low cost. In the paradigm of Next-Generation-Networks (NGNs), WLANs can be seen as an important access network technology to support IP multimedia services. However a traditional WLAN does not provide Quality of Service (QoS) support since it was originally designed for best effort operation. The IEEE 802. 11e standard was introduced to overcome the lack of QoS support for the legacy IEEE 802 .11 WLANs. It enhances the Media Access Control (MAC) layer operations to incorporate service differentiation. However, there is a need to prevent overloading of wireless channels, since the QoS experienced by traffic flows is degraded with heavily loaded channels. An admission control scheme for IEEE 802.11e WLANs would be the best solution to limit the amount of multimedia traffic so that channel overloading can be prevented. Some of the work in the literature proposes admission control solutions to protect the QoS of real-time traffic for IEEE 802.11e Enhanced Distributed Channel Access (EDCA). However, these solutions often under-utilize the resources of the wireless channels. A measurement-aided model-based admission control scheme for IEEE 802.11e EDCA WLANs is proposed to provide reasonable bandwidth guarantees to all existing flows. The admission control scheme makes use of bandwidth estimations that allows the bandwidth guarantees of all the flows that are admitted into the network to be protected. The bandwidth estimations are obtained using a developed analytical model of IEEE 802.11e EDCA channels. The admission control scheme also aims to accept the maximum amount of flows that can be accommodated by the network's resources. Through simulations, the performance of the proposed admission control scheme is evaluated using NS-2. Results show that accurate bandwidth estimations can be obtained when comparing the estimated achievable bandwidth to actual simulated bandwidth. The results also validate that the bandwidth needs of all admitted traffic are always satisfied when the admission control scheme is applied. It was also found that the admission control scheme allows the maximum amount of flows to be admitted into the network, according the network's capacity