An RF-Isolated Real-Time Multipath Testbed for Performance Analysis of WLANs

Real-time performance evaluation of wireless local area networks (WLANs) is an extremely challenging topic. The major drawback of real-time performance analysis in actual network installations is a lack of repeatability due to uncontrollable interference and propagation complexities. These are caused by unpredictable variations in the interference scenarios and statistical behavior of the wireless propagation channel. This underscores the need for a Radio Frequency (RF) test platform that provides isolation from interfering sources while simulating a real-time wireless channel, thereby creating a realistic and controllable radio propagation test environment. Such an RF-isolated testbed is necessary to enable an empirical yet repeatable evaluation of the effects of the wireless channel on WLAN performance. In this thesis, a testbed is developed that enables real-time laboratory performance evaluation of WLANs. This testbed utilizes an RF-isolated test system, Azimuthâ„¢ Systems 801W, for isolation from external interfering sources such as cordless phones and microwave ovens and a real-time multipath channel simulator, Elektrobit PROPSimâ„¢ C8, for wireless channel emulation. A software protocol analyzer, WildPackets Airopeek NX, is used to capture data packets in the testbed from which statistical data characterizing performance such as data rate and Received Signal Strength (RSS) are collected. The relationship between the wireless channel and WLAN performance, under controlled propagation and interference conditions, is analyzed using this RF-isolated multipath testbed. Average throughput and instantaneous throughput variation of IEEE 802.11b and 802.11g WLANs operating in four different channels - a constant channel and IEEE 802.11 Task Group n (TGn) Channel Models A, B, and C - are examined. Practical models describing the average throughput as a function of the average received power and throughput variation as a function of the average throughput under different propagation conditions are presented. Comprehensive throughput models that incorporate throughput variation are proposed for the four channels using Weibull and Gaussian probability distributions. These models provide a means for realistic simulation of throughput for a specific channel at an average received power. Also proposed is a metric to describe the normalized throughput capacity of WLANs for comparative performance evaluation

Advanced Wireless LAN

The past two decades have witnessed starling advances in wireless LAN technologies that were stimulated by its increasing popularity in the home due to ease of installation, and in commercial complexes offering wireless access to their customers. This book presents some of the latest development status of wireless LAN, covering the topics on physical layer, MAC layer, QoS and systems. It provides an opportunity for both practitioners and researchers to explore the problems that arise in the rapidly developed technologies in wireless LAN

Contention techniques for opportunistic communication in wireless mesh networks

Auf dem Gebiet der drahtlosen Kommunikation und insbesondere auf den tieferen Netzwerkschichten sind gewaltige Fortschritte zu verzeichnen. Innovative Konzepte und Technologien auf der physikalischen Schicht (PHY) gehen dabei zeitnah in zelluläre Netze ein. Drahtlose Maschennetzwerke (WMNs) können mit diesem Innovationstempo nicht mithalten. Die Mehrnutzer-Kommunikation ist ein Grundpfeiler vieler angewandter PHY Technologien, die sich in WMNs nur ungenügend auf die etablierte Schichtenarchitektur abbilden lässt. Insbesondere ist das Problem des Scheduling in WMNs inhärent komplex. Erstaunlicherweise ist der Mehrfachzugriff mit Trägerprüfung (CSMA) in WMNs asymptotisch optimal obwohl das Verfahren eine geringe Durchführungskomplexität aufweist. Daher stellt sich die Frage, in welcher Weise das dem CSMA zugrunde liegende Konzept des konkurrierenden Wettbewerbs (engl. Contention) für die Integration innovativer PHY Technologien verwendet werden kann. Opportunistische Kommunikation ist eine Technik, die die inhärenten Besonderheiten des drahtlosen Kanals ausnutzt. In der vorliegenden Dissertation werden CSMA-basierte Protokolle für die opportunistische Kommunikation in WMNs entwickelt und evaluiert. Es werden dabei opportunistisches Routing (OR) im zustandslosen Kanal und opportunistisches Scheduling (OS) im zustandsbehafteten Kanal betrachtet. Ziel ist es, den Durchsatz von elastischen Paketflüssen gerecht zu maximieren. Es werden Modelle für Überlastkontrolle, Routing und konkurrenzbasierte opportunistische Kommunikation vorgestellt. Am Beispiel von IEEE 802.11 wird illustriert, wie der schichtübergreifende Entwurf in einem Netzwerksimulator prototypisch implementiert werden kann. Auf Grundlage der Evaluationsresultate kann der Schluss gezogen werden, dass die opportunistische Kommunikation konkurrenzbasiert realisierbar ist. Darüber hinaus steigern die vorgestellten Protokolle den Durchsatz im Vergleich zu etablierten Lösungen wie etwa DCF, DSR, ExOR, RBAR und ETT.In the field of wireless communication, a tremendous progress can be observed especially at the lower layers. Innovative physical layer (PHY) concepts and technologies can be rapidly assimilated in cellular networks. Wireless mesh networks (WMNs), on the other hand, cannot keep up with the speed of innovation at the PHY due to their flat and decentralized architecture. Many innovative PHY technologies rely on multi-user communication, so that the established abstraction of the network stack does not work well for WMNs. The scheduling problem in WMNs is inherent complex. Surprisingly, carrier sense multiple access (CSMA) in WMNs is asymptotically utility-optimal even though it has a low computational complexity and does not involve message exchange. Hence, the question arises whether CSMA and the underlying concept of contention allows for the assimilation of advanced PHY technologies into WMNs. In this thesis, we design and evaluate contention protocols based on CSMA for opportunistic communication in WMNs. Opportunistic communication is a technique that relies on multi-user diversity in order to exploit the inherent characteristics of the wireless channel. In particular, we consider opportunistic routing (OR) and opportunistic scheduling (OS) in memoryless and slow fading channels, respectively. We present models for congestion control, routing and contention-based opportunistic communication in WMNs in order to maximize both throughput and fairness of elastic unicast traffic flows. At the instance of IEEE 802.11, we illustrate how the cross-layer algorithms can be implemented within a network simulator prototype. Our evaluation results lead to the conclusion that contention-based opportunistic communication is feasible. Furthermore, the proposed protocols increase both throughput and fairness in comparison to state-of-the-art approaches like DCF, DSR, ExOR, RBAR and ETT

