Client-side rogue access-point detection using a simple walking strategy and round-trip time analysis
| Autor: | Aphirak Jansang, Songrit Kitisriworapan, Anan Phonphoem |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
WLAN security
021110 strategic defence & security studies Wireless intrusion detection Computer Networks and Communications Rogue access point Computer science Real-time computing ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS lcsh:Electronics 0211 other engineering and technologies Evil twin lcsh:TK7800-8360 020206 networking & telecommunications 02 engineering and technology Round-trip delay time Client-side Computer Science Applications lcsh:Telecommunication lcsh:TK5101-6720 Signal Processing 0202 electrical engineering electronic engineering information engineering Rogue access-point detection Mobile device |
| Zdroj: | EURASIP Journal on Wireless Communications and Networking, Vol 2020, Iss 1, Pp 1-24 (2020) |
| ISSN: | 1687-1499 |
| Popis: | Traditional rogue access-point (AP) detection mechanisms are employed in network administration to protect network infrastructure and organization; however, these mechanisms do not protect end users from connecting to a rogue-AP. In this paper, a rogue-AP detection technique on the mobile-user side is proposed. By using a simple method involving walking, the round-trip time (RTT) and the modulation and coding scheme values are obtained, and a more accurate transmission rate for particular RTT values is thereby calculated. Further, the cleansed data are classified using the k-means method and the cumulative distribution function for the detection process. The results demonstrate that a rogue-AP can be detected with an F-measure value of up to 0.9. In the future, the proposed algorithm can be implemented as an application installed on mobile devices so that nontechnical users can detect rogue-APs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |