Smoothing and Learning for Movement-Robust RSS-Based Spoofing Detection

Physical-layer spoofing detection identifies an attacker who impersonates a legitimate wireless user by checking whether transmissions claiming the same identity originate from different locations, using the received signal strength (RSS) measured at several receivers. A recent scheme by Romero et al. makes this approach robust to user movement by combining a neural-network position-change detector (PCD) with community detection on a graph of frames and a fixed threshold on a hand-crafted test statistic. I study two modifications to this scheme. First, I smooth the sequence of PCD scores with a median or Gaussian temporal filter before thresholding. Second, I replace the fixed decision threshold with a supervised classifier operating on six statistical features of the region sequence produced by community detection. On real indoor RSS measurements from 52 transmitter locations, Gaussian filtering raises PCD accuracy from 0.870 to 0.921 when the PCD is trained on 10 locations and from 0.905 to 0.925 when trained on 40. On synthetic attack and no-attack sequences built from the same measurements, evaluated on a held-out test set of 1,679 sequences, the best classifier (XGBoost) reaches an accuracy of 0.949 and an F1 score of 0.940, and random forests reach an AUC of 0.99. The detector separates static attackers almost perfectly but misses about a third of attacks in which two transmitters move simultaneously, which produce region sequences similar to those of a single moving user.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.23854
Primary Topic
Adversarial Robustness in Machine Learning
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Smoothing and Learning for Movement-Robust RSS-Based Spoofing Detection

Usama Mir
arXiv (Cornell University)
Adversarial Robustness in Machine Learning
preprint

Smoothing and Learning for Movement-Robust RSS-Based Spoofing Detection

Usama Mir
preprint en

Abstract

Physical-layer spoofing detection identifies an attacker who impersonates a legitimate wireless user by checking whether transmissions claiming the same identity originate from different locations, using the received signal strength (RSS) measured at several receivers. A recent scheme by Romero et al. makes this approach robust to user movement by combining a neural-network position-change detector (PCD) with community detection on a graph of frames and a fixed threshold on a hand-crafted test statistic. I study two modifications to this scheme. First, I smooth the sequence of PCD scores with a median or Gaussian temporal filter before thresholding. Second, I replace the fixed decision threshold with a supervised classifier operating on six statistical features of the region sequence produced by community detection. On real indoor RSS measurements from 52 transmitter locations, Gaussian filtering raises PCD accuracy from 0.870 to 0.921 when the PCD is trained on 10 locations and from 0.905 to 0.925 when trained on 40. On synthetic attack and no-attack sequences built from the same measurements, evaluated on a held-out test set of 1,679 sequences, the best classifier (XGBoost) reaches an accuracy of 0.949 and an F1 score of 0.940, and random forests reach an AUC of 0.99. The detector separates static attackers almost perfectly but misses about a third of attacks in which two transmitters move simultaneously, which produce region sequences similar to those of a single moving user.

arXiv (Cornell University)
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon