ConceptioArchivearXiv CS
arXiv CSopen access

CITADEL: CSI-Based Jamming Detection and Open-Set Classification for IIoT Networks

Unknown · 2026 · arxiv_cs
arXiv CS · Papers · License: Open Access · 2026
Open Source ↗Direct PDF ↓
cryptography, security, privacy, cybersecurity

CITADEL: CSI-Based Jamming Detection and Open-Set Classification for IIoT Networks Aymen Bouferrouma , Ildi Allab , Valeria Loscria , Abderrahim Benslimanec , Vincent Lendersb a Inria Lille-Nord Europe, Lille, France

b University of Luxembourg, Luxembourg

c LIA/CERI, University of Avignon, Avignon, France

arXiv:2606.22939v1 [cs.CR] 22 Jun 2026

Abstract Radio frequency jamming poses a critical threat to the availability of wireless Industrial Internet of Things (IIoT) networks. Existing detection and classification techniques are poorly suited to this setting: coarse signal-strength and cross-layer features lack information richness, while raw I/Q baseband approaches require hardware and throughput that is impractical at the scale of hundred-node IIoT deployments. This paper presents CITADEL, a lightweight two-stage hierarchical pipeline that uses only Channel State Information (CSI) measurements, which are natively available on commodity IIoT devices, to detect and classify jamming attacks including previously unseen ones. While prior work has shown that jamming leaves observable CSI signatures, CITADEL is the first system to translate this insight into an end-to-end pipeline that jointly achieves closedset classification of known attacks, open-set detection of zero-day attacks, and resistance to adversarial evasion. Evaluated across 6 known attack types and 15 zero-day scenarios, CITADEL achieves 100% known-attack detection and 97.1% zero-day detection at a 0.4% end-to-end false positive rate. Under adversarial evaluation spanning white-box and black-box threat models, gradient-based evasion remains below 2% across all tested perturbation budgets and the strongest published CSI attack generator achieves less than 5% average evasion. A systematic comparison against eight baselines confirms that no existing method achieves comparable performance on CSI data across all three axes: detection, generalization, and robustness. The full pipeline completes inference in 14.2 ms at 95.9 mJ on an edge GPU, establishing CITADEL as a practical solution for large-scale IIoT network security.

Keywords Wi-Fi security, channel state information, jamming detection, adversarial robustness, out-of-distribution detection, edge computing

1

Introduction

Jamming has become a major threat to Industrial Internet of Things (IIoT) ecosystems that wirelessly interconnect sensors, mobile humanmachine interfaces, and condition-monitoring nodes alongside industrial control protocols [1–3]. The broadcast nature of the wireless medium means that any adversary within radio range can inject interference to disrupt legitimate transmissions [4, 5]. The widespread availability of low-cost commodity software-defined radios (SDRs), which can generate arbitrary waveforms with precise timing and frequency control [6], has dramatically lowered the barrier to mount such attacks, expanding both their sophistication and their variety.

RSS

Cross-Layer Features

Raw I/Q

Wi-Fi CSI

1 scalar / measurement

Hand-crafted features

Full baseband access

✔ Rich feature set ✘ Design-time signatures only ✘ No zero-day mechanism

✔ Max. information ✘ Requires dedicated SDR ✘ Not deployable on MCUs

52 subcarriers x 2 channels

✔ Any Wi-Fi Device ✘ No frequency selectivity ✘ Blind to partialband attacks

✔ Per-subcarrier magnitude + phase ✔ Commodity MCUs ✔ Physical-layer

Figure 1: Comparison of four physical-layer sensing modalities for jamming detection. CSI uniquely combines per-subcarrier spectral resolution with commodity microcontroller availability, offering the strongest trade-off between information and real-time deployment.

The consequences can be severe. In semiconductor fabrication, a jammed condition-monitoring sensor that fails to report abnormal vibration may delay a safety interlock, allowing equipment damage to propagate [7]. In chemical processing, masked telemetry can conceal a runaway exotherm until manual intervention is too late [8]. In autonomous logistics, disrupted control signals can halt conveyor systems or misroute automated guided vehicles [2, 9]. These are not hypothetical risks. They reflect the operational dependencies that make IIoT infrastructure an increasingly attractive target for adversaries. Jamming detection and classification systems exist to counter these threats, yet existing approaches are poorly suited to the IIoT setting. Techniques based on Received Signal Strength (RSS) reduce the entire wireless channel state to a single scalar per measurement, discarding all frequency-selective structure. Although RSS is universally available, it cannot distinguish jamming types, rendering it ineffective against partial-band and sweeping interference [10]. Cross-layer approaches aggregate protocol statistics into hand-crafted feature vectors, but these capture the symptoms of jamming rather than its physical signature, making them ill-suited to detect attacks specifically designed to evade detection [11–13]. Raw I/Q samples offer full baseband access and preserve maximal channel information, but they require dedicated SDR receivers that are incompatible with commodity microcontrollers and impractical for large-scale deployments where hundreds of low-cost sensor nodes must be monitored simultaneously [14]. Today, no existing technique jointly satisfies the information richness, hardware compatibility, and scalability requirements of real-world IIoT environments. Among physical-layer sensing modalities, Channel State Information (CSI) stands out as a compelling foundation for jamming detection in IIoT networks (see Figure 1). CSI captures per-subcarrier

Aymen Bouferroum et al.

Dual use ESP32

CSI

Time (s)

RF Jammer (SDR)

ESP32 ESP32

Conveyor

ESP32

Quick screening

Physical invariant: jamming perturbs CSI

CSI Vibration

PLC rack

Subcarriers

Subcarriers Time (s)

CSI

Temperature

Jammed

Normal

Wi-Fi AP

Motor current

Robotic arm

IIoT Factory Floor

RF Jamming Attack

Normal traffic

Suspicious GPU

Deep analysis

Known attack Zero-day anomaly Normal traffic

CITADEL Detection (Two-stage)

Figure 2: Deployment scenario. IIoT nodes extract per-subcarrier CSI from Wi-Fi frames, and an SDR jammer perturbs these measurements. Citadel detects attacks via a lightweight binary trigger on the nodes and a multi-signal ensemble on an edge GPU.

amplitude and phase across the OFDM frequency band, providing a spectrotemporal fingerprint far richer than aggregate metrics such as RSS, while remaining extractable at negligible cost from commodity Wi-Fi hardware, including microcontrollers, single-board computers, and off-the-shelf routers [15–17]. The physical invariant underlying CSI-based detection is that any RF-domain attack inevitably perturbs these measurements. An attacker cannot jam a link without adding energy that manifests in subcarrier magnitudes, phases, or both [6, 18]. Yet no prior work has translated this observation into a system that simultaneously achieves closed-set classification of known attacks, open-set detection of zero-day attacks, and resilience to adversarial evasion within the computational constraints of IIoT deployments. These requirements motivate four research questions that guide the design and evaluation of this work: RQ1 (Input sufficiency): Does CSI carry sufficient discriminative information to detect physical-layer jamming, or does reliable detection require richer input modalities? RQ2 (Zero-day generalization): Can a CSI-based detector identify previously unseen jamming strategies without any zero-day data during model training or threshold calibration? RQ3 (Adversarial resilience): Can such a detector withstand adversarial evasion attacks under physically realizable perturbation constraints? RQ4 (Edge deployment): Can the detection pipeline operate in real time on commodity microcontrollers and edge GPUs within the computational hierarchy of IIoT environments? We present Citadel, a two-stage hierarchical detection system that addresses all four research questions through decomposition across hardware tiers. As illustrated in Figure 2, Citadel operates entirely on per-subcarrier CSI without requiring raw I/Q samples, dedicated spectrum analyzers, or infrastructure-level telemetry (RQ1). Stage 1 deploys a lightweight binary trigger on sensor nodes, screening benign traffic at sub-millisecond latency so that only suspicious windows reach the analysis backend (RQ4). Stage 2 runs on an edge GPU and fuses complementary anomaly signals operating in orthogonal information spaces to detect both known and previously unseen attacks without any zero-day training data (RQ2). On six known jamming types at three power levels and 15 zero-day scenarios, Citadel achieves 100% known-attack detection and 97.1% zero-day anomaly detection at 0.4% end-to-end (E2E) false

positive rate (FPR). Under adversarial evaluation spanning whitebox and black-box threat models, gradient-based evasion stays below 2% at every tested perturbation budget, while Magmaw [19], the strongest published CSI attack generator achieves less than 5% average evasion (RQ3). In summary, our main contributions are: • We present Citadel, the first end-to-end CSI-based jamming detection system for IIoT that jointly addresses known-attack classification, zero-day generalization, and adversarial resilience on commodity hardware. A two-stage hierarchical architecture decomposes detection across hardware tiers: a 1,362-parameter binary trigger on microcontrollers and a multi-signal out-ofdistribution (OOD) ensemble on an edge GPU, completing endto-end inference in 14.2 ms at 95.9 mJ. • We propose an OOD ensemble that fuses three complementary anomaly signals (diffusion-based reconstruction divergence, classifier energy, and feature-space distance) calibrated exclusively on in-distribution data via K-fold cross-validation. In 18 knownattack scenarios and 15 zero-day scenarios, Citadel achieves 100% known-attacks detection and 97.1% zero-day anomaly detection respectively, and 0.4% E2E FPR without any zero-day data during training or threshold selection. • We conduct the first adversarial robustness evaluation of a CSIbased jamming detector, spanning white-box gradient attacks, black-box transfer and query attacks, and three state-of-theart perturbation generators. A comparative study against eight baseline methods confirms that no existing method matches Citadel’s joint performance.

2

CSI Background and Detection Challenges

The CSI captures per-subcarrier amplitude and phase information from every transmission frame. In OFDM-based Wi-Fi, the receiver estimates the CSI as the complex channel response for each subcarrier 𝑘 at time 𝑡: 𝐻 (𝑘, 𝑡) = |𝐻 (𝑘, 𝑡)| · 𝑒 𝑗 ∠𝐻 (𝑘,𝑡 ) ,

(1)

where |𝐻 (𝑘, 𝑡)| is the magnitude and ∠𝐻 (𝑘, 𝑡) is the phase shift imposed by the wireless channel [15]. Magnitude is sensitive to power-domain interference, while phase captures path-length perturbations and the discontinuities that broadband jamming introduces across subcarrier boundaries [20]. Unlike RSS, CSI preserves frequency selectivity across all subcarriers. Unlike I/Q, CSI is available on commodity microcontrollers at negligible cost. CSI thus offers a trade-off between information richness and deployment feasibility (RQ1). When a jammer emits RF interference, the jammer’s signal 𝐽 (𝑘, 𝑡) superposes onto the legitimate channel: 𝐻˜ (𝑘, 𝑡) = 𝐻 (𝑘, 𝑡) + 𝐽 (𝑘, 𝑡) [6]. Different jamming strategies produce distinct spectrotemporal patterns in CSI: constant jamming elevates magnitude uniformly across all subcarriers; sweeping jamming produces intermittent broadband bursts each time the sweep crosses the monitored channel’s bandwidth, resembling pulsed interference but with timing governed by the sweep rate rather than a fixed duty cycle; and pulsed jamming introduces periodic high-energy bursts with quiet intervals between them [18].

26

0

13 0

−2 0

1

2

Time (s)

3

0

1

2

Time (s)

3

0

1

2

Time (s)

3

0

1

2

Time (s)

3

0

1

2

Time (s)

3

Unseen during training

Figure 3: CSI magnitude (top) and phase (bottom) spectrograms from our testbed. (a) Normal traffic. (b)–(d) Three known jamming strategies, each producing a visually distinct spectrotemporal signature. (e) A zero-day scenario whose pattern partially overlaps with known classes, illustrating the generalization challenge.

