Metraipolis › archive › dc_34012ddfb6a7

Feasible but Not Safe: Constraint Violations and Report-Channel Attacks in Learned Cell-Free ISAC Association — arXiv:2609.03147

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03147
License (as archived)
CC0-1.0
Archived
2026-10-17T02:08:34.125Z
SHA-256 of the archived text
2e9d5201b7b304b780d07fc3e540710e288bddbc191dd827f838705a15ada0da
Stable URL of this page
https://metraipolis.com/documento/dc_34012ddfb6a7

How to cite

Feasible but Not Safe: Constraint Violations and Report-Channel Attacks in Learned Cell-Free ISAC Association — arXiv:2609.03147 — arXiv (en), https://arxiv.org/abs/2609.03147 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_34012ddfb6a7 (Metraipolis archive dc_34012ddfb6a7, sha256 2e9d5201b7b304b780d07fc3e540710e288bddbc191dd827f838705a15ada0da)
BibTeX
@misc{dc34012ddfb6a7,
  title = {Feasible but Not Safe: Constraint Violations and Report-Channel Attacks in Learned Cell-Free ISAC Association — arXiv:2609.03147},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03147},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_34012ddfb6a7; sha256 2e9d5201b7b304b780d07fc3e540710e288bddbc191dd827f838705a15ada0da},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03147. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Learning-based schedulers have been proposed to provide real-time user, target, and access point (AP) association in distributed cell-free integrated sensing and communication systems. In a typical approach, a graph neural network (GNN), trained on labels from a mixed-integer linear program, maps lightweight per-AP statistics to decisions on AP clustering, user and target scheduling, and mode selection in one forward pass. Such solutions assume that hard constraints, enforced only as soft training penalties, hold at inference, and that the self-reported statistics are truthful. Using our ASSENT algorithm as an example, we find that despite high $F_1$ scores, many solutions violate at least one hard constraint, demonstrating that high prediction accuracy does not ensure joint feasibility. Projecting the GNN output onto a feasible solution restores constraint satisfaction with low utility loss, even with a simple greedy repair procedure. We further show that feasibility alone does not guarantee robustness to false data injection attacks. A single malicious AP that reports false information cannot substantially increase its user associations, but can greatly increase the rate of infeasible solutions. The effect of such attacks depends on the type of information being falsified. Misreporting information that affects the objective can largely be mitigated through feasibility projection, whereas falsifying information that affects the constraints cannot. The latter can, however, be detected using a low-complexity cross-AP consistency check. These results show that learned ISAC schedulers should be evaluated using constraint-aware feasibility metrics in addition to conventional accuracy measures.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-04 in cs.LG).
Categorie arXiv: Networking and Internet Architecture (cs.NI) ; Machine Learning (cs.LG); Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.03147 — 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-17T01:47:25.604Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).