Metraipolis › archive › dc_29dc74da9c33
Energy-Efficient UAV Covert Communications via Metaheuristic Optimization — arXiv:2611.00090
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00090
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:51:39.618Z
- SHA-256 of the archived text
862ba021ec4b37b5af9990d6d1cb4deeb56f86244d97ca98ec302b1e60cbb489- Stable URL of this page
https://metraipolis.com/documento/dc_29dc74da9c33
How to cite
Energy-Efficient UAV Covert Communications via Metaheuristic Optimization — arXiv:2611.00090 — arXiv (en), https://arxiv.org/abs/2611.00090 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_29dc74da9c33 (Metraipolis archive dc_29dc74da9c33, sha256 862ba021ec4b37b5af9990d6d1cb4deeb56f86244d97ca98ec302b1e60cbb489)
BibTeX
@misc{dc29dc74da9c33,
title = {Energy-Efficient UAV Covert Communications via Metaheuristic Optimization — arXiv:2611.00090},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00090},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_29dc74da9c33; sha256 862ba021ec4b37b5af9990d6d1cb4deeb56f86244d97ca98ec302b1e60cbb489},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00090. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Wireless communication systems increasingly require not only confidentiality but also transmission undetectability, motivating covert communications. This paper studies an unmanned aerial vehicle (UAV) enabled covert communication system where a UAV serves a legitimate receiver in the presence of multiple active and colluding wardens with imperfect location information. We maximize covert energy efficiency (CEE) by jointly optimizing the UAV's 3D trajectory and transmit power while accounting for energy. To address the resulting non-convex problem with robust covertness constraints, we develop Genetic Algorithm (GA) and Particle Swarm Optimization (PSO)-based metaheuristic algorithms and compare them with a Block Coordinate Descent with Successive Convex Approximation (BCD-SCA) benchmark. Numerical results show that the proposed methods improve CEE while satisfying covertness constraints. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2611.00090 — 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-03T18:15:52.809Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).