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

Supporting Internet Access and Quality of Service in Distributed Wireless Ad Hoc Networks

In this era of wireless hysteria, with continuous technological advances in wireless communication and new wireless technologies becoming standardized at a fast rate, we can expect an increased interest for wireless networks, such as ad hoc and mesh networks. These networks operate in a distributed manner, independent of any centralized device. In order to realize the practical benefits of ad hoc networks, two challenges (among others) need to be considered: distributed QoS guarantees and multi-hop Internet access. In this thesis we present conceivable solutions to both of these problems. An autonomous, stand-alone ad hoc network is useful in many cases, such as search and rescue operations and meetings where participants wish to quickly share information. However, an ad hoc network connected to the Internet is even more desirable. This is because Internet plays an important role in the daily life of many people by offering a broad range of services. In this thesis we present AODV+, which is our solution to achieve this network interconnection between a wireless ad hoc network and the wired Internet. Providing QoS in distributed wireless networks is another challenging, but yet important, task mainly because there is no central device controlling the medium access. In this thesis we propose EDCA with Resource Reservation (EDCA/RR), which is a fully distributed MAC scheme that provides QoS guarantees by allowing applications with strict QoS requirements to reserve transmission time for contention-free medium access. Our scheme is compatible with existing standards and provides both parameterized and prioritized QoS. In addition, we present the Distributed Deterministic Channel Access (DDCA) scheme, which is a multi-hop extension of EDCA/RR and can be used in wireless mesh networks. Finally, we have complemented our simulation studies with real-world ad hoc and mesh network experiments. With the experience from these experiments, we obtained a clear insight into the limitations of wireless channels. We could conclude that a wise design of the network architecture that limits the number of consecutive wireless hops may result in a wireless mesh network that is able to satisfy users’ needs. Moreover, by using QoS mechanisms like EDCA/RR or DDCA we are able to provide different priorities to traffic flows and reserve resources for the most time-critical applications

A Survey of Medium Access Mechanisms for Providing QoS in Ad-Hoc Networks

n/

Internet Access and QoS in Ad Hoc Networks

It is likely that the increased popularity of wireless local area networks (WLANs) together with the continuous technological advances in wireless communication, also increase the interest for ad hoc networks. An ad hoc network is a wireless, autonomous, infrastructure-less network composed of stations that communicate with each other directly in a peer-to-peer fashion. When discussing mobile ad hoc networks (MANETs), we often refer to an ad hoc network where the stations cooperate in forwarding packets on behalf of each other to allow communication beyond their transmission range over multi-hop paths. In order to realize the practical benefits of ad hoc networks, two challenges (among others) need to be considered: distributed quality of service (QoS) guarantees and multi-hop Internet access. This thesis presents conceivable solutions to both of these problems. The first two papers focus on the network layer and consider the provisioning of Internet access to ad hoc networks whereas the last two papers focus on the data link layer and investigate the provisioning of QoS to ad hoc networks. The first paper studies the interconnection between a MANET and the Internet. In addition, it evaluates three approaches for gateway discovery, which can be initiated by the gateway (proactive method), by the mobile station (reactive method) or by mixing these two approaches (hybrid method). The second paper also studies Internet access for MANETs, but with focus on micro mobility, i.e. mobile stations moving from one gateway to another. In particular, it evaluates a solution that allows mobile stations to access the Internet and roam from gateway to gateway. The third paper, gives an overview of the medium access mechanisms in IEEE 802.11 and their QoS limitations. Moreover, it proposes an enhancement to the contention-free medium access mechanism of IEEE 802.11e to provide QoS guarantees in WLANs operating in ad hoc network configuration. The fourth paper continues the work from the third paper by enhancing the scheme and dealing with the problems that occur due to hidden stations. Furthermore, it discusses how to deal with the problems that occur when moving from single-hop ad hoc networks (i.e. WLANs in ad hoc network configuration) to multi-hop ad hoc networks

Analysis and improvement of medium access control protocols in wireless networks. Performance modelling and Quality-of-Service enhancement of IEEE 802.11e MAC in wireless local area networks under heterogeneous multimedia traffic.

