cs.AINov 14, 2026

Ultra-CAN: A Lightweight Blind ISAC Receiver for Chaos-Based Telemetry and Local-Seed Ranging in the Internet of Drones

Authors: Ettore Caruso, Marco Siino, Giacomo Morabito

Organizations: Politecnico di Torino, 10129 Torino, Italy · Department of Industrial, Electrical, Electronic and Computer Engineering (DIEEI), University of Catania, 95125 Catania, Italy

Abstract

The Internet of Drones (IoD) needs secure telemetry and proximity sensing within the SWaP-C constraints. We show that a single blind neural receiver driven by one chaos-based waveform performs both functions without a separate radar transceiver. In telemetry mode it decodes a peer's burst blindly; in radar mode it regenerates the per-burst chaotic reference locally and ranges the echoes of its own transmission. Ultra-CAN pairs a shared 6464-dimensional representation with two ultra-light backbones, an attention-pooled Conv1D network and a multi-head QKV network (27.627.6k--44.244.2k parameters), feeding communication and sensing heads. Both ship as int8 TensorFlow Lite Micro firmware; the Conv1D receiver decides a burst in 16.916.9 ms on a 240240 MHz microcontroller with 24.224.2 KiB of activations, a measured energy of 2.22.2-3.43.4 mJ per burst, and float-equivalent decisions, sustaining up to 5959 bit/s of telemetry or a 7.47.4 Hz range track. The two variants rank first and second among learned demodulators in four aerial swarm scenarios, with a pooled BER down to 4.6×10−44.6 \times 10^{-4} on the single-echo link (2.4×10−32.4 \times 10^{-3} with three echoes). Its sensing head identifies true obstacles in 66.8%66.8\% of peer-laden bursts (vs 42%42\% matched filtering, 44%44\% OFDM-ISAC, 48%48\% peak-picker ceiling). A peer-exclusion gate cuts peer reports from 4.4%4.4\% to 0.02%0.02\% of answered bursts, answering 23.5%23.5\% of total bursts (75%75\% on the exact tap) with 0.700.70 m/s velocity tracking. In-domain refitting recovers telemetry BER by up to three orders of magnitude under 3GPP channels, jamming-aware training restores the link, and frequency agility adds a 66--99 dB margin against partial-band jamming.

Figures & tables

Explore similar work

Mar 2, 2026

Goal-Oriented Semantic Communication for ISAC-Enabled Robotic Obstacle Avoidance

We investigate an integrated sensing and communication (ISAC)-enabled BS for the unmanned aerial vehicle (UAV) obstacle avoidance task, and propose a goal-oriented semantic communication (GOSC) framework for the BS to transmit sensing and command and control (C&C) signals efficiently and effectively. Our GOSC framework establishes a closed loop for sensing-C&C generation-sensing and C&C transmission: For sensing, a Kalman filter (KF) is applied to continuously predict UAV positions, mitigating the reliance of UAV position acquisition on continuous sensing signal transmission, and enhancing position estimation accuracy through sensing-prediction fusion. Based on the refined estimation position provided by the KF, we develop a Mahalanobis distance-based dynamic window approach (MD-DWA) to generate precise C&C signals under uncertainty, in which we derive the mathematical expression of the minimum Mahalanobis distance required to guarantee collision avoidance. Finally, for efficient sensing and C&C signal transmission, we propose an effectiveness-aware deep Q-network (E-DQN) to determine the transmission of sensing and C&C signals based on their value of information (VoI). The VoI of sensing signals is quantified by the reduction in uncertainty entropy of UAV's position estimation, while the VoI of C&C signals is measured by their contribution to UAV navigation improvement. Extensive simulations validate the effectiveness of our proposed GOSC framework. Compared to the conventional ISAC transmission framework that transmits sensing and C&C signals at every time slot, GOSC achieves the same 100% task success rate while reducing the number of transmitted sensing and C&C signals by 92.4% and the number of transmission time slots by 85.5%.
Sep 15, 2026

AeroLat: Channel-Aware Latent Space Semantic Communication for Decentralized UAV Swarms

Communication in latent space offers an intriguing alternative to symbolic messages for decentralized autonomous Unmanned Aerial Vehicle (UAV) swarms operating over bandwidth-constrained, time-varying wireless links. However, when homogeneous frozen models are prompted with discretized perceptual inputs, their broadcast states collapse toward the shared prompt template. In view of this, we propose AeroLat, a channel-aware latent semantic communication framework that uses evidence injection. The resulting latent states are then passed through an explicit communication model that encompasses bandwidth-limited serialization, additive noise and information staleness, which facilitates a joint assessment of communication fidelity and swarm-level coordination. Across multi-seed simulations, AeroLat provably remains resilient to codec choice, faults and increasing swarm size. It consistently reproduces the latent-swarm anomaly, while no-whitening controls recover the collapse. In particular, AeroLat is capable of reducing false similarity by 97.5%.
Aug 4, 2026

Task-Oriented Candidate-Latent Feedback for Coarse-to-Fine Sensing in Distributed OFDM-ISAC Networks

Future integrated sensing and communication (ISAC) architectures separate the sensing entity (SE) that acquires measurements from the sensing function (SF) that performs inference, creating a need for compact, task-oriented feedback on the SE-SF interface. Forwarding the raw channel frequency response or full per-link delay-Doppler-azimuth-elevation (DDAE) tensor is prohibitively expensive, while peak-only reporting discards target-discriminative structure under clutter. We propose a learning-based coarse-to-fine sensing pipeline with candidate-latent feedback for single-target estimation. At the SE, a lightweight convolutional scorer produces a dense delay-Doppler proposal map from pilot-based OFDM channel estimates, and a learned encoder constructs K compact C-dimensional candidate tokens by fusing per-candidate azimuth-elevation patches, normalized position, and confidence cues. The latents are uniformly quantized post-training to b bits and transmitted under a finite budget B_fb = bKC + 18K + 16 bits to the SF, which performs cross-candidate refinement, reranking, and joint four-parameter estimation. On a ray-traced urban scene with static and dynamic clutter, three operating points in the (K, C, b) design space achieve 96.33-98.88% detection at 107-806 bytes per coherent processing interval, compression ratios of 1.2-9.2 x 10^4 over the 8-bit DDAE magnitude tensor, reducing the SE-SF interface from multi-Gbit/s to sub-Mbit/s rates. Cross-scene evaluation on an independent campus-scale environment achieves 98.79-99.50% detection and at-or-better angular accuracy without retraining, indicating that the learned representation captures target-relevant structure that transports across scenes of comparable or lower clutter density.