Large-Scale 802.11 Wireless Networks Data Analysis Based on Graph Clustering
- 21 April 2021
- journal article
- research article
- Published by Springer Nature in Wireless Personal Communications
- Vol. 120 (2) , 1791-1819
Abstract
This paper analyzes a large-scale dataset of real-world Wi-Fi operating networks, collected from more than 9,000 access points (APs) for 1 year. The APs are distributed among more than 1,200 educational centers in the context of a nation-wide one-to-one computing program, being most of them primary and secondary schools. The data corresponds to RSSI measurements between APs used to build the conflict graphs for each school Wi-Fi network. We propose a simple embedding for the Wi-Fi network conflict graphs based on classical graph features, which proves to be useful to analyze the behavior of the wireless networks, showing a high discrimination power among the different school networks. Moreover, we discuss some practical applications of the embedding. In particular, it enables to study the Wi-Fi network dynamics at each school, analyzing the conflict graphs temporal variations through clustering techniques. The presented methodology allows us to successfully separate the most stable scenarios from those with more significant variability, which therefore require more technical resources to optimize the network. Besides, we also compared the behaviour of the Wi-Fi networks of the different schools, which enable us to reuse the optimal configuration found for one school in all those sites that have similar conflict graph patterns.Keywords
Funding Information
- Agencia Nacional de Investigación e Innovación (FMV 3 2018 1 148149)
This publication has 43 references indexed in Scilit:
- A group-based channel assignment protocol for rate separation in IEEE 802.11-based multi-radio multi-rate ad hoc networksAd Hoc Networks, 2012
- A survey of cross-layer design for VANETsAd Hoc Networks, 2011
- A topology control approach for utilizing multiple channels in multi-radio wireless mesh networksComputer Networks, 2010
- An admission control algorithm for multi-hop 802.11e-based WLANsComputer Communications, 2008
- Classical coloring of graphs2004
- Estimating the Number of Clusters in a Data Set Via the Gap StatisticJournal of the Royal Statistical Society Series B: Statistical Methodology, 2001
- Trimmed $k$-means: an attempt to robustify quantizersThe Annals of Statistics, 1997
- Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive surveyIEEE Wireless Communications, 1996
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- Silhouettes: A graphical aid to the interpretation and validation of cluster analysisJournal of Computational and Applied Mathematics, 1987