Hidden Terminal Detection in Wide-Area 802.11 Wireless Networks

The hidden terminal problem is an important issue in wireless networks based on the CSMA medium access control scheme. Hidden terminals pose a complex challenge to network operators trying to identify the underlying cause of performance issues. This thesis describes new methods for the detection and measurement of the hidden terminal problem in wireless networks based on commodity hardware and software platforms. These new methods allow network operators to identify areas of a network where hidden terminals are likely to exist; detect instances of the hidden terminal problem occurring; and estimate the total impact hidden terminals are having on the performance of the network. A new framework for measurement of wireless networks is described which provides a new approach to wireless measurement on Linux based wireless routers. The new framework is used to implement the methods and they are deployed across an operational commercial wireless network and are shown to be useful

Can User-Level Probing Detect and Diagnose Common Home-WLAN Pathologies?

Common WLAN pathologies include low signal-to-noise ratio, congestion, hidden terminals or interference from non-802.11 devices and phenomena. Prior work has focused on the detection and diagnosis of such problems using layer-2 information from 802.11 devices and special-purpose access points and monitors, which may not be generally available. Here, we investigate a userlevel approach: is it possible to detect and diagnose 802.11 pathologies with strictly user-level active probing, without any cooperation from, and without any visibility in, layer-2 devices? In this paper, we present preliminary but promising results indicating that such diagnostics are feasible

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

How Penalty Leads to Improvement: a Measurement Study of Wireless Backoff

Despite much theoretical work, different modifications of backoff protocols in 802.11 networkslack empirical evidence demonstrating their real-life performance. To fill the gap we have set out to experiment with performance of exponential backoff by varying its backoff factor. Despite the satisfactory results for throughput, we have witnessed poor fairness manifesting in severe capture effect. The design of standard backoff protocol allows already successful nodes to remain successful, giving little chance to those nodes that failed to capture the channel in the beginning. With this at hand, we ask a conceptual question: Can one improve the performance of wireless backoff by introducing a mechanism of self-penalty, when overly successful nodes are penalized with big contention windows? Our real-life measurements using commodity hardware demonstrate that in many settings such mechanism not only allows to achieve better throughput, but also assures nearly perfect fairness. We further corroborate these results with simulations and an analytical model. Finally, we present a backoff factor selection protocol which can beimplemented in access points to enable deployment of the penalty backoff protocol to consumer devices.Non Peer reviewe

Design and Evaluation of Primitives for Passive Link Assessment and Route Selection in Static Wireless Networks

Communication in wireless networks elementally comprises of packet exchanges over individual wireless links and routes formed by these links. To this end, two problems are fundamental: assessment of link quality and identification of the least-cost (optimal) routes. However, little is known about achieving these goals without incurring additional overhead to IEEE 802.11 networks. In this thesis, I design and experimentally evaluate two frameworks that enable individual 802.11 nodes to characterize their wireless links and routes by employing only local and passively collected information. First, I enable 802.11 nodes to assess their links by characterizing packet delivery failures and failure causes. The key problem is that nodes cannot individually observe many factors that affect the packet delivery at both ends of their links and in both directions of 802.11 communication. To this end, instead of relying on the assistance of other nodes, I design the first practical framework that extrapolates the missing information locally from the nodes' overhearing, the observable causal relationships of 802.11 operation and characterization of the corrupted and undecodable packets. The proposed framework employs only packet-level information generally reported by commodity 802.11 wireless cards. Next, I design and evaluate routing primitives that enable individual nodes to suppress their poor route selections. I refer to a route selection as poor whenever the employed routing protocol fails to establish the existing least-cost path according to an employed routing metric. This thesis shows that an entire family of the state-of-the art on-demand distance-vector routing protocols, including the standards-proposed protocol for IEEE 802.11s mesh networks, suffers from frequent and long-term poor selections having arbitrary path costs. Consequently, such selections generally induce severe throughput degradations for network users. To address this problem, I design mechanisms that identify optimal paths locally by employing only the information readily available to the affected nodes. The proposed mechanisms largely suppress occurrence of inferior routes. Even when such routes are selected their durations are reduced by several orders of magnitude, often to sub-second time scales. My work has implications on several key areas of wireless networking: It removes systematic failures from wireless routing and serves as a source of information for a wide range of protocols including the protocols for network management and diagnostics

Investigating TCP performance in mobile ad hoc networks