Figure 3 visualizes both magnitude and phase signatures alongside normal traffic and a zero-day scenario from our testbed (Section 5). The waveform axis further modulates signatures: Gaussian noise produces broadband elevation, QPSK introduces structured modulation artifacts, and chirp waveforms create time-varying frequency-dependent profiles. These clear visual distinctions confirm that CSI carries rich discriminative information, yet they also reveal why building a reliable detector is non-trivial. The zero-day challenge (RQ2). The combination of strategies, waveforms, and power levels produces an open-ended attack space that no finite training set can cover. A supervised classifier trained on known types will confidently assign a novel waveform to the nearest known category rather than flagging it as unseen. This closed-world assumption, inherent in any purely supervised detector, motivates the need for anomaly detection mechanisms that can score how far an input deviates from the training distribution, complementing classification with a principled “I don’t know” capability. The adversarial challenge (RQ3). Any detector based on machine learning is exposed to adversarial evasion, carefully crafted perturbations that cause misclassification [21]. In the wireless domain, adversarial attacks have been demonstrated against signal classifiers [22], communication decoders [23], and CSI-based sensing systems [19, 24]. Critically, perturbations transmitted over-the-air (OTA) are subject to physical constraints (e.g., power spectral density bounds, temporal correlation, subcarrier coupling) that purely digital attacks ignore [25]. Evaluating a detector only against unconstrained perturbations overstates true vulnerability [26]. Any credible robustness claim must be validated under physically realizable conditions. The deployment challenge (RQ4). IIoT environments impose a strict computational hierarchy. Field-level microcontrollers cannot run complex inference pipelines, but the supervisory level can, provided the analysis workload is reduced to only genuinely suspicious traffic. A practical detection system must decompose its computation to match this hierarchy, performing inexpensive screening at the field level and reserving detailed analysis for an edge node. These three challenges, generalization, resilience, and efficiency, must be addressed jointly. A system that solves any two without the third is either fragile (no adversarial evaluation), narrow (no

Jam m ed

Attacker 1

Radio Jammer

Physical-Layer Interference

Phase (rad)

2

39

Adversarial

Fu Perturbation ll a m W cces odel hi s te -B IIoT node ƬA ox ƬB ox B ck del Bla o mo ge Attacker 2 d Zer owle n k

CSI d CSI e urb

0 52

IIoT node

ƬRF

IIoT node

d Perturbe CSI

t Per

10

AP

I

20

13

CSI

CS I

30

26

IIoT node

Deploy Jamming

Jam me d

39

Magnitude

40

Detect and Alert

Different waveforms

(e) Zero-Day (Random Chirp)

(d) Pulsed (Gaussian)

(c) Sweeping (QPSK)

(b) Constant (Gaussian)

(a) Normal

52

CS

Subcarrier index Subcarrier index

CITADEL: CSI-Based Jamming Detection and Open-Set Classification for IIoT Networks

Edge Computing CITADEL

Adversarial ML Attack

Figure 4: Threat models. The RF jammer (TRF ) targets the wireless link with arbitrary waveforms. The ML attacker operates under different adversarial capabilities: white-box (T𝐴 ) and black-box (T𝐵 ).

zero-day coverage), or impractical (no edge deployment). Section 4 presents how Citadel addresses all three through a two-stage architecture with complementary detection paradigms.

3

Threat Model

We consider an IIoT deployment aligned with the ISA-95/Purdue reference architecture [2, 27]. Wi-Fi-enabled microcontrollers attached to industrial equipment collect telemetry and report it to the supervisory level over Wi-Fi. CSI is extracted passively from every frame exchange at no additional hardware cost, meaning physicallayer monitoring piggybacks on existing operational infrastructure. Stage 1 runs on the same microcontroller that performs the sensing task. Stage 2 runs on a GPU-capable edge node at the supervisory level, within the operational technology (OT) zone with no dependency on external cloud services, consistent with IEC 62443 [28]. The field-level sensors are physically accessible to an adversary (deployed on the factory floor), while the edge node resides in a secured control room. Attacker model. We consider two orthogonal adversary types (Figure 4). An RF jammer (TRF ) deploys a SDR near the monitored link, controlling three axes: timing strategy (constant, sweeping, pulsed), waveform shape (Gaussian, QPSK, chirp, FSK, sawtooth, triangle), and transmission power [5, 6]. The combination produces an open-ended attack space of which any finite training set covers only a subset. An adversarial ML attacker crafts input perturbations to make the pipeline misclassify jammed CSI as benign. We focus on evasion attacks (hiding real jamming) rather than causative attacks (triggering false alarms), as the latter can be mitigated through alert rate limiting while missed attacks risk irreversible physical consequences. We define two threat models with progressively increasing realism, following the escalation methodology in [29, 30]. T𝐴 (White-box): The adversary has full knowledge of all model architectures and parameters, computing exact gradients. Perturbations must satisfy physical realizability constraints adapted to the CSI domain [25]. These are implemented as a differentiable projection Π phys applied after each gradient step, enforcing: (C1) persubcarrier power within the noise floor scaled by the perturbation budget; (C2) temporal coherence across consecutive time steps, reflecting the physical channel coherence time; and (C3) subcarrier coupling via frequency-domain smoothing, enforcing the correlation structure imposed by indoor multipath propagation. This is our primary evaluation setting, since perturbations that violate these constraints cannot be realized over the air [25, 26]. Perturbation

Aymen Bouferroum et al.

budgets are expressed in z-score normalized CSI space. The physical interpretation and budget selection are detailed in Section 6.2. T𝐵 (Black-box): The adversary has zero knowledge of model architectures, parameters, or intermediate representations, and cannot compute gradients. The attacker solves the following equation using only query access to the binary detection output 𝑦 ∈ {0, 1}:  𝜹 ∗ ≈ arg max L̂ 𝑦1, . . . , 𝑦𝑄 s.t. ∥𝜹 ∥ ∞ ≤ 𝜀, Π phys (𝜹) = 𝜹 , 𝜹

(2) where L̂ is estimated from 𝑄 queries. Alternatively, the adversary trains a surrogate model on independently collected data and transfers adversarial examples crafted against it. This is the most realistic deployment scenario, reflecting an adversary who can observe whether alerts are raised but has no access to the detection pipeline internals. Scope exclusions. The adversary cannot tamper with sensor hardware, compromise the authenticated field-to-supervisory channel (a man-in-the-middle variant is analyzed in Appendix B), or inject fabricated CSI readings. Full-band high-power jamming that destroys the link entirely is trivially detectable through link loss and falls outside intelligent evasion. Defender capabilities. The defender operates the pipeline at the supervisory level with real-time access to all sensor CSI streams but possesses no a priori knowledge of zero-day strategies. All OOD thresholds are calibrated exclusively on in-distribution data through cross-validation, no zero-day samples are used at any stage, ensuring that reported performance reflects genuine generalization.

4

The Design of Citadel

This section presents the design of Citadel. Stage 1 runs a binary trigger on each window to screen benign traffic and suspicious windows are escalated to Stage 2, which classifies them into known jamming types or flags them as zero-day anomalies through a multisignal ensemble. The design is guided by two principles developed throughout this section. Computational asymmetry, which exploits the fact that the vast majority of traffic is benign to avoid expensive analysis on every window, and signal complementarity, which ensures that no single adversarial perturbation can simultaneously suppress all detection channels.

4.1

Stage 1: Binary Trigger

Stage 1 addresses the deployment challenge (RQ4) by performing inexpensive screening at the field level. For each CSI window x ∈ R2×32×52 , a lightweight binary classifier decides whether to escalate to Stage 2:  𝑦1 = 𝜎 𝑓𝑆1 (x; 𝜃 1 ) , escalate if 𝑦1 > 𝜏1, (3) where 𝜎 is the sigmoid function and 𝜏1 is calibrated to target a low false escalation rate on benign traffic. The architecture consists of three convolutional blocks (Conv2d, BatchNorm, ReLU) with channel progression 2 → 4 → 8 → 16, followed by adaptive average pooling and a single linear layer, yielding 1,362 trainable parameters. This extreme compactness is deliberate. It satisfies the memory and latency constraints of microcontroller deployment while limiting the model’s capacity to learn sharp decision boundaries that larger networks expose to gradient-based exploitation.

Training uses cross-entropy loss with two security-motivated modifications: asymmetric false-negative weighting that penalizes missed attacks more heavily than false escalations, and label smoothing that prevents overconfident predictions on boundary samples, particularly movement traffic, whose spectral characteristics partially overlap with low-power jamming. Beyond cost reduction (RQ4), the two-stage decomposition creates a structural defense against adversarial evasion (RQ3). An adversary must simultaneously craft perturbations that bypass Stage 1’s binary filter (making jammed CSI appear benign) and evade Stage 2’s multi-signal scoring (appearing in-distribution across three independent channels). This creates a multi-objective optimization problem. As we show in Section 6, the gradients of the two stages point in opposing directions, preventing simultaneous evasion.

4.2

Stage 2: Multi-Component Analysis

A single supervised classifier cannot satisfy the remaining two challenges. Against the zero-day challenge (RQ2), a classifier trained on known attack types assigns confident predictions to novel waveforms rather than flagging them as unseen, the closed-world failure described above. Against the adversarial challenge (RQ3), a single anomaly signal provides the adversary a clear optimization target: suppress that one signal and the detector is evaded. Citadel addresses both by combining three complementary models that produce qualitatively different representations (Figure 5), ensuring that an attacker cannot suppress distributional shift in output space, maintain high classifier confidence, and remain geometrically close to known-class centroids in feature space simultaneously. 4.2.1 Four-Class CSI Classifier. The backbone classifier maps CSI windows to four classes: benign (0), constant (1), sweeping (2), and pulse (3) jamming. Movement traffic is intentionally excluded from the training classes, making it OOD by design. This decision ensures the anomaly detection mechanism is continuously exercised against the natural population of movement windows during deployment, providing ongoing validation that the detector remains calibrated without relying on attack data. The architecture employs four convolutional layers with channel progression 32 → 64 → 128 → 256, each followed by a spectralattention module that implements channel recalibration [31], learning to emphasize subcarrier bands most disrupted by interference. Fully connected layers (256 → 128 → 4) with dropout produce three outputs consumed by downstream components: the class prediction 𝑐ˆ = arg max𝑐 𝑧𝑐 , the logit vector z ∈ R4 for energy-based scoring, and the penultimate feature representation h ∈ R128 for distance-based scoring. The classifier totals 422,500 parameters. 4.2.2 Variational Autoencoder. A CNN-based VAE [32] with spectralattention modules learns a generative model of the in-distribution CSI manifold through a 64-dimensional latent space. The encoder mirrors the classifier’s convolutional structure but maps to separate mean (𝝁) and log-variance (log 𝝈 2 ) heads. The decoder uses transposed convolutions to reconstruct the original 2 × 32 × 52 tensor, totaling 2.17M parameters. The training loss combines three terms:  LVAE = Lrecon + 𝜆KL · 𝐷 KL 𝑞(z|x) ∥ 𝑝 (z) + 𝜆perc · Lperc,

(4)

CITADEL: CSI-Based Jamming Detection and Open-Set Classification for IIoT Networks Stage 2: Edge AI Layer

CSI Input ( x∈ℝ2x32x52 )

Stage 1 Normal traffic

1.32M params

(c) Diffusion Denoise U-Net 1D

Latent z∈ℝ64

z^ 0

0.25M params, denoise at t

(b) VAE Decoder 0.85M params

Re-classifier Reconst. (a’) Classifier (2nd pass, frozen) x^

VAE total: 2.17M params ^ p (y|x))

Shared weights TinyClassifier

KLD (Distribut. shift)

1,362 params Suspicious

ESP32 Sensor Nodes

(b) VAE Encoder

p (y|x)

(a) Classifier 422k params, 4-class

DKL(p (y|x) || p (y|x))

Logits Energy (Classif. uncertainty) z∈ℝ4

– log ∑ exp(zc ) c

h∈ℝ128 Mahalanobis (Geo. outlier)

Features

min √(h-µc )T∑-1(h-µc ) c

Outputs:

Normal traffic (S1 False trigger)

Known attack Zero-Day Anomaly (OOD detected)

S = ⅓ (KLD+E+M) K-fold calibration

Figure 5: Citadel Stage 2 architecture. The CSI classifier produces logits z and features h directly from the input. The VAE encoder, diffusion denoiser, and VAE decoder reconstruct x̂, which is re-classified to obtain 𝑝 (y| x̂). Three OOD signals are derived from these outputs and fused via an equal-weight ensemble with K-fold calibration.

4.3

Ensemble OOD Detection

Citadel fuses three anomaly signals, each capturing a qualitatively different aspect of distributional deviation. Their combination forces an adversary to simultaneously suppress distributional shift in output space, maintain high classifier confidence, and remain geometrically close to known-class centroids in feature space, a multi-objective constraint that no single perturbation direction can satisfy. Signal 1: KL Divergence. The distributional shift between classifier outputs on original versus diffusion-reconstructed inputs (Equation 5). This signal captures how fragile the classifier’s confidence allocation is under manifold-constrained reconstruction. Signal 2: Energy Score. The negative log-sum-exp of the logit vector [36]: ∑︁ 𝐸 (x) = − log exp(𝑧𝑐 /𝑇 ), (6) 𝑐

where Lrecon is the mean squared error (MSE) reconstruction loss, 𝐷 KL regularizes against the standard normal prior 𝑝 (z) = N (0, I), and Lperc is a perceptual loss in classifier feature space that encourages reconstructions to preserve semantically meaningful structure. Distribution-shift adaptation. During training, the VAE sees all benign windows. During deployment, Stage 2 receives only the Stage 1-escalated subset, which is enriched in samples with unusual spectral characteristics. Without adaptation, this distribution shift inflates Stage 2 false alarms. We address this through fine-tuning on Stage 1-gated benign samples with a replay buffer to prevent catastrophic forgetting, closing the gap at negligible training cost. 4.2.3 Latent-Space Diffusion Model. A 1D U-Net [33] with sinusoidal time embeddings and residual blocks is trained as a denoising diffusion probabilistic model (DDPM) [34] on the VAE’s latent representations z ∈ R64 , totaling 249,600 parameters. Operating in the 64-dimensional latent space rather than the 3,328-dimensional input space is critical for computational feasibility on edge hardware and concentrates the model’s capacity on the manifold structure learned by the VAE. At inference, single-step denoising produces a denoised latent ẑ0 . The VAE decoder maps this back to input space as x̂, and the classifier’s output distributions on the original versus reconstructed input are compared via KL divergence:  KLD(x) = 𝐷 KL 𝑝 (y|x) ∥ 𝑝 (y| x̂) .

(5)

For in-distribution inputs, the VAE latent lies on the learned manifold. The denoise cycle preserves the classifier’s output distribution, yielding low KLD. For OOD inputs, zero-day attacks or adversarially perturbed windows, the latent lies off the manifold, and denoising pulls it toward the nearest in-distribution configuration, distorting the output distribution and producing elevated KLD. This mechanism converts high-dimensional feature anomalies into a measurable divergence in the compact 4-class output space, amplifying subtle distributional shifts that raw feature-space metrics might miss. Notably, the diffusion model also provides implicit robustness. Its stochastic denoising acts as a form of randomized smoothing [35], making the KLD signal resistant to gradient-based manipulation.

where temperature 𝑇 sharpens the energy landscape. Higher energy indicates lower model confidence. OOD inputs produce elevated energy because learned features fail to activate any class prototype strongly. Signal 3: Mahalanobis Distance. The minimum distance from class centroids in the classifier’s penultimate feature space [37]: √︃ (7) 𝑀 (x) = min (h − 𝝁𝑐 ) ⊤ 𝚺 −1 (h − 𝝁𝑐 ), 𝑐

where 𝝁𝑐 ∈ R128 are class-conditional centroids and 𝚺 −1 is the shared precision matrix estimated via Ledoit-Wolf shrinkage [38]. This signal flags inputs in low-density regions of the feature manifold, even when the classifier assigns high softmax confidence through extrapolation. Each signal is normalized to [0, 1] via soft thresholding against calibration bounds, and the ensemble score is the unweighted mean: 𝑆 ens = 31 𝑠 KLD + 13 𝑠 energy + 13 𝑠 Mahal .

(8)

A sample is flagged as OOD if 𝑆 ens exceeds a class-conditional threshold or the raw KLD exceeds an extreme-override percentile. Equal weighting is a deliberate design choice. Optimized weights would give an adversary a clear target (suppress the dominant signal), whereas equal weights require suppressing all three simultaneously. K-fold calibration. All OOD thresholds are set through 5-fold blocked temporal cross-validation with purge gaps that eliminate both double-dipping bias and temporal leakage from CSI autocorrelation. The procedure operates exclusively on in-distribution data. No zero-day samples are used at any stage, ensuring that reported zero-day performance reflects genuine generalization rather than implicit tuning. Class-conditional thresholds use a lower percentile for benign-predicted samples (reducing false positives on benign traffic) and a higher percentile for attack-predicted samples (ensuring that OOD signals on putative attacks are taken seriously).

5

Implementation and Setup

Testbed. The experimental testbed (Figure 6) emulates an IIoT factory floor. Five ESP32-C6 microcontrollers [16] serve as Wi-Fienabled sensor nodes, extracting per-subcarrier CSI from 802.11n frames on the 2.4 GHz band (20 MHz channel, 52 OFDM subcarriers) at approximately 4 Hz while performing their nominal sensing

Aymen Bouferroum et al. ESP32 ESP32 Jetson

Testbed Devices Jetson

HackRF HackRF

RP5

RP5

ESP32-C6

Raspberry Pi 5

HackRF One

Jetson Orin Nano

Figure 6: Experimental testbed. (Left) Laboratory environment. (Middle) Floor plan showing ESP32-C6 nodes, Jetson Orin Nano, HackRF One, and Raspberry Pi 5 access point. (Right) Hardware components. Table 1: Training configuration by pipeline component.

Component S1 TinyClassifier S2 CSI Classifier S2 VAE + Fine-tune S2 Diffusion U-Net

ensemble thresholds are set at P90 for benign-predicted and P95 for attack-predicted samples, and energy temperature is 𝑇 =0.5. Full calibration parameters are listed in Appendix F. Evaluation metrics. We report six metrics throughout. On the defense side: (1) Detection rate (DR): fraction of attack windows correctly identified as threats, combining Stage 1 and Stage 2 decisions; (2) Stage 1 trigger rate: fraction of windows flagged as suspicious by the binary trigger, determining what reaches Stage 2; (3) OOD detection rate: fraction of windows flagged as out-of-distribution by the ensemble, the primary metric for zero-day scenarios; (4) False positive rate (FPR): fraction of benign windows incorrectly flagged as threats. On the adversarial side: (5) Evasion rate (ER): fraction of attack windows that evade detection, reported at Stage 1, Stage 2, and end-to-end (E2E) levels to isolate each component’s contribution; (6) Attack success rate (ASR): fraction of adversarial examples that evade the targeted component or pipeline.

Epochs

LR

Batch

Loss / Notes

6

100 50 100 30 1000

10 −3 10 −3 10 −4 2×10 −5 10 −5

256 128 256 256 1024

CE; label smooth 𝛼=0.1; FN 2× CE; 𝐿2 decay 10 −4 Eq. 4; 𝜆KL =10 −6 S1-gated quiet; 30% replay DDPM; EMA 0.9999

We evaluate Citadel along three dimensions: 1 detection performance on known and zero-day attacks under non-adversarial conditions (Section 6.1); 2 adversarial robustness under the threat models defined in Section 3 (Section 6.2); 3 comparative evaluation against eight baseline methods, including inference efficiency on edge hardware and operational assessment (Section 6.3). All results use the testbed and training configuration described in Section 5.

tasks. A Raspberry Pi 5 acts as both access point and MQTT broker. An NVIDIA Jetson Orin Nano at the supervisory level executes Stage 2 inference. A HackRF One SDR [6, 39] generates jamming signals across three timing strategies (constant, sweeping, pulsed), six waveform types (Gaussian, QPSK, chirp, FSK, sawtooth, triangle), and three power levels (10, 15, 20 dB IF gain). The jammer is placed at variable distances in a 4 × 5 m room, with the access point 15 m away to introduce realistic multipath conditions. Data collection. Each ESP32-C6 transmits raw CSI packets (𝐼𝑘 and 𝑄𝑘 for 52 subcarriers) via MQTT. The preprocessing pipeline converts these to model-ready tensors: 1 I/Q pairs yield complex estimates 𝐻𝑘 = 𝐼𝑘 + 𝑗𝑄𝑘 ; 2 magnitude and phase are computed per subcarrier; 3 corrupt packets (flagged by the firmware) are filtered; 4 the stream is segmented into sliding windows of 𝑊 =32 consecutive packets, yielding tensors x ∈ R2×32×52 . The dataset comprises over 815,000 labeled (Appendix C) windows: 264,014 benign (quiet and movement), 366,796 from 18 known-attack scenarios, and 184,508 from 15 zero-day scenarios strictly withheld (Appendix D details the coverage matrix) from all training, validation, and calibration. Data is partitioned temporally (70/15/15 train/val/test) with 128-window purge gaps to eliminate autocorrelation-driven leakage. Training. All models are trained sequentially on a single NVIDIA L40S GPU. Table 1 lists the complete configuration (convergence curves are provided in Appendix E). The Stage 1 threshold 𝜏1 targets less than 10% false escalation. The VAE’s KL weight is 𝜆KL =10 −6 . The fine-tuning phase described in Section 4.2.2 closes the Stage 1gating distribution gap. The diffusion model uses 1,000 DDPM timesteps (𝛽 from 10 −4 to 0.02). At inference, denoising at 𝑡=10 balances anomaly sensitivity against reconstruction fidelity. For ensemble calibration (Section 4.3), 5-fold blocked temporal CV sets per-signal bounds at P95 (lower) and in-distribution maximum (upper), with KLD extreme override at P99.5. Class-conditional

6.1

Evaluation

Detection Performance

Under non-adversarial conditions, Citadel achieves 100% knownattack detection, 97.1% zero-day anomaly detection across 15 heldout scenarios, and 0.4% E2E FPR (RQ1, RQ2). The 100% knownattack rate establishes a critical baseline for interpreting the adversarial results in Section 6.2. Any reduction under perturbation reflects genuine adversarial degradation rather than residual cleancondition error. We now examine each dimension in detail. 6.1.1 Known-Attack Classification. Table 3 disaggregates detection performance across the two pipeline stages for each known attack class and benign traffic. Stage 1 achieves 100% trigger rate on all three attack classes, meaning every jamming window is escalated to the supervisory level for detailed analysis, and the 8.6% benign trigger rate (FPR) remains below the 10% operational target, with the majority of false triggers originating from movement-induced CSI fluctuations that partially overlap the spectral profile of lowpower jamming. Stage 2 correctly classifies the vast majority of escalated knownattack windows into their true class. Pulse jamming is classified with perfect accuracy (100.0%), constant jamming at 96.8%, and sweeping jamming at 83.1%. The remainder is flagged as OOD rather than misclassified into a wrong attack class, a conservative failure mode that preserves detection (the window is still recognized as a threat) while sacrificing root-cause specificity. This mischaracterization is concentrated in sweeping attacks (16.9% routed to OOD), where the time-varying frequency pattern of QPSK waveforms at stealthy power levels produces spectral profiles that fall between training-class centroids in the classifier’s feature space. Crucially, no known-attack window is misclassified as benign. The 0.0% benign column across all three attack classes means that the combination

CITADEL: CSI-Based Jamming Detection and Open-Set Classification for IIoT Networks

Table 2: Citadel zero-day detection across 15 held-out scenarios. All values are percentages of total windows per scenario. Stage 2 decisions: OOD = correctly flagged as unknown threat; Constant/Sweeping/Pulse = absorbed into a known class (still detected, not a failure); Benign = missed by the full pipeline. Left: Category 1 (novel timing). Right: Category 2 (known timing, novel waveform).

S1 Pattern

Waveform

Trig.

Stage 2 Decision (%) Ben.

Con.

Swe.

Pul.

S1 OOD

Category 1: Novel timing Random Random Random Random Random Random Burst Burst

Pattern

Waveform

Bruteforce Chirp FSK Sawtooth Square Triangle Chirp Triangle

100.0 100.0 100.0 100.0 100.0 100.0 100.0 97.5

Mean

99.7

0.0 0.0 0.0 0.0 0.0 0.0 0.1 5.0

0.0 0.0 0.0 0.0 0.0 0.0 0.2 0.0

0.0 0.0 0.0 0.0 0.0 0.0 0.0 7.5

0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0

100.0 100.0 100.0 100.0 100.0 100.0 99.7 87.5

