Distributed Sensing and Transmission of Sporadic Random Samples in a Multiple-Access Channel
Ay\c{s}e \"Unsal, Raymond Knopp

TL;DR
This paper investigates distributed sensing and transmission of sporadic samples over a noisy multiple-access channel, deriving bounds on reconstruction error and exploring energy-efficient collaboration strategies with practical numerical evaluations.
Contribution
It extends retransmission protocols to general sensor networks and provides asymptotic and non-asymptotic bounds on reconstruction error considering energy constraints.
Findings
Collaboration via energy accumulation is feasible under certain conditions.
Performance improves with larger networks but energy efficiency gains diminish at finite energies.
Numerical evaluations demonstrate the protocol's effectiveness and practical considerations.
Abstract
This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a network of sensors and transmitted with finite energy to a common receiver via an additive white Gaussian noise asynchronous multiple-access channel. Transmission makes use of a perfect causal feedback link to the encoder connected to each sensor. A retransmission protocol inspired by the classical scheme in [1] applied to the transmission of single and bi-variate analog samples analyzed in [2] and [3] is extended to the more general network scenario, for which asymptotic upper-bounds on the reconstruction error are provided. Both the upper and lower-bounds show that collaboration can be achieved through energy accumulation under certain circumstances.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