Performance issues in cellular wireless mesh networks

This thesis proposes a potential solution for future ubiquitous broadband wireless access networks, called a cellular wireless mesh network (CMESH), and investigates a number of its performance issues. A CMESH is organized in multi-radio, multi-channel, multi-rate and multi-hop radio cells. It can operate on abundant high radio frequencies, such as 5-50 GHz, and thus may satisfy the bandwidth requirements of future ubiquitous wireless applications. Each CMESH cell has a single Internet-connected gateway and serves up to hundreds of mesh nodes within its coverage area. This thesis studies performance issues in a CMESH, focusing on cell capacity, expressed in terms of the max-min throughput. In addition to introducing the concept of a CMESH, this thesis makes the following contributions. The first contribution is a new method for analyzing theoretical cell capacity. This new method is based on a new concept called Channel Transport Capacity (CTC), and derives new analytic expressions for capacity bounds for carrier-sense-based CMESH cells. The second contribution is a new algorithm called the Maximum Channel Collision Time (MCCT) algorithm and an expression for the nominal capacity of CMESH cells. This thesis proves that the nominal cell capacity is achievable and is the exact cell capacity for small cells within the abstract models. Finally, based on the MCCT algorithm, this thesis proposes a series of greedy algorithms for channel assignment and routing in CMESH cells. Simulation results show that these greedy algorithms can significantly improve the capacity of CMESH cells, compared with algorithms proposed by other researchers

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

Scalable and rate adaptive wireless multimedia multicast