Constant Sweeping Sweeping Sweeping Pulse Pulse Pulse

98.4

Constant Sweeping Pulse Benign

Stage 2 Decision (%)

Trigger (%)

Benign

Constant

Sweeping

Pulse

OOD

100.0 100.0 100.0

0.0 0.0 0.0

96.8 0.0 0.0

0.2 83.1 0.0

0.0 0.0 100.0

3.0 16.9 0.0

8.6 (FPR)

E2E: 0.4%

of supervised classification and OOD detection achieves perfect threat identification even when class assignment is uncertain. The E2E FPR of 0.4% confirms that the cascaded two-stage architecture suppresses false alarms. From the 8.6% of benign windows that trigger Stage 1, Stage 2 correctly identifies the vast majority as non-threatening, yielding a final false-alarm rate well below the 5% operational target. 6.1.2 Zero-Day Generalization. Table 2 presents the per-scenario breakdown across 15 held-out zero-day scenarios that were strictly withheld from all training, validation, and calibration stages. The scenarios are organized into two novelty categories: category 1 (novel timing pattern with arbitrary waveform, 8 scenarios) tests whether the OOD ensemble can detect timing structures absent from training; category 2 (known timing with novel waveform, 7 scenarios) tests whether it can detect waveforms whose spectral profiles were never seen, even when the timing pattern matches a training class. All six random-family scenarios achieve perfect OOD detection. The random timing pattern produces broadband spectral disruption across all subcarriers simultaneously, generating KLD values well above the extreme-override threshold. The VAE cannot reconstruct a pattern that bears no structural resemblance to any training-set class. This constitutes the “easy” regime for the ensemble: when an attack is spectrotemporally distant from all known classes, even a single OOD signal suffices. Detection difficulty increases with spectral overlap between the novel waveform and training classes. The hardest category 1 scenario is burst triangle (87.5% OOD), where the intermittent timing reduces the observation window for distributional scoring, and the 97.5% Stage 1 trigger rate means that 2.5% of windows are not

Chirp Bruteforce FSK Sawtooth Bruteforce Chirp Triangle

100.0 100.0 100.0 100.0 100.0 100.0 100.0

Con.

Swe.

Pul.

OOD

0.0 0.0 0.0 0.0 0.0 0.0 0.0

25.2 0.2 0.0 0.0 4.9 0.0 0.0

0.0 0.0 0.0 0.0 0.0 0.0 0.0

74.8 99.8 100.0 100.0 95.1 100.0 100.0

Mean

100.0

(a) KLD 3

Benign 7.5

2

5.0

1

2.5

0

0

0.0 0.0 0.0 0.0 0.0 0.0 0.0

95.7

OOD (anomaly detection) = 97.1%

Density

Table 3: Citadel two-stage known-attack detection. Each known class contains Gaussian and QPSK waveforms at three power levels (10, 15, 20 dB; 6 scenarios per class, 18 total). Stage 2 decisions are shown as percentages of all windows per class.

Stage 1

Stage 2 Decision (%) Ben.

Category 2: Known timing, novel waveform

Overall mean (15 scenarios): Stage 1 Trigger = 99.8% ,

Class

Trig.

5

Score

0.0

Known Attack

(b) Energy

0.4

Zero-Day

(c) Mahalanobis

−2

Score

0.0

(d) Ensemble

10

0.2

−3

20

0

10

Score

20

0

0.0

0.5

Score

1.0

Figure 7: Distribution of the three OOD signals and their ensemble fusion across benign, known-attack, and zero-day traffic (Stage 1triggered samples). (a)–(c) show that no individual signal cleanly separates all three classes; (d) shows that the equal-weight ensemble achieves substantially better separation.

escalated at all. The 5.0% benign rate confirms that a small fraction of burst windows appear sufficiently “quiet” to pass Stage 2 undetected, the only scenario where the pipeline shows measurable leakage. In category 2, constant chirp is the hardest scenario (74.8% OOD), where the chirp waveform’s broadband energy partially mimics the constant gaussian spectral profile seen during training. The remaining 25.2% are absorbed into the sweeping class (a conservative mischaracterization that still counts as threat detection). Category 1 scenarios average 98.4% OOD versus 95.7% for category 2, suggesting that novel timing patterns are marginally easier to detect than novel waveforms under known timing. This is consistent with the intuition that the classifier’s learned timing features provide a strong prior that novel timing immediately violates, whereas novel waveforms may partially activate existing spectral filters. 6.1.3 OOD Signal Analysis. To understand why the ensemble succeeds where individual signals fail, Figure 7 visualizes the distributions of all three OOD signals and their fusion across three traffic classes (benign, known attack, zero-day), computed on Stage 1triggered samples only. KLD (Figure 7a) is the strongest single discriminator. Benign and known-attack samples both cluster tightly near zero, confirming that the VAE faithfully reconstructs in-distribution patterns and that diffusion denoising preserves the classifier’s output distribution. Zero-day samples shift to a median of 4.57 with a wide spread

Aymen Bouferroum et al.

(P5–P95: 0.00–7.39), providing 20 times separation from the knownattack median. Over 80% of zero-day samples exceed a KLD of 1.0 and 67% exceed a KLD of 3.0, triggering the extreme-override threshold. However, 11.6% of zero-day samples have a KLD below 0.1. The VAE partially reconstructs waveforms that are spectrally similar to training classes (e.g., constant_chirp). This blind spot is precisely where the other two signals must compensate. Energy (Figure 7b) provides the classifier-confidence dimension. Known attacks produce the most confident predictions (median −3.17), reflecting strong alignment with learned class prototypes. Benign triggered samples are less confident (median −2.12), and zero-day samples sit in between (median −2.88) with a bimodal distribution. Some novel waveforms produce confident misclassifications (the classifier believes they belong to a known class), while others genuinely confuse the classifier. Energy alone achieves only 8.4% zero-day anomaly, confirming that classifier confidence is a weak OOD signal in the CSI domain. Nevertheless, energy contributes uniquely to the ensemble by providing the benign/knownattack separation that KLD and Mahalanobis lack. In Figure 7a and Figure 7c, benign and known-attack distributions overlap substantially, but in Figure 7b they are clearly distinct. Mahalanobis distance (Figure 7c) measures geometric deviation in feature space. Known-attack samples sit closest to their respective class centroids (median 2.15), benign samples are intermediate (median 5.24), and zero-day samples are farthest (median 9.10) with a long tail reaching beyond 20. However, the overlap between benign and zero-day distributions is significant: 49% of zero-day samples fall below the benign P95 of 8.82. This limits standalone detection to 57.2%, but the 51% of zero-day samples that are above the benign range include many that KLD misses, providing complementary geometric coverage. Ensemble (Figure 7d) demonstrates the fusion payoff. The equalweight combination compresses known-attack and benign scores tightly near zero (medians 0.00 and 0.06 respectively), while shifting zero-day scores to a median of 0.45 with a broad right tail. The overlap region between benign and zero-day distributions shrinks substantially compared to any individual panel, visually confirming that the three signals cover each other’s blind spots. The low pairwise correlations between signals confirm that each signal captures non-redundant information. Even the highest correlation (energy versus Mahalanobis, which share the same classifier backbone) leaves 82% of variance unshared (Appendix G). 6.1.4 Component Ablation. Adding energy to Mahalanobis yields only +0.6 pp (57.8%), confirming that without KLD, the discriminative features are fundamentally limited. KLD alone achieves 94.1%, by far the strongest single signal, but at the cost of 9.2% mischaracterization of known attacks, because some known-attack windows produce moderate KLD when the VAE reconstruction introduces minor distributional shifts. The full three-signal ensemble reaches 97.1% zero-day anomaly while reducing mischaracterization from 9.2% to 6.6%, achieving a better detection-precision trade-off than any single signal. The diffusion model’s marginal contribution is +39.0 pp. Removing it drops detection from 96.9% to the energy-plus-Mahalanobis baseline of 57.8%. This confirms that the generative reconstruction channel is the primary differentiator between Citadel and methods

that rely solely on discriminative or distance-based scoring. This explains why post-hoc OOD methods applied to the same classifier backbone (Section 6.3) achieve substantially lower zero-day rates. Weight sensitivity. To validate the equal-weight design choice, we conduct a systematic grid search over 66 weight configurations across the 3-simplex (step size 0.1). Equal weighting achieves the highest zero-day detection rate at the P90 operating point (99.0%). The top 15 configurations span less than 1 pp in zero-day rate, revealing a flat optimum: the system is insensitive to moderate weight perturbations. Skewing weights toward any single signal strictly degrades performance. Equal weighting is therefore not a simplifying assumption but the empirically justified choice, consistent with the low pairwise correlations reported in Section 6.1.3. Stage 1 gate ablation. Forwarding all traffic directly to Stage 2 (bypassing the gate) changes zero-day anomaly below 0.1 pp and known-attack detection remains at 100%, confirming that Stage 2 independently distinguishes benign from malicious traffic. Stage 1’s contribution is therefore computational, not discriminative. It filters approximately 92% of benign windows, reducing the Stage 2 analysis volume and the associated latency and energy cost by an order of magnitude.

6.2

Adversarial Robustness

6.2.1 White-Box Attacks (T𝐴 ). Perturbations are bounded in the z-score normalized CSI space. For each subcarrier, |𝛿𝑘 | ≤ 𝜀, equivalently 𝜀 ·𝜎𝑘 in physical units, where 𝜎𝑘 is the per-subcarrier standard deviation of the training distribution. At 𝜀=0.10, the adversary may shift each subcarrier by at most 1 dB in magnitude and 10◦ in phase. We use this as the largest budget because beyond it, perturbations exceed the observed channel variability, making the adversarial manipulation distinguishable from legitimate channel dynamics. White-box access gives the adversary exact gradients through every component in the pipeline. We follow the adaptive-attack methodology [30]: all losses are fully differentiable (no gradient masking), the attacker optimizes directly against each target component, and we verify convergence by running PGD at 10 and 100 steps. We use PGD-100 [40] as the primary attack under T𝐴 with physically realizable perturbations at 𝜀 ∈ {0.01, 0.03, 0.05, 0.10}. FGSM [21] and PGD-10 converge to the same evasion rates at each 𝜀, confirming that the optimization landscape is well-characterized and additional iterations do not uncover stronger attacks (RQ3). Stage 1 and classifier resilience. Figure 8 isolates each detection component under targeted gradient attack. Panel (a) averages Stage 1 evasion across all three known-attack categories. The binary trigger stays below 0.7% bypass at 𝜀=0.10 under PGD-100. The trigger detects broadband spectral energy as a statistical aggregate over the full 52-subcarrier band. Suppressing this aggregate while still jamming requires perturbation magnitudes that exceed physically realizable bounds. Panels (b–d) report the classifier’s targeted-tobenign rate, where the adversary maximizes 𝑃 (benign | 𝑥 adv ). The three attack categories respond differently. Pulse jamming (panel d) yields 0.0% benign predictions at every 𝜀. The on-off temporal structure sits too far from the benign decision region for any feasible perturbation to close the gap. Constant jamming (panel b) reaches 1.2%, and sweeping (panel c) reaches 2.2% at 𝜀=0.10. Even under the

CITADEL: CSI-Based Jamming Detection and Open-Set Classification for IIoT Networks PGD-100

(c) S2: Sweeping

FGSM

(d) S2: Pulse

(a) VAE Fragility

PGD-10

ε

Figure 8: White-box component resilience under FGSM/PGD across perturbation budgets 𝜀. (a) Stage 1 evasion rate averaged over known attacks; (b–d) Stage 2 classifier-to-benign rate for constant, sweeping, and pulse respectively. All ERs remain below 2.3% even at 𝜀=0.10.

