Compressive linear network coding for efficient data collection in wireless sensor networks

Abstract : We address the problem of data collection in a wireless sensor network. Network coding is used for data delivery. The correlation between the measurements is exploited to recover the data at the sink, even in case of rank-deficient network matrix. The network coding operations are seen as lossy source compression, achieved by a finite-field random code generated during transmission. Decoding is performed using belief propagation on a factor graph which accounts for the correlation between the sensor measurements. Experimental results illustrate the performance of this technique for various field sizes and correlation levels.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal-supelec.archives-ouvertes.fr/hal-00721535
Contributor : Michel Kieffer <>
Submitted on : Friday, July 27, 2012 - 4:57:14 PM
Last modification on : Thursday, June 20, 2019 - 4:08:07 PM
Long-term archiving on : Friday, December 16, 2016 - 3:46:57 AM

File

eusipco12_sub2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00721535, version 1

Citation

Francesca Bassi, Liu Chao, Lana Iwaza, Michel Kieffer. Compressive linear network coding for efficient data collection in wireless sensor networks. EUSIPCO 2012, Aug 2012, Bucarest, Romania. pp.1-5. ⟨hal-00721535⟩

Share

Metrics

Record views

634

Files downloads

363