The methods that are described in this work enable highly efficient audio-visual streaming over wireless digital communication systems to an arbitrary number of receivers. In the focus of this thesis is thus point-to-multipoint transmission at constrained end-to-end delay. A fundamental difference as compared to point-to-point connections between exactly two communicating sending and receiving stations is in conveying information about successful or unsuccessful packet reception at the receiver side. The information to be transmitted is available at the sender, whereas the information about successful reception is only available to the receiver. Therefore, feedback about reception from the receiver to the sender is necessary. This information may be used for simple packet repetition in case of error, or adaptation of the bit rate of transmission to the momentary bit rate capacity of the channel, or both. This work focuses on the single transmission (including retransmissions) of data from one source to multiple destinations at the same time. A comparison with multi-receiver sequentially redundant transmission systems (simulcast MIMO) is made. With respect to feedback, this work considers time division multiple access systems, in which a single channel is used for data transmission and feedback. Therefore, the amount of time that can be spent for transmitting feedback is limited. An increase in time used for feedback transmissions from potentially many receivers results in a decrease in residual time which is usable for data transmission. This has direct impact on data throughput and hence, the quality of service. In the literature, an approach to reduce feedback overhead which is based on simultaneous feedback exists. In the scope of this work, simultaneous feedback implies equal carrier frequency, bandwidth and signal shape, in this case orthogonal frequency-division multiplex signals, during the event of the herein termed feedback aggregation in time. For this scheme, a constant amount of time is spent for feedback, independent of the number of receivers giving feedback about reception. Therefore, also data throughput remains independent of the number of receivers. This property of audio-visual digital transmission is taken for granted for statically configured, single purpose systems, such as terrestrial television. In the scope of this work are, however, multi-user and multi-purpose digital communication networks. Wireless LANs are a well-known example and are covered in detail herein. In suchlike systems, it is of great importance to remain independent of the number of receivers, as otherwise the service of ubiquitous digital connectivity is at the risk of being degraded. In this regard, the thesis at hand elaborates at what bit rates audio-visual transmission to multiple receivers may take place in conjunction with feedback aggregation. It is shown that the scheme achieves a multi-user throughput gain when used in conjunction with adaptivity of the bit rate to the channel. An assumption is the use of an ideal overlay packet erasure correcting code in this case. Furthermore, for delay constrained transmission, such as in so-called live television, throughput bit rates are examined. Applications have to be tolerant to a certain level of residual error in case of delay constrained transmission. Improvement of the rate adaptation algorithm is shown to increase throughput while residual error rates are decreased. Finally, with a consumer hardware prototype for digital live-TV re-distribution in the local wireless network, most of the mechanisms as described herein can be demonstrated.Die in vorliegender Arbeit aufgezeigten Methoden der paketbasierten drahtlosen digitalen Kommunikation ermöglichen es, Fernsehinhalte, aber auch audio-visuelle Datenströme im Allgemeinen, bei hoher Effizienz an beliebig große Gruppen von Empfängern zu verteilen. Im Fokus dieser Arbeit steht damit die Punkt- zu Mehrpunktübertragung bei begrenzter Ende-zu-Ende Verzögerung. Ein grundlegender Unterschied zur Punkt-zu-Punkt Verbindung zwischen genau zwei miteinander kommunizierenden Sender- und Empfängerstationen liegt in der Übermittlung der Information über erfolgreichen oder nicht erfolgreichen Paketempfang auf Seite der Empfänger. Da die zu übertragende Information am Sender vorliegt, die Information über den Erfolg der Übertragung jedoch ausschließlich beim jeweiligen Empfänger, muss eine Erfolgsmeldung auf dem Rückweg von Empfänger zu Sender erfolgen. Diese Information wird dann zum Beispiel zur einfachen Paketwiederholung im nicht erfolgreichen Fall genutzt, oder aber um die Übertragungsrate an die Kapazität des Kanals anzupassen, oder beides. Grundsätzlich beschäftigt sich diese Arbeit mit der einmaligen, gleichzeitigen Übertragung von Information (einschließlich Wiederholungen) an mehrere Empfänger, wobei ein Vergleich zu an mehrere Empfänger sequentiell redundant übertragenden Systemen (Simulcast MIMO) angestellt wird. In dieser Arbeit ist die Betrachtung bezüglich eines Rückkanals auf Zeitduplexsysteme beschränkt. In diesen Systemen wird der Kanal für Hin- und Rückweg zeitlich orthogonalisiert. Damit steht für die Übermittlung der Erfolgsmeldung eine beschränkte Zeitdauer zur Verfügung. Je mehr an Kanalzugriffszeit für die Erfolgsmeldungen der potentiell vielen Empfänger verbraucht wird, desto geringer wird die Restzeit, in der dann entsprechend weniger audio-visuelle Nutzdaten übertragbar sind, was sich direkt auf die Dienstqualität auswirkt. Ein in der Literatur weniger ausführlich betrachteter Ansatz ist die gleichzeitige Übertragung von Rückmeldungen mehrerer Teilnehmer auf gleicher Frequenz und bei identischer Bandbreite, sowie unter Nutzung gleichartiger Signale (hier: orthogonale Frequenzmultiplexsignalformung). Das Schema wird in dieser Arbeit daher als zeitliche Aggregation von Rückmeldungen, engl. feedback aggregation, bezeichnet. Dabei wird, unabhängig von der Anzahl der Empfänger, eine konstante Zeitdauer für Rückmeldungen genutzt, womit auch der Datendurchsatz durch zusätzliche Empfänger nicht notwendigerweise sinkt. Diese Eigenschaft ist aus statisch konfigurierten und für einen einzigen Zweck konzipierten Systemen, wie z. B. der terrestrischen Fernsehübertragung, bekannt. In dieser Arbeit werden im Gegensatz dazu jedoch am Beispiel von WLAN Mehrzweck- und Mehrbenutzersysteme betrachtet. Es handelt sich in derartigen Systemen zur digitalen Datenübertragung dabei um einen entscheidenden Vorteil, unabhängig von der Empfängeranzahl zu bleiben, da es sonst unweigerlich zu Einschränkungen in der Güte der angebotenen Dienstleistung der allgegenwärtigen digitalen Vernetzung kommen muss. Vorliegende Arbeit zeigt in diesem Zusammenhang auf, welche Datenraten unter Benutzung von feedback aggregation in der Verteilung an mehrere Empfänger und in verschiedenen Szenarien zu erreichen sind. Hierbei zeigt sich, dass das Schema im Zusammenspiel mit einer Adaption der Datenrate an den Übertragungskanal inhärent einen Datenratengewinn durch Mehrbenutzerempfang zu erzielen vermag, wenn ein überlagerter idealer Paketauslöschungsschutz-Code angenommen wird. Des weiteren wird bei der Übertragung mit zeitlich begrenzter Ausführungsdauer, z. B. dem sogenannten Live-Fernsehen, aufgezeigt, wie sich die erreichbare Datenrate reduziert und welche Restfehlertoleranz an die Übertragung gestellt werden muss. Hierbei wird ebenso aufgezeigt, wie sich durch Verbesserung der Ratenadaption erstere erhöhen und zweitere verringern lässt. An einem auf handelsüblichen Computer-Systemen realisiertem Prototypen zur Live-Fernsehübertragung können die hierin beschriebenen Mechanismen zu großen Teilen gezeigt werden