Sparse Random Linear Network Coding for Data Compression in WSNs

Abstract : This paper addresses the information theoretical analysis of data compression achieved by random linear network coding in wireless sensor networks. A sparse network coding matrix is considered with columns having possibly different sparsity factors. For stationary and ergodic sources, necessary and sufficient conditions are provided on the number of required measurements to achieve asymptotically vanishing reconstruction error. To ensure the asymptotically optimal compression ratio, the sparsity factor can be arbitrary close to zero in absence of additive noise. In presence of noise, a sufficient condition on the sparsity of the coding matrix is also proposed.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01327498
Contributor : Wenjie Li <>
Submitted on : Monday, June 6, 2016 - 5:56:30 PM
Last modification on : Monday, October 8, 2018 - 4:30:47 PM

File

srlnc_wenjie.pdf
Files produced by the author(s)

Identifiers

Citation

Wenjie Li, Francesca Bassi, Michel Kieffer. Sparse Random Linear Network Coding for Data Compression in WSNs. 2016 IEEE International Symposium on Information Theory (ISIT), Jul 2016, Barcelona, Spain. ⟨10.1109/isit.2016.7541795 ⟩. ⟨hal-01327498⟩

Share

Metrics

Record views

272

Files downloads

226