strongest attack configuration, fewer than 2.2% of windows receive a benign label from the classifier. Cross-component safety nets. The classifier and OOD ensemble operate in parallel within Stage 2 (Section 4.3). A sample must evade both branches to escape detection. Figure 9 probes this redundancy by attacking each branch in turn and then both at once. Panel (a) shows the VAE reconstruction reduction (RR) under direct gradient attack. Since the VAE serves the OOD detection pathway, we test it on two zero-day categories where reconstruction error is the primary detection signal. At 𝜀=0.10, PGD-100 reduces reconstruction error by 10.9% (sweeping bruteforce) and 10.5% (random bruteforce), not enough to push the anomaly score below the calibrated threshold. Panel (b) examines the 2.2% of sweeping windows that the classifier attack relabels as benign. The OOD ensemble flags 86.0% of them at 𝜀=0.10 and all of them at 𝜀≤0.03. The perturbation that shifts the classifier boundary simultaneously distorts the latent representation, pushing energy and Mahalanobis scores above their detection thresholds. Panel (c) reverses the attack direction. When the full budget targets VAE reconstruction, the classifier remains 99.9% correct across all 𝜀. Every sample is still classified as an attack. The two loss surfaces share little curvature in common, so a perturbation optimized for one objective produces negligible movement on the other. Panel (d) tests budget splitting. A joint targeted-to-benign plus VAE attack (𝛼=0.5) still sees 86.1% of its misclassified samples caught by the OOD ensemble at 𝜀=0.10. Dividing the perturbation budget weakens both objectives without yielding a complementary gain. We measured the cosine similarity between the classifier and VAE gradient directions across 1,000 samples. The mean is 0.007 with standard deviation 0.058, confirming near-orthogonality in the input space. End-to-end synthesis. At 𝜀=0.10 on sweeping (the worst case), the joint targeted-to-benign attack produces 2.3% benign predictions, of which the OOD ensemble catches 74.9%, leaving an effective pipeline evasion of 0.57%. At 𝜀≤0.05, effective evasion is 0.0% for all categories. Targeting Stage 1 in addition does not help. A joint loss L = 𝜆L𝑆1 + (1−𝜆)L𝑆2 with 𝜆=0.8 under PGD-200 yields 0.0% E2E evasion at every 𝜀. Stage 1 and Stage 2 depend on different features whose gradient directions cannot be jointly satisfied within realizable perturbation bounds. Visualization of the gradient conflict. Figure 10 provides four complementary views of why E2E evasion fails. Panel (a) tracks detection scores across 200 PGD steps on sweeping at 𝜀=0.10. The

0.01

0.03

ε

0.05

0

0.1

(d) Joint Attack

0.01 0.03 0.05 0.1 0.01 0.03 0.05 0.1 0.01 0.03 0.05 0.1

ε

ε

ε

Figure 9: Adversarial dilemma: cross-component safety nets under targeted gradient attacks. (a) VAE RR under direct recon-loss attack on sweeping and random brute-force zero-day traffic. (b–d) OOD detection of residual misclassified windows after (b) classifier-only, (c) VAE-only, and (d) joint classifier+VAE attacks on sweeping. S1

Clf

(a) Det. Trajectory 0.95

Density

ε

Score

ε

Rand.

50

0.93 0.1 0.0

0

100

PGD Step

200

OOD

Benign

(b) Grad. Conflict

Sweep.

Zero-Day

(c) UMAP: Clean (d) UMAP: PGD-200

Mean = 0.007

10 5

0 −0.25

0.00

0.25

UMAP 1

cos(∇S1, ∇S2)

UMAP 1

Figure 10: Gradient conflict analysis on sweeping at 𝜀=0.10. (a) Detection scores across 200 PGD steps. (b) Cosine similarity between Stage 1 and Stage 2 gradients. (c) UMAP of classifier features (no attack). (d) UMAP under PGD-200 attack. 4-Class Clf

VAE-KLD

(a) Mean ASR across categories

0.4

2.0

0.3

1.5

0.2

1.0

0.1

0.5

ASR (%)

ε

5 0

0 0.01 0.03 0.05 0.10 0.01 0.03 0.05 0.10 0.01 0.03 0.05 0.10 0.01 0.03 0.05 0.10

DR (%)

RR (%)

ER (%)

1

Sweep.

(c) VAE Attack

100

10

2

PGD-100

(b) Clf. Attack

UMAP 2

PGD-10

UMAP 2

FGSM

(a) S1 Avg. Evasion (b) S2: Constant

0.0

0.01

0.03

ε

0.05

0.10

0.0

Pipeline

Ensemble

(b) Per-category ASR at ε = 0.10

Con.

Swe.

Pul.

Bur.T Ran.B Con.C Swe.B

Category

Figure 11: Transfer attack ASR (4,096 samples per category). (a) Mean ASR across seven zero-day categories vs. perturbation budget 𝜀; (b) per-category ASR at 𝜀=0.10. ASR remains at 0% for 4 of 7 categories and peaks at 1.95% on burst triangle.

Stage 1 trigger barely moves (0.942→0.941), the classifier confidence drops modestly (0.948→0.927), and the OOD ensemble score plateaus above the anomaly threshold by step 60. Panel (b) shows the distribution of cos(∇𝑥 L𝑆1, ∇𝑥 L𝑆2 ) across 500 sweeping samples. The mean is 0.007 with standard deviation 0.058, concentrated tightly around zero. The two stages request nearly orthogonal perturbation directions, so no single 𝛿 can serve both. Panels (c–d) visualize the classifier’s penultimate feature space via UMAP (Uniform Manifold Approximation and Projection [41]) before and after PGD-200 at 𝜀=0.10. The sweeping cluster shifts slightly toward the benign region in panel (d) compared to the clean embedding in panel (c), but the three classes remain well separated. 6.2.2 Black-Box Attacks (T𝐵 ). Under T𝐵 , the adversary has no access to model weights, architecture, or gradients. We evaluate two attack strategies: (1) transfer-based attacks, which train surrogate

Aymen Bouferroum et al. Square Attack

1K

15

5K

HSJA Attack

1K

5K

11.7

ER (%)

10 4.4

5

2.3

1.3

0

Con.

Swe.

Pul.

Bur.T

Con.C

Category

Ran.B

Swe.B

Figure 12: Query-based attack evasion at 𝜀=0.10. Blue bars: Square Attack across five query budgets (1K–5K, light to dark). Red bars: HopSkipJump, 0.0% at all budgets. Stage 2 evasion stays below 0.4%.

20

(a) Constant

GAN

MagMaW

(b) Sweeping

(c) Pulse

RAA

(d) Random BF

ER (%)

models and transfer adversarial examples, and (2) query-based attacks, which probe the deployed pipeline’s output to guide optimization. All attacks apply physically realizable perturbation constraints to every sample. 1 Transfer attacks. We train four surrogate architectures that deliberately differ from Citadel’s internal models: a 4-class CNN classifier (75K parameters, 5×5 kernels), a convolutional VAE (600K parameters, latent_dim=128), a full pipeline surrogate combining a binary Stage 1 approximator with the classifier and VAE, and an ensemble of three classifiers (including a ResNet-18 with 11M parameters). Each surrogate is trained on data from the same distribution and used to craft PGD-50 adversarial examples under physically realizable constraints. Transferred perturbations undergo channel degradation before evaluation against the real Citadel pipeline, with 4,096 samples per category. Figure 11 summarizes the results. Figure 11a shows the mean E2E evasion across all seven categories for each surrogate strategy. Even at 𝜀=0.10, the strongest surrogate (ensemble) achieves only 0.37% mean ASR. The per-category breakdown in Figure 11b reveals that four of seven categories (constant, pulse, random bruteforce, sweeping bruteforce) achieve 0.0% transfer ASR at every 𝜀. The only category exceeding 1% is burst triangle (1.95% at 𝜀=0.10, ensemble surrogate), which is also the hardest scenario in clean (non-adversarial) conditions. It is the only zero-day with sub-100% Stage 1 trigger rate (97.5%) and the only one with measurable benign leakage (5.1%). The transfer “success” on burst triangle is consistent with its clean-condition miss rate, indicating that the perturbation does not open a new evasion pathway. When targeting Stage 2 in isolation (bypassing Stage 1), transfer ASR is 0.0% across all 112 configurations, confirming that the multi-signal OOD ensemble is opaque to surrogate-based transfer. 2 Query-based attacks. Figure 12 compares score-based (Square Attack [42]) and decision-based (HopSkipJump [43]) attacks at 𝜀=0.10 with 4,096 samples per category and query budgets from 1,000 to 5,000 per sample (lower 𝜀 values yield strictly lower evasion). Square Attack reaches 11.0% on burst triangle and 4.1% on sweeping at 2,000 queries, with marginal improvement up to 5,000 queries (11.7% and 4.4%). Three of seven categories remain at 0.0% regardless of budget. Notably, Square Attack achieves higher per-category evasion than the white-box gradient attacks in Section 6.2.1. This is a known phenomenon in multi-component defenses [30]. Gradientbased attackers must solve a joint optimization over all components simultaneously, and the near-orthogonal gradient directions between Stage 1 and Stage 2 (Section 6.2.1) prevent the optimizer from concentrating its budget on any single component. Scorebased query attacks face no such coupling. Square Attack treats the pipeline as a scalar oracle and can allocate perturbation budget freely, occasionally finding perturbations that reduce the Stage 1 trigger score without the conflicting Stage 2 gradient pulling in the opposite direction. Stage 2 evasion stays below 0.4% across all categories and budgets for both attacks, meaning the pipeline evasion comes from Stage 1 boundary cases. HopSkipJump achieves 0.0% across all 70 configurations. As a minimum-distance boundary attack, HopSkipJump searches for the nearest decision-boundary crossing. Stage 1’s large confidence margin places the boundary far from the clean attack distribution, so the nearest adversarial examples require perturbation magnitudes that exceed every 𝜀 we evaluate.

10

0 PB1

PB2

PB3

PB4 PB1

Pert. Budget

PB2

PB3

PB4 PB1

Pert. Budget

PB2

PB3

PB4 PB1

Pert. Budget

PB2

PB3

PB4

Pert. Budget

Figure 13: Stage 2 evasion under three SOTA black-box generators. Perturbation budgets PB1–PB4 correspond to 𝜀 ∈ {0.01, 0.03, 0.05, 0.10} for GAN and Magmaw, and PSR ∈ { −10, −13, −16, −20} dB for RAA. Stage 2 evasion remains below 5% on all known attacks (a–c). Only Magmaw achieves non-trivial evasion on the zero-day category (d), reaching 18.5% at PB4.

6.2.3 State-of-the-Art (SOTA) Adaptive Attacks. We evaluate three learned perturbation generators in black-box mode with physically realizable constraints. A GAN-based generator [44] that trains an adversarial network to produce evasion perturbations, Magmaw [19] which uses manifold-aware projections to craft transferable CSI perturbations, and RAA [23] which applies random additive perturbations with power-level control. Each generator is trained against surrogate models on data from the same distribution and evaluated against Citadel’s full pipeline. Following the pattern established in Section 6.2.2, where query-based evasion was traced to Stage 1 boundary cases while Stage 2 remained below 0.4%, we evaluate Stage 2 resilience as the security-relevant metric. Stage 1 functions as a computational filter (Section 6.1.4). The multi-signal OOD ensemble in Stage 2 is the security boundary. Figure 13 shows Stage 2 evasion across three known-attack categories and one zero-day category (random bruteforce) for all three generators. On known attacks (panels a–c), Stage 2 evasion stays below 4.7% at every 𝜀, including the extreme budget 𝜀=0.10. Constant jamming (panel a) yields 0.0% for all three generators across all budgets. The zeroday category random bruteforce (panel d) separates the generators. Magmaw is the only attack that achieves non-trivial Stage 2 evasion (18.5% at 𝜀=0.10), while GAN and RAA remain below 0.5%. Even under the strongest published CSI attack (Magmaw), Stage 2 evasion on known attacks remains below 4.7%, confirming that the multi-signal ensemble resists all three attack families. The elevated evasion on random bruteforce (18.5% at 𝜀=0.10) occurs only at an

CITADEL: CSI-Based Jamming Detection and Open-Set Classification for IIoT Networks

Table 4: Comparative evaluation against eight baselines on detection performance and adversarial robustness. Magmaw: E2E evasion at 𝜀=0.05. Resource costs measured on Jetson Orin Nano (batch 1, FP32).

Attack/Alert

Undiscovered Attack

(a) Clean Zero-Day Detection

False Alert

(b) MagMaW Adversarial Attack

Attacks CITADEL MSP

Detection Performance Method

Known DR

Citadel (S1) Citadel (E2E)

ZD FPR DR

