Literature Database Entry

pusch2025passive


Lorenz Julius Pusch, Anatolij Zubow and Falko Dressler, "Passive Detection of Fat Users in WiFi Networks using Thompson Sampling," Proceedings of 23rd Mediterranean Communication and Computer Networking Conference (MedComNet 2025), Cagliari, Italy, June 2025. (to appear)


Abstract

The user experience in large WiFi networks, such as those on university campuses, can be greatly enhanced by monitoring user activity. Early detection of high-bandwidth users, often called fat users, who consume substantial radio resources, can help prevent the formation of network hotspots. This enables both short-term measures, such as traffic shaping, and long-term solutions, like deploying additional access points. In this paper, we present a fully passive method for detecting fat users in WiFi networks that requires no modifications to existing WiFi infrastructure. Our approach employs multiple WiFi interfaces to passively capture WiFi traffic over the air, with channel hopping managed intelligently through a Multi-Armed Bandit framework using a modified Thompson Sampling algorithm. This technique allows effective monitoring of a broad radio spectrum, even with a limited number of interfaces. Simulation results and real-world experiments demonstrate the feasibility of this approach in both stationary and non-stationary network environments.

Quick access

BibTeX BibTeX

Contact

Lorenz Julius Pusch
Anatolij Zubow
Falko Dressler

BibTeX reference

@inproceedings{pusch2025passive,
    author = {Pusch, Lorenz Julius and Zubow, Anatolij and Dressler, Falko},
    note = {to appear},
    title = {{Passive Detection of Fat Users in WiFi Networks using Thompson Sampling}},
    publisher = {IEEE},
    address = {Cagliari, Italy},
    booktitle = {23rd Mediterranean Communication and Computer Networking Conference (MedComNet 2025)},
    month = {6},
    year = {2025},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.