Load-aware Channel Selection for 802.11 WLANs with Limited Measurement

It has been known that load unaware channel selection in 802.11 networks results in high level interference, and can significantly reduce the network throughput. In current implementation, the only way to determine the traffic load on a channel is to measure that channel for a certain duration of time. Therefore, in order to find the best channel with the minimum load all channels have to be measured, which is costly and can cause unacceptable communication interruptions between the AP and the stations. In this paper, we propose a learning based approach which aims to find the channel with the minimum load by measuring only limited number of channels. Our method uses Gaussian Process Regressing to accurately track the traffic load on each channel based on the previous measured load. We confirm the performance of our algorithm by using experimental data, and show that the time consumed for the load measurement can be reduced up to 46% compared to the case where all channels are monitored.Comment: accepted to IC

Interference Management in Dense 802.11 Networks

Wireless networks are growing at a phenomenal rate. This growth is causing an overcrowding of the unlicensed RF spectrum, leading to increased interference between co-located devices. Existing decentralized medium access control (MAC) protocols (e.g. IEEE 802.11a/b/g standards) are poorly designed to handle interference in such dense wireless environments. This is resulting in networks with poor and unpredictable performance, especially for delay-sensitive applications such as voice and video. This dissertation presents a practical conflict-graph (CG) based approach to designing self-organizing enterprise wireless networks (or WLANs) where interference is centrally managed by the network infrastructure. The key idea is to use potential interference information (available in the CG) as an input to algorithms that optimize the parameters of the WLAN.We demonstrate this idea in three ways. First, we design a self-organizing enterprise WLAN and show how the system enhances performance over non-CG based schemes, in a high fidelity network simulator. Second, we build a practical system for conflict graph measurement that can precisely measure interference (for a given network configuration) in dense wireless environments. Finally, we demonstrate the practical benefits of the conflict graph system by using it in an optimization framework that manages associations and traffic for mobile VoIP clients in the enterprise. There are a number of contributions of this dissertation. First, we show the practical application of conflict graphs for infrastructure-based interference management in dense wireless networks. A prototype design exhibits throughput gains of up to 50% over traditional approaches. Second, we develop novel schemes for designing a conflict graph measurement system for enterprise WLANs that can detect interference at microsecond-level timescales and with little network overhead. This allows us to compute the conflict graph up to 400 times faster as compared to the current best practice proposed in the literature. The system does not require any modifications to clients or any specialized hardware for its operation. Although the system is designed for enterprise WLANs, the proposed techniques and corresponding results are applicable to other wireless systems as well (e.g. wireless mesh networks). Third, our work opens up the space for designing novel fine-grained interference-aware protocols/algorithms that exploit the ability to compute the conflict graph at small timescales. We demonstrate an instance of such a system with the design and implementation of an architecture that dynamically manages client associations and traffic in an enterprise WLAN. We show how mobile clients sustain uninterrupted and consistent VoIP call quality in the presence of background interference for the duration of their VoIP sessions

Distributed Cooperative Framework and Algorithms for wireless Network Performance Optimization

In Wireless Local Access Networks (WLANs), the Medium Access Control (MAC) protocol is the primary element that determines the efficiency of sharing the limited communication bandwidth of the wireless channel. IEEE 802.11 MAC uses the contention-based Distributed Coordination Function (DCF) as a fundamental medium access mechanism. However, the dynamic nature of the wireless environment creates mobility challenges of maintaining maximum channel capacity, of obtaining optimal throughput and latency, and of retaining good security in a distributed wireless network. This dissertation first introduces a set of parameters to characterize the medium status and radio environment, and a mechanism for mobile devices to exchange measurements in order to obtain broad and comprehensive knowledge of the wireless environment. Then the dissertation proposes a distributed cooperative wireless architecture and framework, and three cooperative algorithms to optimize wireless network performance. The cooperative algorithms allow wireless devices to cooperatively adjust configurations and optimize operations based on the characteristics of the environment. The first algorithm adaptively adjusts the contention window size to reduce the number of collisions as the number of mobile devices increases, in order to reach maximum channel utilization. However, if a channel reaches the saturated state, the throughput per user decreases significantly. Therefore, the second algorithm discussed in this dissertation is to select the best Access Point (AP) in overlapped AP coverage areas to balance network loads and maximally utilize the network capacity. When the mobile device transitions from one AP to another AP, it may take milliseconds to seconds due to required re-association and re-authentication with the new AP. Thus, the third cooperative algorithm optimizes the device transition to provide an acceptable balance of latency and security. The corresponding simulation or experiment results that demonstrate a significant improvement of wireless network performance are explained for each algorithm. Forgery and confidentiality are major concerns for distributed radio resource measurement and cooperation. Thus, this dissertation concludes with an analysis of security threats to radio resource measurement and cooperation, and proposes an action frame protection scheme to ensure secure distributed cooperative wireless networks