Resource Cost

KNN-OOD

Magmaw (%↓)

Params

Lat. (ms)

Energy (mJ)

– – 100.0 97.1

– – 0.4 4.2 (S2:0.2)

1.4K 2,845K

1.1 14.2

6.5 95.9

32.7 44.8 46.7 4.7

38.8 50.2 44.0 1.9

20.0 20.8 24.3 9.7

56.1 41.7 42.3 96.6

423K† 423K† 423K† 423K†

2.0 2.0 2.0 2.0

12.6 12.5 12.5 12.5

64.0 35.9 99.1 99.9

82.8 26.4 44.8 55.9

13.2 12.4 0.1 5.8

23.5 67.6 92.3 48.4

154K 47K 423K† 913K

1.3 1.2 2.0 0.9

7.3 6.8 12.6 5.3

Domain-specific detectors JADE [49] BloodHound+ [14] JamShield [13] HussainEdge [10]

† Shared CSI2DClassifier backbone (422.5K params); post-hoc scoring adds negligible overhead.

extreme perturbation budget and on a single zero-day category, validating Magmaw as a conservative stress test for the comparative evaluation (Section 6.3). A key architectural property reinforces these results. Stage 1 executes on the sensor node itself, processing CSI internally before any data leaves the device. An RF-domain attacker has no channel to selectively suppress Stage 1 without simultaneously altering the CSI measurements that Stage 2 analyzes. The generators that achieve high E2E bypass rates (e.g., Magmaw at 57.9% on sweeping at 𝜀=0.10) do so by suppressing the broadband spectral energy that Stage 1 monitors, causing suspicious windows to not be escalated. However, this is a computational shortcut, not a security breach. Any attack strong enough to compromise the protected link must perturb CSI, and once escalated, Stage 2 detects it with less than 0.2% evasion. Stage 1 bypass without Stage 2 evasion means the attack either goes undetected because it is too weak to affect the link, or is caught the moment it becomes operationally relevant. The security boundary is Stage 2, and no generator breaches it within realizable budgets.

6.3

ViM JADE BloodHound+ JamShield

Post-hoc OOD detectors MSP [45] KNN-OOD [46] ASH-S [47] ViM [48]

ASH

Comparative Evaluation

To contextualize Citadel’s performance, we compare against eight detection methods (Table 4) spanning four categories: post-hoc OOD detectors originally designed for image classification (MSP [45], KNN-OOD [46], ASH-S [47], ViM [48]), reconstruction-based anomaly detectors (JADE [49], BloodHound+ [14]), and signal-level WiFi detectors (JamShield [13], HussainEdge [10]). All methods are reimplemented on CSI data using the same training set and evaluation protocol. Post-hoc methods use two-class backbone on normal traffic, domain-specific methods use four-class supervised backbone. Citadel is the only method that achieves high detection across all three dimensions. HussainEdge (99.9%) and JamShield (99.1%) approach Citadel’s 100% on known attacks but collapse on zeroday scenarios (55.9% and 44.8% respectively). Conversely, JADE achieves the highest baseline zero-day rate (82.8%) but detects only 64.0% of known attacks and suffers 23.5% evasion under Magmaw. The post-hoc OOD methods fail to transfer to the CSI domain. ViM achieves only 1.9% zero-day detection and 96.6% Magmaw evasion,

HussainEdge 10

15

20

Elapsed Time [hours]

25

Figure 14: 15-hour operational timeline from testbed data. Each row represents one detection method. (a) Zero-day attacks without adversarial perturbation; Citadel detects all injected attacks while baselines miss up to 100% of zero-day scenarios. (b) Known attacks under Magmaw (𝜀=0.05); Citadel maintains 4.2% E2E evasion.

confirming that virtual-logit augmentation does not generalize to spectrotemporal data. Under Magmaw at 𝜀=0.05, Citadel’s E2E evasion (4.2%) is 6 times lower than JADE (23.5%) and 22 times lower than JamShield (92.3%). The 4.2% average includes sweeping (16.3%), where the generator learns to suppress Stage 1’s trigger, while constant, pulse, and random bruteforce remain below 0.5%. At the Stage 2 security boundary, evasion drops to 0.2% (Section 6.2.3). Three failure modes explain this. Confidence-based methods rely on a single discriminative pathway that the generator can target without constraint. Reconstruction-based methods offer partial robustness but a lone reconstruction signal gives the attacker a single optimization target. Signal-level methods (JamShield, HussainEdge) operate on aggregate statistics sensitive to small CSI modifications within realizable bounds. Citadel’s multi-signal ensemble forces the attacker to satisfy conflicting objectives simultaneously, and no generator achieves this within realizable budgets. Figures 14 provide an operational perspective, monitoring a 15hour session. In Figure 14a, Citadel’s alert stream mirrors the ground truth while post-hoc methods produce near-continuous false alerts. Under Magmaw (Figure 14b), Citadel remains intact while JamShield collapses to near-total evasion. No baseline maintains both detection completeness and false-alarm control under adversarial conditions. Resource cost. Citadel’s two-stage design amortizes its cost. Stage 1 runs on every window in 1.1 ms at 6.5 mJ on the Jetson, filtering 92% of benign traffic before Stage 2 is invoked. On the target ESP32C6 microcontroller, the same model completes inference in 9.4 ms within 17 KiB of SRAM (Appendix H). Worst-case E2E cost is 14.2 ms at 95.9 mJ, with 20.4 MB peak memory and 0.167 GFLOPs. Singlestage baselines are faster but at substantially weaker detection and robustness. Stage 2 overhead is dominated by two classifier passes (4.1 ms), VAE encode/decode (3.9 ms), and diffusion denoising (4.4 ms), completing well within the 250 ms inter-window budget at 4 Hz CSI sampling (RQ4).

Aymen Bouferroum et al.

7

Limitations and Discussion

Generalization Beyond Controlled Environments. Our evaluation was conducted in a controlled laboratory with a single jammer model (HackRF One) and fixed sensor topology. Production IIoT floors introduce metallic reflectors, co-channel interference, and environmental non-stationarities (e.g., shift changes, moving personnel) that the current training distribution does not fully capture. While the system’s reliance on the physical invariant (jamming inevitably perturbs CSI) is environment-agnostic, the calibrated OOD thresholds are environment-specific. Deploying Citadel in a new facility would require a site-specific calibration phase, analogous to the commissioning step common in industrial monitoring systems. Future work should validate detection performance through field trials in operational factories and investigate online recalibration strategies that adapt to environmental drift without retraining. Spectral and Temporal Coverage. Citadel monitors a single 20 MHz channel at approximately 4 Hz, imposing two coverage boundaries. Spectrally, detection is confined to the monitored channel. Facilities operating multiple access points on non-overlapping channels would require per-channel deployment to achieve full spectral coverage. Correlating CSI streams across access points would introduce spatial and spectral diversity to broaden protection. Temporally, the 8-second observation window means sub-100 ms microbursts may produce insufficient distortion to trigger the ensemble. Higher acquisition rates on Wi-Fi 6/6E chipsets or 5G New Radio reference signals [50] would improve temporal resolution and broaden applicability beyond the current testbed. Simulated vs. Over-the-Air Adversarial Validation. The adversarial evaluation enforces physical realizability through differentiable projections (C1–C3) in the digital domain. These constraints capture necessary conditions for over-the-air feasibility. A realtime adversarial transmitter would face additional impairments that further degrade the attacker’s effective budget. The sub-2% gradient-based evasion reported in Section 6.2.1 is therefore likely a conservative estimate of deployed robustness, but validating this requires closed-loop experiments with a second SDR transmitting adversarial waveforms while Citadel operates in real time. The construction of such a testbed, along with a standardized benchmark for physically realized adversarial attacks on wireless ML systems, represents an important direction for the broader community.

8

Related Work

Jamming detection. Section 1 compared four sensing modalities (Figure 1). Here we position Citadel against the systems built on them. RSS-based [10] and cross-layer [13] detectors achieve high known-attack accuracy but offer no path to zero-day generalization. Reconstruction-based approaches [14, 49] provide zero-day capability through deviation scoring but sacrifice discriminative precision on known attacks. At the physical layer, I/Q spectrogram classifiers [51, 52] demonstrated supervised detection without addressing unseen waveforms or adversarial conditions. The first CSIbased study on ESP32 [18] confirmed jamming sensitivity without building a complete pipeline. SpotLight [53] proposed generative anomaly detection for Open RAN but targets cellular infrastructure

rather than IIoT. No prior system unifies known-attack classification, zero-day OOD detection, adversarial evaluation, and hardware deployment. Adversarial attacks on wireless systems. The adversarial challenge (RQ3) motivated physically constrained evaluation. We detail the constraint gap in existing attack models. RAA [23] bounds perturbation power but does not enforce subcarrier correlation or temporal coherence. Magmaw [19] adds OFDM-aware preamble corruption but omits indoor-propagation constraints. Practical over-the-air attacks [24, 54, 55] demonstrate feasibility but target single-model defenses. Phantom-CSI [56] further showed that adversarially crafted CSI patterns can fool liveness detectors. All these works highlight that unconstrained digital perturbations ignore physical propagation effects, motivating the constrained evaluation methodology [25, 29, 30] that Citadel adopts. OOD detection and adversarial-resilient systems. The OOD methods evaluated in Section 6.3 were designed for high-dimensional image data. Our results confirm that they do not transfer to the temporally correlated structure of CSI. Diffusion models have been applied to adversarial purification [35] and anomaly detection [34], but only in the image domain. In network intrusion detection, MANDA [57] fuses manifold inconsistency with boundary scoring but requires adversarial training data, NIDS-DA [58] operates at high FPR, and AdvPurRec [59] achieves limited recovery on tabular traffic. All operate on network-flow features. None are evaluated under wireless-specific attacks. The closest architectural parallel is the multi-stage IDS of [60]. Citadel extends this paradigm to the physical layer with a microcontroller-deployable first stage, a three-signal OOD ensemble calibrated without zero-day data, and evaluation under physically realizable constraints.

9

Conclusion

We presented Citadel, a two-stage hierarchical system for detecting RF jamming attacks against wireless links in IIoT environments using only CSI (RQ1). By decomposing detection across hardware tiers, a lightweight binary trigger on ESP32 microcontrollers at the field level and a multi-signal OOD ensemble on an edge GPU at the supervisory level, Citadel achieves both the computational efficiency required for real-time edge deployment and the detection depth needed to identify previously unseen attack strategies. On 15 zero-day scenarios (RQ2), the system detects 97.1% of attack windows as anomalous while maintaining a 0.4% E2E FPR, demonstrating that the fusion of KL divergence, energy scoring, and Mahalanobis distance in orthogonal information spaces provides robust generalization without any zero-day supervision. Under adversarial (RQ3) evaluation spanning white-box and black-box threat models, gradient-based evasion stays below 2% at every tested perturbation budget, while the strongest published CSI attack generator achieves less than 5% average evasion, confirming that the two-stage architecture imposes conflicting optimization objectives that prevent simultaneous evasion of both pipeline stages. The entire pipeline runs in real time on edge hardware (RQ4), completing end-to-end inference in 14.2 ms at 95.9 mJ.

References [1] A.-R. Sadeghi, C. Wachsmann, and M. Waidner, “Security and privacy challenges in industrial Internet of Things,” in Proceedings of the 52nd Annual Design

CITADEL: CSI-Based Jamming Detection and Open-Set Classification for IIoT Networks

