pith. sign in

arxiv: 0809.1330 · v1 · submitted 2008-09-08 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords clusteringcodingdatadistributedlow-complexitynetworksproblemsensors
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.