Compressive linear network coding for efficient data collection in wireless sensor networks
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Compressive linear network coding for efficient data collection in wireless sensor networks |
|---|---|
| Author / Organization | Francesca Bassi, Liu Chao, Lana Iwaza, Michel Kieffer |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2012 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-147026 |
| Original Source Link | Visit Source Page on hal.science » |