Automation Conference. ACM, 2015, pp. 1–6. [2] M. Serror, S. Hack, M. Henze, M. Schuba, and K. Wehrle, “Challenges and opportunities in securing the industrial Internet of Things,” IEEE Transactions on Industrial Informatics, vol. 17, no. 5, pp. 2985–2996, 2021. [3] H. Kayan, M. Nunes, O. Rana, P. Burnap, and C. Perera, “Cybersecurity of industrial cyber-physical systems: A review,” ACM Computing Surveys, vol. 54, no. 11s, pp. 1–35, 2022. [4] W. Xu, W. Trappe, Y. Zhang, and T. Wood, “The feasibility of launching and detecting jamming attacks in wireless networks,” in Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing. ACM, 2005, pp. 46–57. [5] H. Pirayesh and H. Zeng, “Jamming attacks and anti-jamming strategies in wireless networks: A comprehensive survey,” IEEE Communications Surveys & Tutorials, vol. 24, no. 2, pp. 767–809, 2022. [6] A. S. Ali, M. Baddeley, L. Bariah, M. Andreoni Lopez, W. T. Lunardi, J.-P. Giacalone, and S. Muhaidat, “JamRF: Performance analysis, evaluation, and implementation of RF jamming over Wi-Fi,” IEEE Access, vol. 10, pp. 133 370–133 384, 2022. [7] R. M. Lee, M. J. Assante, and T. Conway, “German steel mill cyber attack,” Industrial Control Systems, vol. 30, no. 62, pp. 1–15, 2014. [8] M. Iaiani, A. Tugnoli, P. Macini, and V. Cozzani, “Outage and asset damage triggered by malicious manipulation of the control system in process plants,” Reliability Engineering & System Safety, vol. 213, p. 107685, 2021. [9] D. Quarta, M. Pogliani, M. Polino, F. Maggi, A. M. Zanchettin, and S. Zanero, “An experimental security analysis of an industrial robot controller,” in 2017 IEEE Symposium on Security and Privacy (SP). IEEE, 2017, pp. 268–286. [10] A. Hussain, N. Abughanam, J. Qadir, and A. Mohamed, “Jamming detection in IoT wireless networks: An edge-AI based approach,” in Proceedings of the 12th International Conference on the Internet of Things. ACM, 2023, pp. 57–64. [11] O. Puñal, I. Aktas, C.-J. Schnelke, G. Abidin, K. Wehrle, and J. Gross, “Machine learning-based jamming detection for IEEE 802.11: Design and experimental evaluation,” in 2014 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2014, pp. 1–10. [12] M. Hachimi, G. Kaddoum, G. Gagnon, and P. Illy, “Multi-stage jamming attacks detection using deep learning combined with kernelized support vector machine in 5G cloud radio access networks,” in 2020 International Symposium on Networks, Computers and Communications (ISNCC), 2020, pp. 1–5. [13] I. Panitsas, Y. Yigit, L. Tassiulas, L. Maglaras, and B. Canberk, “JamShield: A machine learning detection system for over-the-air jamming attacks,” in ICC 2025 – IEEE International Conference on Communications, 2025, pp. 1067–1072. [14] S. Sciancalepore, F. Kusters, N. K. Abdelhadi, and G. Oligeri, “Jamming detection in low-BER mobile indoor scenarios via deep learning,” IEEE Internet of Things Journal, vol. 11, no. 8, pp. 14 682–14 697, 2024. [15] D. Halperin, W. Hu, A. Sheth, and D. Wetherall, “Tool release: Gathering 802.11n traces with channel state information,” ACM SIGCOMM Computer Communication Review, vol. 41, no. 1, p. 53, 2011. [16] Espressif Systems, “ESP-CSI: Applications based on Wi-Fi CSI (Channel State Information),” https://github.com/espressif/esp-csi, 2021, accessed: April 2026. [17] F. Gringoli, M. Schulz, J. Link, and M. Hollick, “Free your CSI: A channel state information extraction platform for modern Wi-Fi chipsets,” in Proceedings of the 13th International Workshop on Wireless Network Testbeds, Experimental Evaluation & Characterization, 2019, pp. 21–28. [18] P. Mykytyn, R. Chitauro, Z. Dyka, and P. Langendoerfer, “Channel state information analysis for jamming attack detection in static and dynamic UAV networks,” in 2025 21st International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT), 2025, pp. 322–327. [19] J.-W. Chang, K. Sun, N. Heydaribeni, S. Hidano, X. Zhang, and F. Koushanfar, “Magmaw: Modality-agnostic adversarial attacks on machine learning-based wireless communication systems,” in Proceedings of the 32nd Network and Distributed System Security Symposium (NDSS), 2025. [20] Y. Zhang, Y. Yin, Y. Wang, J. Ai, and D. Wu, “CSI-based location-independent human activity recognition with parallel convolutional networks,” Computer Communications, vol. 197, pp. 87–95, 2023. [21] I. J. Goodfellow, J. Shlens, and C. Szegedy, “Explaining and harnessing adversarial examples,” in 3rd International Conference on Learning Representations (ICLR 2015), 2015. [Online]. Available: https://arxiv.org/abs/1412.6572 [22] M. Sadeghi and E. G. Larsson, “Adversarial attacks on deep-learning based radio signal classification,” IEEE Wireless Communications Letters, vol. 8, no. 1, pp. 213–216, 2019. [23] A. Bahramali, M. Nasr, A. Houmansadr, D. Goeckel, and D. Towsley, “Robust adversarial attacks against DNN-based wireless communication systems,” in Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, 2021, pp. 126–140. [24] C. Li, M. Xu, Y. Du, L. Liu, C. Shi, Y. Wang, H. Liu, and Y. Chen, “Practical adversarial attack on WiFi sensing through unnoticeable communication packet perturbation,” in Proceedings of the 30th Annual International Conference on Mobile Computing and Networking (MobiCom), 2024, pp. 373–387. [25] A. Chernikova and A. Oprea, “FENCE: Feasible evasion attacks on neural networks in constrained environments,” ACM Transactions on Privacy and Security,

vol. 25, no. 4, pp. 34:1–34:34, 2022. [26] A. Athalye, N. Carlini, and D. Wagner, “Obfuscated gradients give a false sense of security: Circumventing defenses to adversarial examples,” in Proceedings of the 35th International Conference on Machine Learning, ser. Proceedings of Machine Learning Research, vol. 80. PMLR, 2018, pp. 274–283. [27] International Society of Automation, “ANSI/ISA-95: Enterprise-control system integration,” International Standard, 2010, series of standards, Parts 1–5, published 2000–2025. [28] International Electrotechnical Commission, “IEC 62443: Security for industrial automation and control systems,” International Standard, 2018, series of standards published 2009–2023. [29] N. Carlini, A. Athalye, N. Papernot, W. Brendel, J. Rauber, D. Tsipras, I. Goodfellow, A. Madry, and A. Kurakin, “On evaluating adversarial robustness,” 2019. [30] F. Tramèr, N. Carlini, W. Brendel, and A. Madry, “On adaptive attacks to adversarial example defenses,” in Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 1633–1645. [31] J. Hu, L. Shen, and G. Sun, “Squeeze-and-excitation networks,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2018, pp. 7132–7141. [32] D. P. Kingma and M. Welling, “Auto-encoding variational Bayes,” in 2nd International Conference on Learning Representations (ICLR 2014), 2014. [Online]. Available: https://arxiv.org/abs/1312.6114 [33] O. Ronneberger, P. Fischer, and T. Brox, “U-Net: Convolutional networks for biomedical image segmentation,” in Medical Image Computing and ComputerAssisted Intervention – MICCAI 2015, ser. Lecture Notes in Computer Science, vol. 9351. Springer, 2015, pp. 234–241. [34] J. Ho, A. Jain, and P. Abbeel, “Denoising diffusion probabilistic models,” in Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 6840–6851. [35] W. Nie, B. Guo, Y. Huang, C. Xiao, A. Vahdat, and A. Anandkumar, “Diffusion models for adversarial purification,” in Proceedings of the 39th International Conference on Machine Learning (ICML), ser. Proceedings of Machine Learning Research, vol. 162. PMLR, 2022, pp. 16 805–16 827. [36] W. Liu, X. Wang, J. D. Owens, and Y. Li, “Energy-based out-of-distribution detection,” in Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 21 464–21 475. [37] K. Lee, K. Lee, H. Lee, and J. Shin, “A simple unified framework for detecting out-of-distribution samples and adversarial attacks,” in Advances in Neural Information Processing Systems, vol. 31, 2018, pp. 7167–7177. [38] O. Ledoit and M. Wolf, “A well-conditioned estimator for large-dimensional covariance matrices,” Journal of Multivariate Analysis, vol. 88, no. 2, pp. 365–411, 2004. [39] PortaPack Mayhem Contributors, “Mayhem firmware for PortaPack/HackRF,” https://github.com/portapack-mayhem/mayhem-firmware, 2024, accessed: April 2026. [40] A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu, “Towards deep learning models resistant to adversarial attacks,” in 6th International Conference on Learning Representations (ICLR 2018), 2018. [Online]. Available: https://openreview.net/forum?id=rJzIBfZAb [41] L. McInnes, J. Healy, and J. Melville, “UMAP: Uniform manifold approximation and projection for dimension reduction,” arXiv preprint arXiv:1802.03426, 2018. [42] M. Andriushchenko, F. Croce, N. Flammarion, and M. Hein, “Square attack: A query-efficient black-box adversarial attack via random search,” in European Conference on Computer Vision (ECCV). Springer, 2020, pp. 484–501. [43] J. Chen, M. I. Jordan, and M. J. Wainwright, “HopSkipJumpAttack: A queryefficient decision-based attack,” in IEEE Symposium on Security and Privacy (SP). IEEE, 2020, pp. 1277–1294. [44] E. Alhajjar, P. Maxwell, and N. Bastian, “Adversarial machine learning in network intrusion detection systems,” Expert Systems with Applications, vol. 186, p. 115782, 2021. [45] D. Hendrycks and K. Gimpel, “A baseline for detecting misclassified and out-of-distribution examples in neural networks,” in 5th International Conference on Learning Representations (ICLR 2017), 2017. [Online]. Available: https://openreview.net/forum?id=Hkg4TI9xl [46] Y. Sun, Y. Ming, X. Zhu, and Y. Li, “Out-of-distribution detection with deep nearest neighbors,” in Proceedings of the 39th International Conference on Machine Learning, ser. Proceedings of Machine Learning Research, vol. 162. PMLR, 2022, pp. 20 827–20 840. [47] A. Djurisic, N. Bozanic, A. Ashok, and R. Liu, “Extremely simple activation shaping for out-of-distribution detection,” in 11th International Conference on Learning Representations (ICLR 2023), 2023. [Online]. Available: https: //openreview.net/forum?id=ndYXTEL6cZz [48] H. Wang, Z. Li, L. Feng, and W. Zhang, “ViM: Out-of-distribution with virtuallogit matching,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2022, pp. 4911–4920. [49] C. Kilinc, M. K. Marina, M. Usama, S. Ergüt, J. Crowcroft, T. Gundogdu, and I. Akinci, “JADE: Data-driven automated jammer detection framework for operational mobile networks,” in IEEE INFOCOM 2022 – IEEE Conference on Computer Communications, 2022, pp. 1139–1148.

Aymen Bouferroum et al.

[50] M. Lichtman, R. Piqueras Jover, M. Labib, R. M. Rao, V. Marojevic, and J. H. Reed, “LTE/LTE-A jamming, spoofing, and sniffing: Threat assessment and mitigation,” IEEE Communications Magazine, vol. 54, no. 4, pp. 54–61, 2016. [51] M. Varotto, S. Valentin, and S. Tomasin, “Detecting 5G signal jammers using spectrograms with supervised and unsupervised learning,” in 2024 IEEE International Conference on Communications Workshops (ICC Workshops), 2024, pp. 767–772. [52] M. Hanegraaf, S. Sciancalepore, and G. Oligeri, “Weak-jamming detection in IEEE 802.11 networks: Techniques, scenarios and mobility,” Computer Networks, vol. 280, p. 112160, 2026. [53] C. Sun, U. Pawar, M. Khoja, X. Foukas, M. K. Marina, and B. Radunovic, “SpotLight: Accurate, explainable and efficient anomaly detection for open RAN,” in Proceedings of the 30th Annual International Conference on Mobile Computing and Networking (MobiCom), 2024, pp. 923–937. [54] Z. Liu, C. Xu, E. Sie, G. Singh, and D. Vasisht, “Exploring practical vulnerabilities of machine learning-based wireless systems,” in 20th USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2023, pp. 1801–1817. [55] Y. Zhou, C. Li, H. Chen, and Q. Zhang, “RIStealth: Practical and covert physicallayer attack against WiFi-based intrusion detection via reconfigurable intelligent surface,” in Proceedings of the 21st ACM Conference on Embedded Networked Sensor Systems (SenSys), 2024, pp. 195–208. [56] Q. He and S. Fang, “Phantom-CSI attacks against wireless liveness detection,” in Proceedings of the 26th International Symposium on Research in Attacks, Intrusions and Defenses. ACM, 2023, pp. 440–454. [57] N. Wang, Y. Chen, Y. Xiao, Y. Hu, W. Lou, and Y. T. Hou, “MANDA: On adversarial example detection for network intrusion detection system,” IEEE Transactions on Dependable and Secure Computing, vol. 20, no. 2, pp. 1139–1153, 2023. [58] V. Kumar, K. Kumar, M. Singh, and N. Kumar, “NIDS-DA: Detecting functionally preserved adversarial examples for network intrusion detection system using deep autoencoders,” Expert Systems with Applications, vol. 270, p. 126513, 2025. [59] N. Alhussien and A. Aleroud, “AdvPurRec: Strengthening network intrusion detection with diffusion model reconstruction against adversarial attacks,” in Proceedings of the IEEE 23rd International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2024, pp. 1638–1646. [60] M. Verkerken, L. D’Hooge, D. Sudyana, Y.-D. Lin, T. Wauters, B. Volckaert, and F. De Turck, “A novel multi-stage approach for hierarchical intrusion detection,” IEEE Transactions on Network and Service Management, vol. 20, no. 3, pp. 3915– 3929, 2023.