In order to efficiently utilize the scarce wireless resource as well as keep up with the ever-increasing demand for Quality-of-Service (QoS) of multimedia applications, wireless networks are undergoing rapid development and dramatic changes in the underlying technologies and protocols. The Medium Access Control (MAC) protocol, which coordinates the channel access and data transmission of wireless stations, plays a pivotal role in wireless networks. Performance modelling and analysis has been and continues to be of great theoretical and practical importance in the design and development of wireless networks. This research is devoted to developing efficient and cost-effective analytical tools for the performance analysis and enhancement of MAC protocols in Wireless Local Area Networks (WLANs) under heterogeneous multimedia traffic. To support the MAC-layer QoS in WLANs, the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) protocol has proposed three QoS differentiation schemes in terms of Arbitrary Inter-Frame Space (AIFS), Contention Window (CW), and Transmission Opportunity (TXOP). This research starts with the development of new analytical models for the TXOP scheme specified in the EDCA protocol under Poisson traffic. A dynamic TXOP scheme is then proposed to adjust the TXOP limits according to the status of the transmission queue. Theoretical analysis and simulation experiments show that the proposed dynamic scheme largely improves the performance of TXOP. To evaluate the TXOP scheme in the presence of ii heterogeneous traffic, a versatile analytical model is developed to capture the traffic heterogeneity and model the features of burst transmission. The performance results highlight the importance of taking into account the heterogeneous traffic for the accurate evaluation of the TXOP scheme in wireless multimedia networks. To obtain a thorough and deep understanding of the performance attributes of the EDCA protocol, a comprehensive analytical model is then proposed to accommodate the integration of the three QoS schemes of EDCA in terms of AIFS, CW, and TXOP under Poisson traffic. The performance results show that the TXOP scheme can not only support service differentiation but also improve the network performance, whereas the AIFS and CW schemes provide QoS differentiation only. Moreover, the results demonstrate that the MAC buffer size has considerable impact on the QoS performance of EDCA under Poisson traffic. To investigate the performance of EDCA in wireless multimedia networks, an analytical model is further developed for EDCA under heterogeneous traffic. The performance results demonstrate the significant effects of heterogeneous traffic on the total delay and frame losses of EDCA with different buffer sizes. Finally, an efficient admission control scheme is presented for the IEEE 802.11e WLANs based on analytical modelling and a game-theoretical approach. The admission control scheme can maintain the system operation at an optimal point where the utility of the Access Point (AP) is maximized with the QoS constraints of various users

Fairness and transmission opportunity limit in IEEE 802.11e enhanced distributed channel access

Tämä diplomityö tutkii lähetysaikarajan vaikutusta verkon reiluuteen IEEE802.11e tehostettuun ja hajautettuun kommunikaatiokanavaan pääsyyn. IEEE802.11e tuo palvelunlaatuominaisuuksia IEEE802.11 langattomiin verkkoihin. Asemat, jotka käyttävät IEEE802.11e-ominaisuuksia jakavat liikenteen neljään kategoriaan. Kategorioiden välinen erottelu saavutetaan neljällä parametrilla, jotka kontrolloivat kanavaan pääsyä. Tämä työ tutkii yhtä näistä parametreistä, lähetysaikarajaa, joka kontrolloi lähetyksen kestoa. IEEE802.11e antaa referenssiarvoja parametreille, mutta näillä arvoilla verkon kuormituksen lisääntyessä, alemman prioriteetin liikenne kärsii nopeasti. Hyvin pian kuormituksen lisääntyessä alemman prioriteetin liikenne ei pääse verkosta läpi lainkaan. Tällöin myös verkon reiluus on matala. Reiluuden parantamiseksi, häiritsemättä korkean prioriteetin liikennettä, tämä työ tutkii ison lähetysaikarajan käyttöä. Ensimmäisessä simulaatiosarjassa alemman prioriteetin lähetysaikaraja on ääretön. Tämä tarkoitta sitä, että alemman prioriteetin jono voi lähettää kaikki pakettinsa kun se pääsee lähettämään. Tulokset osoittavat, että ääretön lähetysaikaraja parantaa reiluutta kun kanava on kuormittumassa. Tulokset osoittavat myös, että ääretön lähetysaikaraja ei merkittävästi heikennä korkean prioriteetin liikennettä. Toinen simulaatiosarja keskittyy sellaiseen verkon kuormitustilaan, missä äärettömän lähetysaikarajan vaikutus on suurin. Näissä simulaatioissa lähetysaikarajan arvo on staattinen. Simulaatiosta toiseen lähetysaikarajan arvo muutetaan toiseen arvoon väliltä nolla-suurin sallittu arvo. Tulokset näistä simulaatioista ovat hyvin samanlaiset kuin ensimmäisen simulaatiosarjan tulokset.This thesis investigates the effect of transmission opportunity limit on fairness in IEEE802.11e enhanced distributed channel access. IEEE802.11e brings quality of service features into IEEE802.11 wireless local area networks. In stations operating with IEEE802.11e, traffic is divided into categories. Differentiation between these categories is achieved by using four parameters to control the channel access. This thesis investigates one of these parameters, the transmission opportunity limit, which controls the channel access duration. With the reference parameter values given in IEEE802.11e, as the network congestion level increases, low priority traffic suffers quickly to a point where none of it gets transmitted. This makes the network overall fairness poor. To improve fairness while not disturbing high priority traffic, this thesis investigates the use of large transmission opportunity limit values. In the first set of simulations, the low priority traffic transmission opportunity limit values are set to infinite. This means that the low priority queue can send all its packets when it gains access to the channel. The results show that infinite transmission opportunity limit improves fairness when channel is getting congested. Also infinite transmission opportunity limit does not notably weaken high priority traffic performance. Second set of simulations focuses on the network congestion level where the effect of the infinite transmission opportunity limit is the largest. In these simulations the transmission opportunity limit is set to static value ranging from zero to a maximum allowed value. The results from these simulations are similar to the results of the first simulation set