Metraipolis › archive › dc_b20a5eeea3ba
Non-Coherent Over-the-Air Distributed Consensus: Algorithm Design and Power Control Optimization — arXiv:2611.03378
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03378
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:51:52.041Z
- SHA-256 of the archived text
55625a176b580e427b1f15b6426866cd3ddb77e68e568144a4c2d5f83f47a0b5- Stable URL of this page
https://metraipolis.com/documento/dc_b20a5eeea3ba
How to cite
Non-Coherent Over-the-Air Distributed Consensus: Algorithm Design and Power Control Optimization — arXiv:2611.03378 — arXiv (en), https://arxiv.org/abs/2611.03378 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b20a5eeea3ba (Metraipolis archive dc_b20a5eeea3ba, sha256 55625a176b580e427b1f15b6426866cd3ddb77e68e568144a4c2d5f83f47a0b5)
BibTeX
@misc{dcb20a5eeea3ba,
title = {Non-Coherent Over-the-Air Distributed Consensus: Algorithm Design and Power Control Optimization — arXiv:2611.03378},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03378},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b20a5eeea3ba; sha256 55625a176b580e427b1f15b6426866cd3ddb77e68e568144a4c2d5f83f47a0b5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03378. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Non-coherent over-the-air (NCOTA) aggregation offers a scalable and communication-efficient approach to distributed average consensus in wireless networks, without requiring instantaneous channel state information (CSI) or phase alignment. However, persistent aggregation errors pose fundamental challenges in achieving exact average consensus under nominal distributed averaging protocols. In this paper, we develop an NCOTA consensus framework that accommodates row-stochastic mixing, without requiring the conventional average-preservation property of doubly stochastic mixing matrices. Building on a distributed optimization formulation of average consensus, we propose a decentralized projected gradient descent with row-stochastic mixing (DPGD-RS) algorithm and establish its mean-square convergence to the exact average of the agents' initial states. We further derive a closed-form upper bound on the mean-square consensus error, characterizing the effects of aggregation uncertainty, network connectivity, and mixing imbalance. Guided by this analysis, we propose a spectral-reshaping power control (SR-PC) scheme that jointly optimizes transmit powers and receive-scaling factors to accelerate convergence by balancing aggregation accuracy and network mixing. Numerical results validate the theoretical convergence guarantees and demonstrate that the proposed power control scheme significantly accelerates convergence compared with full-power transmission and spectral-radius-minimization benchmarks. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT) ; Signal Processing (eess.SP); Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2611.03378 — 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.836Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).