B

Man-in-the-Middle Threat Analysis

In addition to the threat models evaluated in the main body, we define a man-in-the-middle threat model (TMITM ) for completeness. The adversary compromises the gateway between Stage 1 and Stage 2, modifying CSI tensors in the digital domain after RF-todigital conversion. The attacker can inject arbitrary digital perturbations but cannot retroactively alter the Stage 1 decision already made on the sensor node, testing Stage 2’s independent robustness in isolation. Our evaluation confirmed that replay attacks achieve 93.7% evasion while combined attacks reach 100%, but random perturbations remain limited to 13.5% maximum evasion, validating Stage 2’s resilience against non-replay digital manipulation. Protocol-level countermeasures mitigate TMITM independently of the ML pipeline: mutual TLS v1.3 authentication between sensor nodes and the edge tier prevents unauthorized gateway substitution; a periodic heartbeat watchdog (configurable interval, default 5 s) detects link interruption consistent with active interception; and cryptographic nonces attached to each CSI window enable the edge tier to reject replayed or reordered measurements. These defenses operate at the transport layer and are orthogonal to Citadel’s detection pipeline.

C

Dataset Statistics

Table 5 provides the complete dataset breakdown. Table 5: Dataset composition and split sizes. All splits are temporal with 128-window data-split purge gaps to prevent autocorrelation leakage.

Category

Windows

Benign Traffic (264,014) Quiet Movement

A

In-distribution OOD by design

Known Attacks (18 scenarios, 366,796) Constant (6) ∼122k 2 waveforms × 3 powers Sweeping (6) ∼122k 2 waveforms × 3 powers Pulse (6) ∼122k 2 waveforms × 3 powers

Ethical Considerations

This work involves the deliberate generation of RF jamming signals, which raises ethical considerations regarding spectrum interference and potential misuse. Controlled environment. All RF jamming experiments were conducted in a controlled laboratory environment at low to moderate power levels (IF gain 10–20 dB, well below the HackRF One’s 47 dB hardware maximum, with the RF amplifier permanently disabled). No production IIoT systems, public WiFi networks, or third-party communications were disrupted at any point during data collection. Defensive purpose. The jamming attack tooling and adversarial evaluation framework are developed and released solely to enable reproducible evaluation of defensive detection systems. The attack scenarios are designed to stress-test Citadel and baseline detectors under realistic conditions, following established responsibledisclosure practices in the wireless security community. Dual-use considerations. While the jamming scripts and adversarial attack implementations could theoretically be repurposed for offensive use, the techniques they implement (SDR-based interference, gradient-based evasion) are already well-documented in the public literature [6, 19, 23]. Releasing our implementations alongside the defensive system provides net benefit by enabling the community to evaluate and improve jamming defenses.

203,536 60,478

Notes

Zero-Day (15 scenarios, 184,508) Novel timing (8) Varies Novel waveform (7) Varies

>815k

Total Data Split Train Validation Test

D

Random + Burst Known timing, new wfm

70% Temporal split 15% 5-fold blocked CV 15% Final evaluation

Zero-Day Coverage Matrix

Table 6: Zero-day coverage matrix. K = known (training), Z = zero-day (test). The 15 zero-day scenarios span two novelty axes: novel timing (random/burst columns) and novel waveforms on known timing.

Waveform

Const.

Sweep

Pulse

Rand.

Burst

Total

Gaussian QPSK Bruteforce Chirp FSK Sawtooth Square Triangle

K K – Z – – – –

K K Z – Z Z – –

K K Z Z – – – Z

– – Z Z Z Z Z Z

– – – Z – – – Z

3K 3K 3Z 4Z 2Z 2Z 1Z 3Z

6K+1Z

6K+3Z

6K+3Z

6Z

2Z

18K+15Z

Total

CITADEL: CSI-Based Jamming Detection and Open-Set Classification for IIoT Networks

Training Convergence

Figure 15 shows the training dynamics of the three Stage 2 components.

94 0

Epoch

0.4

0.2 0

10

Epoch

100

−4

1

Epoch

1000

Calibration Configuration

Table 7 lists the OOD detection calibration parameters determined via 5-fold blocked temporal cross-validation. Table 7: OOD calibration parameters. AllF thresholds from out-offold (OOF) scores via 5-fold blocked temporal CV with 256-window Kfold purge gaps (larger than data-split gaps for stricter fold isolation).

G

r=0.27

0 0

Figure 15: Training convergence. (a) Classifier loss and accuracy over 50 epochs. (b) VAE loss with KL weight warmup over 100 epochs. (c) Diffusion DDPM loss over 1,000 epochs (log scale).

F

Zero-Day

2

0.4 0.3

Known Attack r=-0.16

3

1.0 0.6

0.3

50

(c) Diffusion

λKL Loss

Loss

96

0.5

10−3

Benign

Smooth.

λKL

Loss

98

0.6

Accuracy (%)

100

0.7

Val. Acc

(b) VAE

KLD

Val. Loss

Parameter

Method

Value

S1 threshold (𝜏1 ) Quiet anomaly thresh. Attack anomaly thresh. KLD extreme override Ensemble weights Diffusion timestep (𝑡 ) Temperature (𝑇 ) KLD soft scoring

P90 normal val. P90 OOF quiet P95 OOF attack P99.5 OOF Equal Sweep (28 configs) Sweep (28 configs) P98 upper bound

0.293 0.7456 0.2698 3.1873 1, 1, 1 3 3 3 10 0.5 Decoupled

OOD Signal Independence

Figure 16 shows the pairwise scatter matrix of the three OOD signals (triggered samples only). Diagonal panels display per-class KDE distributions. Off-diagonal panels show pairwise scatter plots with Pearson correlation coefficients annotated. The correlations are consistently low across all pairs: • KLD vs. Energy (𝑟 = −0.16): weakly negative. High KLD (VAE reconstruction failure) does not imply low classifier confidence; these signals operate in different representation spaces (latent vs. logit). • KLD vs. Mahalanobis (𝑟 = 0.27): weakly positive. Both increase for zero-day attacks but through different mechanisms (reconstruction divergence vs. feature-space distance). For zero-day traffic specifically, this correlation drops to 𝑟 = 0.04, confirming near-independence on the target class. • Energy vs. Mahalanobis (𝑟 = 0.42): moderate. Both rely on the classifier’s feature space, explaining the highest pairwise correlation. Even so, 𝑟 2 = 0.18, meaning 82% of variance is unshared. These low correlations justify the equal-weight ( 13 , 13 , 13 ) fusion strategy: since the signals are largely non-redundant, a weighted combination captures strictly more information than any single

r=-0.16

Energy

Tr. Loss

(a) Stage-2 Classifier

signal. Optimizing the weights via grid search yielded no significant improvement over equal weighting, consistent with the low redundancy observed here.

4

−3

2 0

−4 30

r=0.42

6

−2

Mahalanobis

E

r=0.27

r=0.42

20

0.2

10 0

0.0 0

5 KLD

−4

−3 −2 Energy

0

10 20 Mahalanobis

Figure 16: Pairwise correlation of the three OOD signals across all traffic classes (triggered samples only). Diagonal panels show perclass KDE distributions; their dashed y-axes denote probability density (unitless). Off-diagonal panels show pairwise scatter plots with Pearson 𝑟 annotated. Low inter-signal correlations confirm that KLD, Energy, and Mahalanobis capture complementary information.

H

Stage 1 On-Device Inference on the ESP32-C6

The main body reports E2E inference cost on the edge GPU. This appendix provides the complementary sensor-tier measurement. Stage 1 executing on the same ESP32-C6 microcontroller that acts as the CSI sensor node in our testbed (Section 5), substantiating the microcontroller-feasibility component of RQ4. The Stage 1 TinyClassifier (1,362 parameters) is compiled to a flash-resident int8 model via batch-normalization folding into the convolutional weights followed by full int8 post-training quantization with a 400window stratified representative set, and executed on the ESP32-C6 (RV32IMAC single core at 160 MHz, ∼416 KiB of SRAM) under two independent microcontroller runtimes: TFLM 1.3 and ESP-DL v3.3.0 with scalar reference kernels for the RV32IMAC core. Both runtimes reproduce the host-side int8 simulator bit-exactly on the embedded sanity set. Numerical fidelity. Table 8 reports Stage 1 test-set performance across three numerical backends, with the threshold 𝜏 retuned on the validation split for each backend under the joint FPR/FNR below 5% constraint. The TFLite float32 backend is bit-equivalent to the folded PyTorch reference (max |Δ𝑝 | = 7×10 −7 ). Per-sample probabilities under int8 quantization shift by at most |Δ𝑝 |≈0.40 on ambiguous samples yet preserve the argmax across the test split, and the dual FPR/FNR constraint is satisfied with more than an order of magnitude of margin on the ESP32-C6. On-device inference performance. Latency on the ESP32-C6 is measured with the hardware timer esp_timer_get_time() (1 µs resolution) over 1,000 timed inferences preceded by 20 warmup

Aymen Bouferroum et al.

iterations. Table 9 summarizes the median and tail latency, on-chip memory occupancy, and throughput for both runtimes. Stage 1 fits in under 17 KiB of SRAM for either runtime, preserving the memory budget required by the ESP32-C6 Wi-Fi and TCP/IP stack and by the CSI acquisition pipeline co-resident on the sensor node. Median latency is 16.7 ms under TFLM and 9.4 ms under ESP-DL. Both are well within the 250 ms inter-window budget imposed by the 4 Hz CSI stream, leaving 15–27 times headroom for the sensor-node workload. The ESP-DL throughput of 105.8 inferences per second per core is sufficient to support multiple CSI-capable radios polled from a single ESP32-C6. Table 8: Stage 1 dual-constraint verification across numerical backends on the test split. 𝜏 is retuned on the validation split under the joint FPR/FNR below 5% constraint.

Backend PyTorch folded (f32) TFLite (f32) TFLite (int8)

𝜏

FPR

FNR

TPR

0.5770 0.5770 0.5690

0.366% 0.366% 0.414%

0.555% 0.555% 0.474%

99.445% 99.445% 99.526%

Table 9: Stage 1 on-device inference on the ESP32-C6 (single RV32IMAC core at 160 MHz). Latency is measured over 1,000 iterations after 20 warmup iterations; throughput is reported per core. Metric

TFLM

ESP-DL

Latency Median p50 (µs) Mean (µs) Tail p99 (µs)

16,703 16,703.0 16,780

9,437 9,458.1 9,645

On-chip memory Model flash (bytes) SRAM (bytes)

6,008 8,924

6,832 16,732

Throughput Inferences per second

59.9

105.8

Together with the edge-GPU figures of Section 5, these measurements close the deployment loop for RQ4. Stage 1 is not only lightweight enough to co-reside on a commodity IIoT sensor node, but also fast enough to process the CSI stream in real time while preserving the SRAM and CPU budgets required by the radio and application workloads already running on the same microcontroller.

Record · ID 299826 · SHA-256 638327bcfa40a848
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.