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

Decentralized Delay Optimal Control for Interference Networks with Limited Renewable Energy Storage

In this paper, we consider delay minimization for interference networks with renewable energy source, where the transmission power of a node comes from both the conventional utility power (AC power) and the renewable energy source. We assume the transmission power of each node is a function of the local channel state, local data queue state and local energy queue state only. In turn, we consider two delay optimization formulations, namely the decentralized partially observable Markov decision process (DEC-POMDP) and Non-cooperative partially observable stochastic game (POSG). In DEC-POMDP formulation, we derive a decentralized online learning algorithm to determine the control actions and Lagrangian multipliers (LMs) simultaneously, based on the policy gradient approach. Under some mild technical conditions, the proposed decentralized policy gradient algorithm converges almost surely to a local optimal solution. On the other hand, in the non-cooperative POSG formulation, the transmitter nodes are non-cooperative. We extend the decentralized policy gradient solution and establish the technical proof for almost-sure convergence of the learning algorithms. In both cases, the solutions are very robust to model variations. Finally, the delay performance of the proposed solutions are compared with conventional baseline schemes for interference networks and it is illustrated that substantial delay performance gain and energy savings can be achieved

Eligible earliest deadline first:Server-based scheduling for master-slave industrial wireless networks

Industrial automation and control systems are increasingly deployed using wireless networks in master-slave, star-type configurations that employ a slotted timeline schedule. In this paper, the scheduling of (re)transmissions to meet real-time constraints in the presence of non-uniform interference in such networks is considered. As packet losses often occur in correlated bursts, it is often useful to insert gaps before attempting retransmissions. In this paper, a quantum Earliest Deadline First (EDF) scheduling framework entitled ‘Eligible EDF’ is suggested for assigning (re)transmissions to available timeline slots by the master node. A simple but effective server strategy is introduced to reclaim unused channel utilization and replenish failed slave transmissions, a strategy which prevents cascading failures and naturally introduces retransmission gaps. Analysis and examples illustrate the effectiveness of the proposed method. Specifically, the proposed framework gives a timely throughput of 99.81% of the timely throughput that is optimally achievable using a clairvoyant scheduler

An adaptable fuzzy-based model for predicting link quality in robot networks.

It is often essential for robots to maintain wireless connectivity with other systems so that commands, sensor data, and other situational information can be exchanged. Unfortunately, maintaining sufficient connection quality between these systems can be problematic. Robot mobility, combined with the attenuation and rapid dynamics associated with radio wave propagation, can cause frequent link quality (LQ) issues such as degraded throughput, temporary disconnects, or even link failure. In order to proactively mitigate such problems, robots must possess the capability, at the application layer, to gauge the quality of their wireless connections. However, many of the existing approaches lack adaptability or the framework necessary to rapidly build and sustain an accurate LQ prediction model. The primary contribution of this dissertation is the introduction of a novel way of blending machine learning with fuzzy logic so that an adaptable, yet intuitive LQ prediction model can be formed. Another significant contribution includes the evaluation of a unique active and incremental learning framework for quickly constructing and maintaining prediction models in robot networks with minimal sampling overhead