scispace - formally typeset
Proceedings ArticleDOI

Deconstructing Interference Relations in WiFi Networks

Reads0
Chats0
TLDR
This work model the 802.11 MAC as a Hidden Markov Model (HMM), and uses a machine learning approach to learn the state transition probabilities in this model using the observed trace, and coupled with an estimation of collision probabilities helps to deduce the interference relationships.
Abstract
Wireless interference is the major cause of degradation of capacity in 802.11 wireless networks. We present an approach to estimate the interference between nodes and links in a live wireless network by passive monitoring of wireless traffic. This does not require any controlled experiments, injection of probe traffic in the network, or even access to the network nodes. Our approach requires deploying multiple sniffers across the network to capture wireless traffic traces. These traces are then analyzed to infer the interference relations between nodes and links. We model the 802.11 MAC as a Hidden Markov Model (HMM), and use a machine learning approach to learn the state transition probabilities in this model using the observed trace. This coupled with an estimation of collision probabilities helps us to deduce the interference relationships. We show the effectiveness of this method against simpler heuristics, and also a profiling-based method that requires active measurements. Experimental results demonstrate that the proposed approach is significantly more accurate than heuristics and quite competitive with active measurements. We also validate the approach in a real WLAN environment.

read more

Citations
More filters
Journal ArticleDOI

Passive Measurement of Interference in WiFi Networks with Application in Misbehavior Detection

TL;DR: Experimental and simulation results demonstrate that the proposed approach of estimating interference relations is significantly more accurate than simpler heuristics and quite competitive with active measurements.
Journal ArticleDOI

A Review of Software-Defined WLANs: Architectures and Central Control Mechanisms

TL;DR: In this article, the authors present an overview of SDWLAN architectures and provide a qualitative comparison in terms of features such as programmability and virtualization, and classify and investigate the two important classes of centralized network control mechanisms: 1) association control and 2) channel assignment.
Journal ArticleDOI

Experimenting With Commodity 802.11 Hardware: Overview and Future Directions

TL;DR: This paper reviews and categorises the most prevalent works carried out with 802.11 COTS devices over the past 15 years, to present a timely snapshot of the areas that have attracted the most attention so far, through a taxonomy that distinguishes between performance studies, enhancements, services, and methodology.
Proceedings ArticleDOI

Inferring and mitigating a link's hindering transmissions in managed 802.11 wireless networks

TL;DR: This paper presents a management framework called MIDAS (Management, Inference, and Diagnostics using Activity Share), which comprises an inference tool which infers the Activity Share by using a small set of passively collected, time-aggregate local channel measurements reported by the nodes.
Proceedings ArticleDOI

Buffer Sizing in 802.11 Wireless Mesh Networks

TL;DR: This paper proposes sizing link buffers collectively for a set of nodes within mutual interference range called the 'collision domain' to provide a buffer just large enough to saturate the available capacity of the bottleneck collision domain that limits the carryingcapacity of the network.
References
More filters
Journal ArticleDOI

A tutorial on hidden Markov models and selected applications in speech recognition

TL;DR: In this paper, the authors provide an overview of the basic theory of hidden Markov models (HMMs) as originated by L.E. Baum and T. Petrie (1966) and give practical details on methods of implementation of the theory along with a description of selected applications of HMMs to distinct problems in speech recognition.
Journal ArticleDOI

The capacity of wireless networks

TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Journal ArticleDOI

Performance analysis of the IEEE 802.11 distributed coordination function

TL;DR: In this paper, a simple but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions, is presented.
Journal ArticleDOI

An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology

TL;DR: In this paper, a polynomial with nonnegative coefficients homogeneous of degree d in its variables is shown to be polynomially homogeneous unless 3(3(x))>P(x), where 3(x)=x.
Related Papers (5)