Analysis, design and experimental evaluation of connectivity management in heterogeneous wireless environments

Mención Internacional en el título de doctorThe future of network communications is mobile as many more users demand for ubiquitous connectivity. Wireless has become the primary access technology or even the only one, leading to an explosion in traffic demand. This challenges network providers to manage and configure new requirements without incrementing costs in the same amount. In addition to the growth in the use of mobile devices, there is a need to operate simultaneously different access technologies. As well, the great diversity of applications and the capabilities of mobile terminals makes possible for us to live in a hyper-connected world and offers new scenarios. This heterogeneity poses great challenges that need to be addressed to offer better performance and seamless experience to the final user. We need to orchestrate solutions to increase flexibility and empower interoperability. Connectivity management is handled from different angles. In the network stack, mobility is more easily handled by IP mobility protocols, since IP is the common layer between the different access technologies and the application diversity. From the end-user perspective, the connection manager is in charge of handling connectivity issues in mobile devices, but it is an unstandardized entity so its performance is heavily implementation-dependent. In this thesis we explore connectivity management from different angles. We study mobility protocols as they are part of our proposed solutions. In most of the cases we include an experimental evaluation of performance with 3G and IEEE 802.11 as the main technologies. We consider heterogeneous scenarios, with several access technologies where mobile devices have also several network interfaces. We evaluate how connectivity is handled as well as its influence in a handover. Based on the analysis of real traces from a cellular network, we confirm the suitability of more efficient mobility management. Moreover, we propose and evaluate three different solutions for providing mobility support in three different heterogeneous scenarios. We perform an experimental evaluation of a vehicular route optimization for network mobility, reporting on the challenges and lessons learned in such a complicated networking environment. We propose an architecture for supporting mobility and enhance handover in a passive optical network deployment. In addition, we design and deploy a mechanism for mobility management based on software-defined networking.Programa Oficial de Doctorado en Ingeniería TelemáticaPresidente: Arturo Azcorra Saloña.- Secretario: Ramón Agüero Calvo.- Vocal: Daniel Nunes Coruj

User-centric power-friendly quality-based network selection strategy for heterogeneous wireless environments

The ‘Always Best Connected’ vision is built around the scenario of a mobile user seamlessly roaming within a multi-operator multi-technology multi-terminal multi-application multi-user environment supported by the next generation of wireless networks. In this heterogeneous environment, users equipped with multi-mode wireless mobile devices will access rich media services via one or more access networks. All these access networks may differ in terms of technology, coverage range, available bandwidth, operator, monetary cost, energy usage etc. In this context, there is a need for a smart network selection decision to be made, to choose the best available network option to cater for the user’s current application and requirements. The decision is a difficult one, especially given the number and dynamics of the possible input parameters. What parameters are used and how those parameters model the application requirements and user needs is important. Also, game theory approaches can be used to model and analyze the cooperative or competitive interaction between the rational decision makers involved, which are users, seeking to get good service quality at good value prices, and/or the network operators, trying to increase their revenue. This thesis presents the roadmap towards an ‘Always Best Connected’ environment. The proposed solution includes an Adapt-or-Handover solution which makes use of a Signal Strength-based Adaptive Multimedia Delivery mechanism (SAMMy) and a Power-Friendly Access Network Selection Strategy (PoFANS) in order to help the user in taking decisions, and to improve the energy efficiency at the end-user mobile device. A Reputation-based System is proposed, which models the user-network interaction as a repeated cooperative game following the repeated Prisoner’s Dilemma game from Game Theory. It combines reputation-based systems, game theory and a network selection mechanism in order to create a reputation-based heterogeneous environment. In this environment, the users keep track of their individual history with the visited networks. Every time, a user connects to a network the user-network interaction game is played. The outcome of the game is a network reputation factor which reflects the network’s previous behavior in assuring service guarantees to the user. The network reputation factor will impact the decision taken by the user next time, when he/she will have to decide whether to connect or not to that specific network. The performance of the proposed solutions was evaluated through in-depth analysis and both simulation-based and experimental-oriented testing. The results clearly show improved performance of the proposed solutions in comparison with other similar state-of-the-art solutions. An energy consumption study for a Google Nexus One streaming adaptive multimedia was performed, and a comprehensive survey on related Game Theory research are provided as part of the work

Towards the Quality of Service for VoIP traffic in IEEE 802.11 Wireless Networks