Mobile ad hoc networks (MANETs) have become increasingly important in view of their promise of ubiquitous connectivity beyond traditional fixed infrastructure networks. Such networks, consisting of potentially highly mobile nodes, have provided new challenges by introducing special consideration stemming from the unique characteristics of the wireless medium and the dynamic nature of the network topology. The TCP protocol, which has been widely deployed on a multitude of internetworks including the Internet, is naturally viewed as the de facto reliable transport protocol for use in MANETs. However, assumptions made at TCP’s inception reflected characteristics of the prevalent wired infrastructure of networks at the time and could subsequently lead to sub-optimal performance when used in wireless ad hoc environments. The basic presupposition underlying TCP congestion control is that packet losses are predominantly an indication of congestion in the network. The detrimental effect of such an assumption on TCP’s performance in MANET environments has been a long-standing research problem. Hence, previous work has focused on addressing the ambiguity behind the cause of packet loss as perceived by TCP by proposing changes at various levels across the network protocol stack, such as at the MAC mechanism of the transceiver or via coupling with the routing protocol at the network layer. The main challenge addressed by the current work is to propose new methods to ameliorate the illness-effects of TCP’s misinterpretation of the causes of packet loss in MANETs. An assumed restriction on any proposed modifications is that resulting performance increases should be achievable by introducing limited changes confined to the transport layer. Such a restriction aids incremental adoption and ease of deployment by requiring minimal implementation effort. Further, the issue of packet loss ambiguity, from a transport layer perspective, has, by definition, to be dealt with in an end-to-end fashion. As such, a proposed solution may involve implementation at the sender, the receiver or both to address TCP shortcomings. Some attempts at describing TCP behaviour in MANETs have been previously reported in the literature. However, a thorough enquiry into the performance of those TCP agents popular in terms of research and adoption has been lacking. Specifically, very little work has been performed on an exhaustive analysis of TCP variants across different MANET routing protocols and under various mobility conditions. The first part of the dissertation addresses this shortcoming through extensive simulation evaluation in order to ascertain the relative performance merits of each TCP variant in terms of achieved goodput over dynamic topologies. Careful examination reveals sub-par performance of TCP Reno, the largely equivalent performance of NewReno and SACK, whilst the effectiveness of a proactive TCP variant (Vegas) is explicitly stated and justified for the first time in a dynamic MANET environment. Examination of the literature reveals that in addition to losses caused by route breakages, the hidden terminal effect contributes significantly to non-congestion induced packet losses in MANETs, which in turn has noticeably negative impact on TCP goodput. By adapting the conservative slow start mechanism of TCP Vegas into a form suitable for reactive TCP agents, like Reno, NewReno and SACK, the second part of the dissertation proposes a new Reno-based congestion avoidance mechanism which increases TCP goodput considerably across long paths by mitigating the negative effects of hidden terminals and alleviating some of the ambiguity of non-congestion related packet loss in MANETs. The proposed changes maintain intact the end-to-end semantics of TCP and are solely applicable to the sender. The new mechanism is further contrasted with an existing transport layer-focused solution and is shown to perform significantly better in a range of dynamic scenarios. As solution from an end-to-end perspective may be applicable to either or both communicating ends, the idea of implementing receiver-side alterations is also explored. Previous work has been primarily concerned with reducing receiver-generated cumulative ACK responses by “bundling” them into as few packets as possible thereby reducing misinterpretations of packet loss due to hidden terminals. However, a thorough evaluation of such receiver-side solutions reveals limitations in common evaluation practices and the solutions themselves. In an effort to address this shortcoming, the third part of this research work first specifies a tighter problem domain, identifying the circumstances under which the problem may be tackled by an end-to-end solution. Subsequent original analysis reveals that by taking into account optimisations possible in wireless communications, namely the partial or complete omission of the RTS/CTS handshake, noticeable improvements in TCP goodput are achievable especially over long paths. This novel modification is activated in a variety of topologies and is assessed using new metrics to more accurately gauge its effectiveness in a wireless multihop environment

Experimental analysis of connectivity management in mobile operating systems

We are immerse in a world that becomes more and more mobile every day, with ubiquitous connectivity and increasing demand for mobile services. Current mobile terminals support several access technologies, enabling users to gain connectivity in a plethora of scenarios and favoring their mobility. However, the management of network connectivity using multiple interfaces is still starting to be deployed. The lack of smart connectivity management in multi interface devices forces applications to be explicitly aware of the variations in the connectivity state (changes in active interface, simultaneous access from several interfaces, etc.). In this paper, we analyze the present state of the connection management and handover capabilities in the three major mobile operating systems (OSes): Android, iOS and Windows. To this aim, we conduct a thorough experimental study on the connectivity management of each operating system, including several versions of the OS on different mobile terminals, analyzing the differences and similarities between them. Moreover, in order to assess how mobility is handled and how this can affect the final user, we perform an exhaustive experimental analysis on application behavior in intra- and inter-technology handover. Based on this experience, we identify open issues in the smartphone connectivity management policies and implementations, highlighting easy to deploy yet unimplemented improvements, as well as potential integration of mobility protocols.This work has been partially supported by the European Community through the CROWD project, FP7-ICT-318115.Publicad