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)

Analysis of the IEEE 802.11e EDCA Under Statistical Traffic

Many models have been proposed to analyze the performance of the IEEE 802.11 distributed coordination function (DCF) and the IEEE 802.11e enhanced distributed coordination function (EDCA) under saturation condition. To analyze DCF under statistical traffic, Foh and Zukerman introduce a model that uses Markovian Framework to compute the throughput and delay performance. In this paper, we analyze the protocol service time of EDCA mechanism and introduce a model to analyze EDCA under statistical traffic using Markovian Framework. Using this model, we analyze the throughput and delay performance of EDCA mechanism under statistical traffic

An integrated priority-based cell attenuation model for dynamic cell sizing

A new, robust integrated priority-based cell attenuation model for dynamic cell sizing is proposed and simulated using real mobile traffic data.The proposed model is an integration of two main components; the modified virtual community – parallel genetic algorithm (VC-PGA) cell priority selection module and the evolving fuzzy neural network (EFuNN) mobile traffic prediction module.The VC-PGA module controls the number of cell attenuations by ordering the priority for the attenuation of all cells based on the level of mobile level of mobile traffic within each cell.The EFuNN module predicts the traffic volume of a particular cell by extracting and inserting meaningful rules through incremental, supervised real-time learning.The EFuNN module is placed in each cell and the output, the predicted mobile traffic volume of the particular cell, is sent to local and virtual community servers in the VC-PGA module.The VC-PGA module then assigns priorities for the size attenuation of all cells within the network, based on the predicted mobile traffic levels from the EFuNN module at each cell.The performance of the proposed module was evaluated on five adjacent cells in Selangor, Malaysia. Real-time predicted mobile traffic from the EFuNN structure was used to control the size of all the cells.Results obtained demonstrate the robustness of the integrated module in recognizing the temporal pattern of the mobile traffic and dynamically controlling the cell size in order to reduce the number of calls dropped

Energy-efficient wireless communication

In this chapter we present an energy-efficient highly adaptive network interface architecture and a novel data link layer protocol for wireless networks that provides Quality of Service (QoS) support for diverse traffic types. Due to the dynamic nature of wireless networks, adaptations in bandwidth scheduling and error control are necessary to achieve energy efficiency and an acceptable quality of service. In our approach we apply adaptability through all layers of the protocol stack, and provide feedback to the applications. In this way the applications can adapt the data streams, and the network protocols can adapt the communication parameters

An Efficient Framework of Congestion Control for Next-Generation Networks

The success of the Internet can partly be attributed to the congestion control algorithm in the Transmission Control Protocol (TCP). However, with the tremendous increase in the diversity of networked systems and applications, TCP performance limitations are becoming increasingly problematic and the need for new transport protocol designs has become increasingly important.Prior research has focused on the design of either end-to-end protocols (e.g., CUBIC) that rely on implicit congestion signals such as loss and/or delay or network-based protocols (e.g., XCP) that use precise per-flow feedback from the network. While the former category of schemes haveperformance limitations, the latter are hard to deploy, can introduce high per-packet overhead, and open up new security challenges. This dissertation explores the middle ground between these designs and makes four contributions. First, we study the interplay between performance and feedback in congestion control protocols. We argue that congestion feedback in the form of aggregate load can provide the richness needed to meet the challenges of next-generation networks and applications. Second, we present the design, analysis, and evaluation of an efficient framework for congestion control called Binary Marking Congestion Control (BMCC). BMCC uses aggregate load feedback to achieve efficient and fair bandwidth allocations on high bandwidth-delaynetworks while minimizing packet loss rates and average queue length. BMCC reduces flow completiontimes by up to 4x over TCP and uses only the existing Explicit Congestion Notification bits.Next, we consider the incremental deployment of BMCC. We study the bandwidth sharing properties of BMCC and TCP over different partial deployment scenarios. We then present algorithms for ensuring safe co-existence of BMCC and TCP on the Internet. Finally, we consider the performance of BMCC over Wireless LANs. We show that the time-varying nature of the capacity of a WLAN can lead to significant performance issues for protocols that require capacity estimates for feedback computation. Using a simple model we characterize the capacity of a WLAN and propose the usage of the average service rate experienced by network layer packets as an estimate for capacity. Through extensive evaluation, we show that the resulting estimates provide good performance