The usage of voice over IP (VoIP) traffic in IEEE 802.11 wireless networks is expected to increase in the near future due to widely deployed 802.11 wireless networks and VoIP services on fixed lines. However, the quality of service (QoS) of VoIP traffic in wireless networks is still unsatisfactory. In this thesis, I identify several sources for the QoS problems of VoIP traffic in IEEE 802.11 wireless networks and propose solutions for these problems. The QoS problems discussed can be divided into three categories, namely, user mobility, VoIP capacity, and call admission control. User mobility causes network disruptions during handoffs. In order to reduce the handoff time between Access Points (APs), I propose a new handoff algorithm, Selective Scanning and Caching, which finds available APs by scanning a minimum number of channels and furthermore allows clients to perform handoffs without scanning, by caching AP information. I also describe a new architecture for the client and server side for seamless IP layer handoffs, which are caused when mobile clients change the subnet due to layer 2 handoffs. I also present two methods to improve VoIP capacity for 802.11 networks, Adaptive Priority Control (APC) and Dynamic Point Coordination Function (DPCF). APC is a new packet scheduling algorithm at the AP and improves the capacity by balancing the uplink and downlink delay of VoIP traffic, and DPCF uses a polling based protocol and minimizes the bandwidth wasted from unnecessary polling, using a dynamic polling list. Additionally, I estimated the capacity for VoIP traffic in IEEE 802.11 wireless networks via theoretical analysis, simulations, and experiments in a wireless test-bed and show how to avoid mistakes in the measurements and comparisons. Finally, to protect the QoS for existing VoIP calls while maximizing the channel utilization, I propose a novel admission control algorithm called QP-CAT (Queue size Prediction using Computation of Additional Transmission), which accurately predicts the impact of new voice calls by virtually transmitting virtual new VoIP traffic

Quality of service differentiation for multimedia delivery in wireless LANs

Delivering multimedia content to heterogeneous devices over a variable networking environment while maintaining high quality levels involves many technical challenges. The research reported in this thesis presents a solution for Quality of Service (QoS)-based service differentiation when delivering multimedia content over the wireless LANs. This thesis has three major contributions outlined below: 1. A Model-based Bandwidth Estimation algorithm (MBE), which estimates the available bandwidth based on novel TCP and UDP throughput models over IEEE 802.11 WLANs. MBE has been modelled, implemented, and tested through simulations and real life testing. In comparison with other bandwidth estimation techniques, MBE shows better performance in terms of error rate, overhead, and loss. 2. An intelligent Prioritized Adaptive Scheme (iPAS), which provides QoS service differentiation for multimedia delivery in wireless networks. iPAS assigns dynamic priorities to various streams and determines their bandwidth share by employing a probabilistic approach-which makes use of stereotypes. The total bandwidth to be allocated is estimated using MBE. The priority level of individual stream is variable and dependent on stream-related characteristics and delivery QoS parameters. iPAS can be deployed seamlessly over the original IEEE 802.11 protocols and can be included in the IEEE 802.21 framework in order to optimize the control signal communication. iPAS has been modelled, implemented, and evaluated via simulations. The results demonstrate that iPAS achieves better performance than the equal channel access mechanism over IEEE 802.11 DCF and a service differentiation scheme on top of IEEE 802.11e EDCA, in terms of fairness, throughput, delay, loss, and estimated PSNR. Additionally, both objective and subjective video quality assessment have been performed using a prototype system. 3. A QoS-based Downlink/Uplink Fairness Scheme, which uses the stereotypes-based structure to balance the QoS parameters (i.e. throughput, delay, and loss) between downlink and uplink VoIP traffic. The proposed scheme has been modelled and tested through simulations. The results show that, in comparison with other downlink/uplink fairness-oriented solutions, the proposed scheme performs better in terms of VoIP capacity and fairness level between downlink and uplink traffic

Design and analysis of LTE and wi-fi schemes for communications of massive machine devices

Existing communication technologies are designed with speciÿc use cases in mind, however, ex-tending these use cases usually throw up interesting challenges. For example, extending the use of existing cellular networks to emerging applications such as Internet of Things (IoT) devices throws up the challenge of handling massive number of devices. In this thesis, we are motivated to investigate existing schemes used in LTE and Wi-Fi for supporting massive machine devices and improve on observed performance gaps by designing new ones that outperform the former. This thesis investigates the existing random access protocol in LTE and proposes three schemes to combat massive device access challenge. The ÿrst is a root index reuse and allocation scheme which uses link budget calculations in extracting a safe distance for preamble reuse under vari-able cell size and also proposes an index allocation algorithm. Secondly, a dynamic subframe optimization scheme that combats the challenge from an optimisation solution perspective. Thirdly, the use of small cells for random access. Simulation and numerical analysis shows performance improvements against existing schemes in terms of throughput, access delay and probability of collision. In some cases, over 20% increase in performance was observed. The proposed schemes provide quicker and more guaranteed opportunities for machine devices to communicate. Also, in Wi-Fi networks, adaptation of the transmission rates to the dynamic channel condi-tions is a major challenge. Two algorithms were proposed to combat this. The ÿrst makes use of contextual information to determine the network state and respond appropriately whilst the second samples candidate transmission modes and uses the e˛ective throughput to make a deci-sion. The proposed algorithms were compared to several existing rate adaptation algorithms by simulations and under various system and channel conÿgurations. They show signiÿcant per-formance improvements, in terms of throughput, thus, conÿrming their suitability for dynamic channel conditions