Situation-Aware Rate and Power Adaptation Techniques for IEEE 802.11

The current generation of IEEE 802.11 Wireless Local Area Networks (WLANs) provide multiple data rates from which the different physical (PHY) layers may choose. The rate adaptation algorithm (RAA) is an essential component of 802.11 WLANs which completely determines the data rate a device may use. Some of the key challenges facing data rate selection are the constantly varying wireless channel, selecting the data rate that will result in the maximum throughput, assessing the conditions based on limited feedback and estimating the link conditions at the receiver. Current RAAs lack the ability to sense their environment and adapt accordingly. 802.11 WLANs are deployed in many locations and use the same technique to choose the data rate in all locations and situations. Therefore, these RAAs suffer from the inability to adapt the method they use to choose the data transmission rate. In this thesis, a new RAA for 802.11 WLANs is proposed which provides an answer to the many challenges faced by RAAs. The proposed RAA is termed SARA which stands for Situation-Aware Rate Adaptation, and combines the use of the received signal strength and packet error rate to enable situational awareness. SARA adapts to the current environmental situation experienced at the moment to rapidly take advantage of changing channel conditions. In addition to SARA, a method to optimize the transmission power for, but not limited to, IEEE 802.11 WLANs is proposed which can determine the minimum transmission power required by a station (STA) or base station (BS) for successful transmission of a data packet. The technique reduces the transmission power to the minimum level based on the current situation while maintaining QoS constraints. The method employs a Binary Search to quickly determine the minimum transmission power with low complexity and delay. Such a technique is useful to conserve battery life in mobile devices for 802.11 WLANs. Both algorithms are implemented on an Atheros device driver for the FreeBSD operating system. SARA is compared to the benchmark algorithm SampleRate while an estimate of the energy consumed as well as the energy saved is provided for the minimum transmission power determination

A Remote Capacity Utilization Estimator for WLANs

In WLANs, the capacity of a node is not fixed and can vary dramatically due to the shared nature of the medium under the IEEE 802.11 MAC mechanism. There are two main methods of capacity estimation in WLANs: Active methods based upon probing packets that consume the bandwidth of the channel and do not scale well. Passive methods based upon analyzing the transmitted packets that avoid the overhead of transmitting probe packets and perform with greater accuracy. Furthermore, passive methods can be implemented locally or remotely. Local passive methods require an additional dissemination mechanism in order to communicate the capacity information to other network nodes which adds complexity and can be unreliable under adverse network conditions. On the other hand, remote passive methods do not require a dissemination mechanism and so can be simpler to implement and also do not suffer from communication reliability issues. Many applications (e.g. ANDSF etc) can benefit from utilizing this capacity information. Therefore, in this thesis we propose a new remote passive Capacity Utilization estimator performed by neighbour nodes. However, there will be an error associated with the measurements owing to the differences in the wireless medium as observed by the different nodes’ location. The main undertaking of this thesis is to address this issue. An error model is developed to analyse the main sources of error and to determine their impact on the accuracy of the estimator. Arising from this model, a number of modifications are implemented to improve the accuracy of the estimator. The network simulator ns2 is used to investigate the performance of the estimator and the results from a range of different test scenarios indicate its feasibility and accuracy as a passive remote method. Finally, the estimator is deployed in a node saturation detection scheme where it is shown to outperform two other similar schemes based upon queue observation and probing with ping packets

Improving Dependability of Networks with Penalty and Revocation Mechanisms

Both malicious and non-malicious faults can dismantle computer networks. Thus, mitigating faults at various layers is essential in ensuring efficient and fair network resource utilization. In this thesis we take a step in this direction and study several ways to deal with faults by means of penalties and revocation mechanisms in networks that are lacking a centralized coordination point, either because of their scale or design. Compromised nodes can pose a serious threat to infrastructure, end-hosts and services. Such malicious elements can undermine the availability and fairness of networked systems. To deal with such nodes, we design and analyze protocols enabling their removal from the network in a fast and a secure way. We design these protocols for two different environments. In the former setting, we assume that there are multiple, but independent trusted points in the network which coordinate other nodes in the network. In the latter, we assume that all nodes play equal roles in the network and thus need to cooperate to carry out common functionality. We analyze these solutions and discuss possible deployment scenarios. Next we turn our attention to wireless edge networks. In this context, some nodes, without being malicious, can still behave in an unfair manner. To deal with the situation, we propose several self-penalty mechanisms. We implement the proposed protocols employing a commodity hardware and conduct experiments in real-world environments. The analysis of data collected in several measurement rounds revealed improvements in terms of higher fairness and throughput. We corroborate the results with simulations and an analytic model. And finally, we discuss how to measure fairness in dynamic settings, where nodes can have heterogeneous resource demands