Large Language Models (LLMs) increasingly support Uncrewed Aerial Vehicle (UAV) swarm operations such as data collection scheduling, where the model reads structured sensor reports and decides which sensors to visit. An adversary who quietly manipulates those reports can redirect the swarm without modifying the model weights or the UAV. Defenses for this interface have been proposed architecturally but rarely implemented or evaluated. We implement and evaluate defense-in-depth at the perception-reasoning interface of LLM-Centric Agentic UAV Swarms. Five layers check the provenance of a report, whether its values are physically admissible, whether they agree with what swarm geometry and service history predict, whether the resulting schedule starves any sensor, and, when these fail, hand control to a deterministic scheduler that ignores the suspect input. We test each layer against an adversary strong enough to defeat the layer before it. For each of the three input-side layers, we derive in closed form how far a report can be distorted before that layer reacts, fixing each boundary from deployment parameters before any attack data is collected; across thirty matched simulation runs, predicted and measured boundaries agree. Separating attack detection from response is a well-established principle, and we quantify the cost of neglecting this distinction at the perception-reasoning interface. When the system rejects a report, it replaces it with the most recent accepted report. This prevents the adversary from controlling the UAV schedule, but it also increases cumulative cost by 79% and 74% for the two detectors, respectively, compared with the undefended system. The safety check does not detect any attacks, but it nevertheless reduces the attack-induced cost by 37.5%.
Figures & tables
Fig. 1: Adversary capability ladder and corresponding defense layers. Arrows indicate the capability needed to bypass each layer; at A4 , no exploitable redundancy remains and evaluation shifts from detection to residual damage.
Fig. 2: Pipeline, attack points, and corresponding defense layers. Input-side layers guard observations before M4 , output-side layers guard assignments before M6 , and governance spans the slot. A1 intercepts M3→M4 , A2 controls M3 , and Amem poisons agent memory; memory remains independent of observation-side attacks, enabling the predictors in ( 23 ) and ( 24 ).
Parameter
Value
UAVs U / sensors N / horizon T
3 / 20 / 30
Region D×D / altitude H
100×100 m 2 , 100 m
Buffer Qmax / energy budget E0
60 packets / 50 J
Service volume R per visit
24 packets
Arrival mean / cap αmax
2.6 / 4 packets per slot
Attack intensity κ
3
TABLE I: Key testbed configuration parameters.
Condition
Active layers
Mean J
σ
95% CI
Γ
ASR
Fallback (%)
p
Clean, undefended
—
39.93
5.86
[37.93, 42.17]
1.00
—
0.0
—
A1 , undefended
—
124.97
19.69
[117.80, 131.93]
3.13
0.066
0.0
—
A1
L1
223.97
67.24
[200.63, 248.23]
5.61
0.001
0.0
5.2×10−6
A1
L1,L5
89.37
32.78
[78.23, 101.30]
2.24
0.002
93.3
1.9×10−4
A1
L4
93.10
26.68
[83.80, 102.73]
2.33
0.069
0.0
1.5×10−5
A1
L1,L4
165.50
53.11
[146.83, 184.10]
4.14
0.000
0.0
1.0×10−3
TABLE II: Per-layer evaluation across the adversary ladder, Nrun=30 . The ratio Γ is normalized to the clean undefended row, ASR is ( 16 ), and p is the two-sided Wilcoxon signed-rank value against the undefended attacked row. The 95% CIs are percentile-bootstrap intervals, and σ is the sample standard deviation.
Fig. 3: Detection and response, from Table II over 30 paired seeds, grouped by adversary class. Within each group, adding a detector drives the attack success rate to the floor while the degradation ratio rises above the undefended baseline. The validator L4 , which detects nothing, is the only single layer that lowers Γ against A1 . The two A4 bars are the surrogate and policy-exact adversaries, differing by 0.06 in Γ after 6,960 queries to the deployed model.
Fig. 4: Detection of A2 by L2 against the boundary κℓdet that Proposition V.2 fixes before any run. The shaded region is the interval Proposition V.1 leaves admissible on the realized geometry. The axis is broken because all rates saturate beyond κ=1.05 .
Component
Mean (ms)
% of Δt
Complexity
L1 integrity gate
0.0315
0.00063
O(N+∣σ∣)
L2 cross-modal
0.0590
0.00118
O(UN)
L3 anomaly
0.0051
0.00010
O(N)
L4 validator
0.0287
0.00057
O(NlogN)
L5 governance
0.0013
0.00003
O(1)
Stack total
0.1255
0.00251
O(UN+NlogN)
TABLE III: Per-layer added latency from ( 42 ), averaged over every five-layer condition of Table II . Percentages are of the 5 s control period.
Appendix figures & tables4 assets
Supplementary material from the paper’s appendix.
Appendix
Adversary
Onset
Γ
L2 rej.
TPR(L3)
ASR
Fallback
A3
t=1
1.02
0.208
0.033
0.001
0 1.8%
A3
t=10
0.99
0.207
0.045
0.003
0 2.2%
A2
t=1
2.24
1.000
0.033
0.002
93.6%
A2
t=10
1.48
1.000
0.043
0.000
57.1%
Appendix
TABLE IV: Sensitivity to attack onset under the full stack, 30 paired seeds per row, with rejection and detection measured on attacked slots only. The L3 column reports the adversary-caused rate; the L2 column reports the total rate, since it is the substitution rather than its cause that drives fallback occupancy.
κ
Onset TPR
Steady
95% CI
E[ slots ]
Pr[surv.]†
1.00
0.000
0.000
[0.000,0.007]
—
—
1.05
0.600
0.586
[0.546,0.626]
1.71
3×10−12
1.10
0.850
0.617
[0.577,0.656]
1.62
3×10−13
1.15
1.000
0.648
[0.609,0.686]
1.54
2×10−14
1.25
1.000
0.691
[0.653,0.728]
1.45
5×10−16
1.50
1.000
0.893
[0.865,0.916]
1.12
7×10−30
Appendix
TABLE V: Detection of A3 by L3 , over twenty calibration seeds with 580 steady-state comparisons per row and Wilson intervals. Here κ=1 carries no perturbation and reports the false-positive floor rather than a miss.
N
U
L1
L2
L3
L4
total
% Δt
00 20
0 3
0.0053
0.0244
0.0046
0.0129
0.0472
0.00094
00 50
0 5
0.0039
0.0340
0.0054
0.0154
0.0587
0.00117
0 100
10
0.0038
0.0663
0.0075
0.0228
0.1003
0.00201
0 200
20
0.0039
0.2075
0.0111
0.0374
0.2599
0.00520
0 500
30
0.0041
0.9245
0.0221
0.0541
1.0048
0.02010
1000
50
0.0048
2.9023
0.0405
0.0832
3.0308
0.06062
Appendix
TABLE VI: Per-layer latency as the field and the swarm grow, in milliseconds on the platform of Table I . Percentages are of the 5 s control period.
Link-success knee τ
Jcl
JA1
Γ
TTF
L1 rej.
0.36
79.5
511.7
0 6.4
9.1
0.18
0.49
46.3
494.6
10.7
6.8
0.09
0.62 ∗
34.4
473.5
13.8
5.3
0.04
0.75
22.5
452.9
20.1
4.1
0.03
0.91
0 8.2
432.6
52.5
3.3
0.02
∗ Operating point used in the evaluation.
Appendix
TABLE VII: Sensitivity to the link-success knee under the deterministic reference scheduler. TTF is the mean time to first service and L1 rej. the rejection fraction at κ=3 .
Artificial intelligence agent security studies attacks and safeguards for tool-using, persistent, and collaborative systems across digital and physical settings.