vix.ing · top · new · best · stats · spec

Low-Complexity Coding and Source-Optimized Clustering for Large-Scale Sensor Networks

2008/09/08 by Gerhard Maierbacher, G. Maierbacher, João Barros +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #C.2.4 #DNA and Biological Computing #E.1 #E.4 #Error Correcting Code Techniques #FOS: Computer and information sciences #G.3 #H.1.1 #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.0809.1330

26 pages

arxiv created 2008/09/08 · openalex publication_date 2008/09/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider the distributed source coding problem in which correlated data picked up by scattered sensors has to be encoded separately and transmitted to a common receiver, subject to a rate-distortion constraint. Although near-tooptimal solutions based on Turbo and LDPC codes exist for this problem, in most cases the proposed techniques do not scale to networks of hundreds of sensors. We present a scalable solution based on the following key elements: (a) distortion-optimized index assignments for low-complexity distributed quantization, (b) source-optimized hierarchical clustering based on the Kullback-Leibler distance and (c) sum-product decoding on specific factor graphs exploiting the correlation of the data.

Related