Metraipolis › archive › dc_e4a8d30332eb

RSS-Based Verification of Drone Remote ID Position Claims with Unknown Transmit Power — arXiv:2610.41783

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41783
License (as archived)
CC0-1.0
Archived
2026-11-03T06:00:46.884Z
SHA-256 of the archived text
ee2dddb66ff77ee5363c5d087d74006cbeb21e07d3735330fe80710eea5e93f7
Stable URL of this page
https://metraipolis.com/documento/dc_e4a8d30332eb

How to cite

RSS-Based Verification of Drone Remote ID Position Claims with Unknown Transmit Power — arXiv:2610.41783 — arXiv (en), https://arxiv.org/abs/2610.41783 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e4a8d30332eb (Metraipolis archive dc_e4a8d30332eb, sha256 ee2dddb66ff77ee5363c5d087d74006cbeb21e07d3735330fe80710eea5e93f7)
BibTeX
@misc{dce4a8d30332eb,
  title = {RSS-Based Verification of Drone Remote ID Position Claims with Unknown Transmit Power — arXiv:2610.41783},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41783},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e4a8d30332eb; sha256 ee2dddb66ff77ee5363c5d087d74006cbeb21e07d3735330fe80710eea5e93f7},
  year = {2026}
}

Archived text

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

Broadcast Remote Identification (Remote ID) is a key enabler for integrating unmanned aircraft into the airspace. However, the position it reports is self-declared and can be falsified with low-cost hardware. In this paper, we study how Remote ID receivers can verify the declared position from the received signal strength (RSS) when neither the transmit power nor the path-loss exponent is known. In particular, we derive a Rao score test whose null distribution is exactly chi-squared for any number of packets. Its threshold and detection probability therefore follow in closed form. We then bound the detection probability of any detector that is invariant to the unknown link parameters. This bound saturates as the falsified position recedes along a fixed bearing, so a sufficiently large falsification can remain undetectable. From this limit, we obtain the worst-case bearing in closed form, the observation length needed to close it, and a receiver placement rule. Simulation results show that the proposed test considerably outperforms an estimate-then-threshold detector at low false-alarm rates.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv eess.SP, nuovi lavori del giorno).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2610.41783 — 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-11-03T05:42:34.566Z dalla pagina https://arxiv.org/list/eess.SP/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).