Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Low-complexity coding and source-optimized clustering for large-scale sensor networks

Low-complexity coding and source-optimized clustering for large-scale sensor networks 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-to-optimal 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Sensor Networks (TOSN) Association for Computing Machinery

Low-complexity coding and source-optimized clustering for large-scale sensor networks

Download PDF
32 pages

Loading next page...
 
/lp/association-for-computing-machinery/low-complexity-coding-and-source-optimized-clustering-for-large-scale-QIsuLIg4zm
Publisher
Association for Computing Machinery
Copyright
Copyright © 2009 by ACM Inc.
ISSN
1550-4859
DOI
10.1145/1525856.1525862
Publisher site
See Article on Publisher Site

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-to-optimal 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.

Journal

ACM Transactions on Sensor Networks (TOSN) – Association for Computing Machinery

Published: May 1, 2009

There are no references for this article.