Metraipolis › archive › dc_2dfb2af332f3

Distributed Cross-Layer Optimization for Covert Multi-Hop, Multi-Modal Networks: Exponentially Fast Convergence and Robust Tracking — arXiv:2608.28469

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.28469
License (as archived)
CC0-1.0
Archived
2026-10-17T11:27:18.078Z
SHA-256 of the archived text
bc02b254c711e634974b62a487f08230d7b783c943e4f736bb4d48415af64485
Stable URL of this page
https://metraipolis.com/documento/dc_2dfb2af332f3

How to cite

Distributed Cross-Layer Optimization for Covert Multi-Hop, Multi-Modal Networks: Exponentially Fast Convergence and Robust Tracking — arXiv:2608.28469 — arXiv (en), https://arxiv.org/abs/2608.28469 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2dfb2af332f3 (Metraipolis archive dc_2dfb2af332f3, sha256 bc02b254c711e634974b62a487f08230d7b783c943e4f736bb4d48415af64485)
BibTeX
@misc{dc2dfb2af332f3,
  title = {Distributed Cross-Layer Optimization for Covert Multi-Hop, Multi-Modal Networks: Exponentially Fast Convergence and Robust Tracking — arXiv:2608.28469},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.28469},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2dfb2af332f3; sha256 bc02b254c711e634974b62a487f08230d7b783c943e4f736bb4d48415af64485},
  year = {2026}
}

Archived text

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

This paper develops the first distributed cross-layer algorithm for joint congestion control, routing, scheduling, and power control in covert multi-hop, multi-modal wireless networks, where adversarial wardens (Willies) monitor radio modalities via energy detection. The Detection Error Probability (DEP), the probability that a Willie fails to reliably detect ongoing transmissions, is generally non-concave in the transmit powers, making DEP-based covert network optimization challenging. We resolve this by constructing the tightest concave lower bound on the log-DEP, yielding a conservative convex problem that guarantees satisfaction of the original DEP constraints and unifies hard covertness constraints and covertness-utility maximization in a single problem. We develop a Parallel Proximal Alternating Direction Method of Multipliers (PP-ADMM) algorithm for the resulting cross-layer problem and prove global Q-linear convergence, i.e., exponentially fast convergence, to the set of optimal solutions under standard regularity conditions. Numerical results confirm linear convergence and demonstrate robust tracking performance under channel fading and Willie mobility.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.IT).
Categorie arXiv: Information Theory (cs.IT) ; Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2608.28469 — 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-17T11:07:15.580Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).