Metraipolis › archive › dc_c52fbff70dd0
Semantic Communication for Distributed Spectrum Monitoring over Unreliable Links — arXiv:2609.05791
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.05791
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:09:18.473Z
- SHA-256 of the archived text
716c093f3004a0f98e227473cf30fce5a14ec8c6fd013a8fcde0198425dedc09- Stable URL of this page
https://metraipolis.com/documento/dc_c52fbff70dd0
How to cite
Semantic Communication for Distributed Spectrum Monitoring over Unreliable Links — arXiv:2609.05791 — arXiv (en), https://arxiv.org/abs/2609.05791 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c52fbff70dd0 (Metraipolis archive dc_c52fbff70dd0, sha256 716c093f3004a0f98e227473cf30fce5a14ec8c6fd013a8fcde0198425dedc09)
BibTeX
@misc{dcc52fbff70dd0,
title = {Semantic Communication for Distributed Spectrum Monitoring over Unreliable Links — arXiv:2609.05791},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.05791},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c52fbff70dd0; sha256 716c093f3004a0f98e227473cf30fce5a14ec8c6fd013a8fcde0198425dedc09},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05791. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Distributed spectrum monitoring relies on spatially separated receivers to infer the state of the radio environment. A central task is to determine how many emitters are active and where they are located. Sensors typically report over shared unreliable links, where contention, fading, or energy limits erase whole reports, so forwarding raw I/Q samples from all receivers to a fusion node becomes impractical. This paper formulates distributed emitter counting and localization as a semantic communication problem over unreliable reporting links. Each receiver maps its local time-frequency observation to a compact latent representation and transmits it. The fusion node pairs each surviving latent with the corresponding receiver position and operates on the resulting unordered set, which keeps the fusion rule compatible with variable membership and receiver-count changes. The encoder and decoder are trained end-to-end with report erasure, and optionally finite-rate quantization, inside the task objective. Experiments on synthetic multi-emitter scenes show that channel-aware training improves robustness under erasure, that set fusion is more robust than fixed-order concatenation, and that one trained model operates across receiver counts without retraining. The rate study shows that a few bits per latent component suffice in the tested setting, and that the rate knee remains roughly stable across erasure levels. These results support the feasibility of low-rate semantic reporting for distributed spectrum monitoring over unreliable links. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-09 in cs.NI). Categorie arXiv: Networking and Internet Architecture (cs.NI). Pagina del lavoro: https://arxiv.org/abs/2609.05791 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T13:58:54.214Z dalla pagina https://arxiv.org/catchup/cs.NI/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).