Multi-Round Contention in Wireless LANs with Multipacket Reception

Multi-packet reception (MPR) has been recognized as a powerful capacity-enhancement technique for random-access wireless local area networks (WLANs). As is common with all random access protocols, the wireless channel is often under-utilized in MPR WLANs. In this paper, we propose a novel multi-round contention random-access protocol to address this problem. This work complements the existing random-access methods that are based on single-round contention. In the proposed scheme, stations are given multiple chances to contend for the channel until there are a sufficient number of ``winning" stations that can share the MPR channel for data packet transmission. The key issue here is the identification of the optimal time to stop the contention process and start data transmission. The solution corresponds to finding a desired tradeoff between channel utilization and contention overhead. In this paper, we conduct a rigorous analysis to characterize the optimal strategy using the theory of optimal stopping. An interesting result is that the optimal stopping strategy is a simple threshold-based rule, which stops the contention process as soon as the total number of winning stations exceeds a certain threshold. Compared with the conventional single-round contention protocol, the multi-round contention scheme significantly enhances channel utilization when the MPR capability of the channel is small to medium. Meanwhile, the scheme automatically falls back to single-round contention when the MPR capability is very large, in which case the throughput penalty due to random access is already small even with single-round contention

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)

Low-Complexity Multi-User MIMO Algorithms for mmWave WLANs

Very high throughput and high-efficiency wireless local area networks (WLANs) have become essential for today's significant global Internet traffic and the expected significant global increase of public WiFi hotspots. Total Internet traffic is predicted to expand 3.7-fold from 2017 to 2022. In 2017, 53% of overall Internet traffic used by WiFi networks, and that number is expected to increase to 56.8% by 2022. Furthermore, 80% of overall Internet traffic is expected to be video traffic by 2022, up from 70% in 2017. WiFi networks are also expected to move towards denser deployment scenarios, such as stadiums, large office buildings, and airports, with very high data rate applications, such as ultra-high definition video wireless streaming. Thus, in order to meet the predicted growth of wireless traffic and the number of WiFi networks in the world, an efficient Internet access solution is required for the current IEEE 802.11 standards. Millimeter wave (mmWave) communication technology is expected to play a crucial role in future wireless networks with large user populations because of the large spectrum band it can provide. To further improve spectrum efficiency over mmWave bands in WLANs with large numbers of users, the IEEE 802.11ay standard was developed from the traditional IEEE 802.11ad standard, aiming to support multi-user MIMO. Propagation challenges associated with mmWave bands necessitate the use of analog beamforming (BF) technologies that employ directional transmissions to determine the optimal sector beam between a transmitter and a receiver. However, the multi-user MIMO is not exploited, since analog BF is limited to a single-user, single-transmission. The computational complexity of achieving traditional multi-user MIMO BF methods, such as full digital BF, in the mmWave systems becomes significant due to the hardware constraints. Our research focuses on how to effectively and efficiently realize multi-user MIMO transmission to improve spectrum efficiency over the IEEE 802.11ay mmWave band system while also resolving the computational complexity challenges for achieving a multi-user MIMO in mmWave systems. This thesis focuses on MAC protocol algorithms and analysis of the IEEE 802.11ay mmWave WLANs to provide multi-user MIMO support in various scenarios to improve the spectrum efficiency and system throughput. Specifically, from a downlink single-hop scenario perspective, a VG algorithm is proposed to schedule simultaneous downlink transmission links while mitigating the multi-user interference with no additional computational complexity. From a downlink multi-hop scenario perspective, a low-complexity MHVG algorithm is conducted to realize simultaneous transmissions and improve the network performance by taking advantage of the spatial reuse in a dense network. The proposed MHVG algorithm permits simultaneous links scheduling and mitigates both the multi-user interference and co-channel interference based only on analog BF information, without the necessity for feedback overhead, such as channel state information (CSI). From an uplink scenario perspective, a low-complexity user selection algorithm, HBF-VG, incorporates user selection with the HBF algorithm to achieve simultaneous uplink transmissions for IEEE 802.11ay mmWave WLANs. With the HBF-VG algorithm, the users can be selected based on an orthogonality criterion instead of collecting CSI from all potential users. We optimize the digital BF to mitigate the residual interference among selected users. Extensive analytical and simulation evaluations are provided to validate the performance of the proposed algorithms with respect to average throughput per time slot, average network throughput, average sum-rate, energy efficiency, signal-to-interference-plus-noise ratio (SINR), and spatial multiplexing gain

Protocol design and optimization for QoS provisioning in wireless mesh networks

Wireless Mesh Network (WMN) has been recognized as a promising step towards the goal of ubiquitous broadband wireless Internet access. By exploiting the state-of-the-art radio and multi-hop networking technologies, mesh nodes in WMN collaboratively form a stationary wireless communication backbone. Data between clients and the Internet is routed through a series of mesh nodes via one or multiple paths. Such a mesh structure enables WMN to provide clients high-speed Internet access services with a less expensive and easier-to-deployment wireless infrastructure comparing to the wired counterparts. Due to the unique characteristics of WMN, existing protocols and schemes designed for other wellstudied wireless networks, such as Wi-Fi and Mobile Ad-hoc Network (MANET), are not suitable for WMN and hence cannot be applied to WMN directly. Therefore, novel protocols specifically designed and optimized forWMNare highly desired to fully exploit the mesh architecture. The goal is to provide high-level Quality-of-Service (QoS) to WMN clients to enable a rich portfolio of wireless and mobile applications and scenarios. This dissertation investigates the following important issues related to QoS provisioning in WMN: high throughput routing between WMN clients and the Internet, fairness provisioning among WMN clients and network-level capacity optimization. We propose innovative solutions to address these issues and improve the performance, scalability and reliability of WMN. In addition, we develop CyMesh, a multi-radio multi-channel (MRMC) wireless mesh network testbed, to evaluate the capacity and performance of WMN in real world environments. Extensive simulation (using the QualNet simulator) and experimental (over the CyMesh testbed) results demonstrate the effectiveness of the designed protocols. In particular, we learn that the system capacity of WMN can be improved significantly by exploiting the MRMC network architecture and the antenna directionality of radios equipped on mesh nodes, and our proposed fulfillment based fairness is a reasonable notion for fair service provisioning among WMN clients. Moreover, we report the encountered problems, key observations and learned lessons during the design and deployment of CyMesh, which may serve as a valuable resource for future MRMC WMN implementations

Buffer Sizing for 802.11 Based Networks

We consider the sizing of network buffers in 802.11 based networks. Wireless networks face a number of fundamental issues that do not arise in wired networks. We demonstrate that the use of fixed size buffers in 802.11 networks inevitably leads to either undesirable channel under-utilization or unnecessary high delays. We present two novel dynamic buffer sizing algorithms that achieve high throughput while maintaining low delay across a wide range of network conditions. Experimental measurements demonstrate the utility of the proposed algorithms in a production WLAN and a lab testbed.Comment: 14 pages, to appear on IEEE/ACM Transactions on Networkin