Metraipolis › archive › dc_f878bb7f2ccd

Real-Time Reconstruction of Markov Sources over MPR Channels — arXiv:2608.27116

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27116
License (as archived)
CC0-1.0
Archived
2026-10-17T16:36:46.107Z
SHA-256 of the archived text
da5ed5a4f15b55ef2915c9031bdc223627f9f1592436af9100d4f4a4a27f0be3
Stable URL of this page
https://metraipolis.com/documento/dc_f878bb7f2ccd

How to cite

Real-Time Reconstruction of Markov Sources over MPR Channels — arXiv:2608.27116 — arXiv (en), https://arxiv.org/abs/2608.27116 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f878bb7f2ccd (Metraipolis archive dc_f878bb7f2ccd, sha256 da5ed5a4f15b55ef2915c9031bdc223627f9f1592436af9100d4f4a4a27f0be3)
BibTeX
@misc{dcf878bb7f2ccd,
  title = {Real-Time Reconstruction of Markov Sources over MPR Channels — arXiv:2608.27116},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27116},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f878bb7f2ccd; sha256 da5ed5a4f15b55ef2915c9031bdc223627f9f1592436af9100d4f4a4a27f0be3},
  year = {2026}
}

Archived text

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

This paper studies the real-time reconstruction and remote actuation of two binary Markov sources over a shared wireless channel with multi-packet reception (MPR). Unlike many existing collision-based formulations that discard simulta- neous transmissions, we exploit MPR and evaluate communica- tion through reconstruction and actuation errors rather than raw delivery rates. We consider two sensors observing the sources and aim to find sampling policies that minimize the weighted real- time reconstruction error (RTE), or equivalently the weighted cost of actuation error (CAE) for the considered binary sources, under per-sensor sampling constraints. We first obtain closed- form expressions for the RTE and CAE in terms of the effective update probabilities. When the sensors randomize independently, the MPR-induced update-rate map becomes bilinear, and the constrained optimization is nonconvex. We exploit the geometry of the achievable update-rate region to show that the search over Pareto-efficient independently randomized policies reduces to a finite set of one-dimensional boundary-branch searches with closed-form candidates. As a benchmark, we allow time sharing among joint sensor actions, and we prove that at most two Pareto- extreme modes are sufficient, and use this benchmark to quantify the loss caused by independent randomization. Numerical results reveal that MPR capability alone is not sufficient; simultaneous decoding improves the task-oriented objective only when con- current reception is reliable for both sources; otherwise, policies that avoid simultaneous transmissions can be equally effective.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-28 in cs.NI).
Categorie arXiv: Information Theory (cs.IT) ; Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2608.27116 — 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-17T16:08:12.581Z dalla pagina https://arxiv.org/catchup/cs.NI/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).