Enhancing IEEE 802.11MAC in congested environments

IEEE 802.11 is currently the most deployed wireless local area networking standard. It uses carrier sense multiple access with collision avoidance (CSMA/CA) to resolve contention between nodes. Contention windows (CW) change dynamically to adapt to the contention level: Upon each collision, a node doubles its CW to reduce further collision risks. Upon a successful transmission, the CW is reset, assuming that the contention level has dropped. However, the contention level is more likely to change slowly, and resetting the CW causes new collisions and retransmissions before the CW reaches the optimal value again. This wastes bandwidth and increases delays. In this paper we analyze simple slow CW decrease functions and compare their performances to the legacy standard. We use simulations and mathematical modeling to show their considerable improvements at all contention levels and transient phases, especially in highly congested environments

Improving Performance for CSMA/CA Based Wireless Networks

Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) based wireless networks are becoming increasingly ubiquitous. With the aim of supporting rich multimedia applications such as high-definition television (HDTV, 20Mbps) and DVD (9.8Mbps), one of the technology trends is towards increasingly higher bandwidth. Some recent IEEE 802.11n proposals seek to provide PHY rates of up to 600 Mbps. In addition to increasing bandwidth, there is also strong interest in extending the coverage of CSMA/CA based wireless networks. One solution is to relay traffic via multiple intermediate stations if the sender and the receiver are far apart. The so called “mesh” networks based on this relay-based approach, if properly designed, may feature both “high speed” and “large coverage” at the same time. This thesis focusses on MAC layer performance enhancements in CSMA/CA based networks in this context. Firstly, we observe that higher PHY rates do not necessarily translate into corresponding increases in MAC layer throughput due to the overhead of the CSMA/CA based MAC/PHY layers. To mitigate the overhead, we propose a novel MAC scheme whereby transported information is partially acknowledged and retransmitted. Theoretical analysis and extensive simulations show that the proposed MAC approach can achieve high efficiency (low MAC overhead) for a wide range of channel variations and realistic traffic types. Secondly, we investigate the close interaction between the MAC layer and the buffer above it to improve performance for real world traffic such as TCP. Surprisingly, the issue of buffer sizing in 802.11 wireless networks has received little attention in the literature yet it poses fundamentally new challenges compared to buffer sizing in wired networks. We propose a new adaptive buffer sizing approach for 802.11e WLANs that maintains a high level of link utilisation, while minimising queueing delay. Thirdly, we highlight that gross unfairness can exist between competing flows in multihop mesh networks even if we assume that orthogonal channels are used in neighbouring hops. That is, even without inter-channel interference and hidden terminals, multi-hop mesh networks which aim to offer a both “high speed” and “large coverage” are not achieved. We propose the use of 802.11e’s TXOP mechanism to restore/enfore fairness. The proposed approach is implementable using off-the-shelf devices and fully decentralised (requires no message passing)

Improving the Performance of Wireless LANs

This book quantifies the key factors of WLAN performance and describes methods for improvement. It provides theoretical background and empirical results for the optimum planning and deployment of indoor WLAN systems, explaining the fundamentals while supplying guidelines for design, modeling, and performance evaluation. It discusses environmental effects on WLAN systems, protocol redesign for routing and MAC, and traffic distribution; examines emerging and future network technologies; and includes radio propagation and site measurements, simulations for various network design scenarios, numerous illustrations, practical examples, and learning aids

Aggregation with fragment retransmission for very high-speed WLANs

In upcoming very high-speed WLANs the physical layer (PHY) rate may reach 600 Mbps. To achieve high efficiency at the medium access control (MAC) layer, we identify fundamental properties that must be satisfied by any CSMA/CA based MAC layer and develop a novel scheme called Aggregation with Fragment Retransmission (AFR). In the AFR scheme, multiple packets are aggregated into and transmitted in a single large frame. If errors happen during the transmission, only the corrupted fragments of the large frame are retransmitted. An analytic model is developed to evaluate the throughput and delay performance of AFR over a noisy channel, and to compare AFR with competing schemes in the literature. Optimal frame and fragment sizes are calculated using this model. Transmission delays are minimised by using a zero-waiting mechanism where frames are transmitted immediately once the MAC wins a transmission opportunity. We prove that zero waiting can achieve maximum throughput. As a complement to the theoretical analysis, we investigate by simulations the impact of AFR on the performance of realistic application traffic with diverse requirements. We have implemented the AFR scheme in the NS-2 simulator and present detailed results for TCP, VoIP and HDTV traffic. The AFR scheme described was developed as part of the 802.11n working group work. The analysis presented here is general enough to be extended to the proposed scheme in the upcoming 802.11n standard. Trends indicated by our simulation results should extend to any well-designed aggregation scheme

Decentralised Learning MACs for Collision-free Access in WLANs

By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a MAC with optimal long-run throughput that is almost decentralised. We then design two \changed{schemes} that are practically realisable, decentralised approximations of this optimal scheme and operate with different amounts of sensing information. We achieve this by (1) introducing learning algorithms that can substantially speed up convergence to collision free operation; (2) developing a decentralised schedule length adaptation scheme that provides long-run fair (uniform) access to the medium while maintaining collision-free access for arbitrary numbers of stations