loading...
Distributed Source Coding in Dense Sensor Networks
Snowbird, Utah March 29-March 31
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2005.33Data Compression Conference (DCC'05)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Akshay Kashyap, UIUC, Urbana, IL
Luis Alfonso Lastras-Monta?, IBM T.J. Watson Research Center, Yorktown Heights, NY
Cathy Xia, IBM T.J. Watson Research Center, Hawthorne, NY
Zhen Liu, IBM T.J. Watson Research Center, Hawthorne, NY
We study the problem of the reconstruction of a Gaussian field defined in [0,1] using N sensors deployed at regular intervals. The goal is to quantify the total data rate required for the reconstruction of the field with a given mean square distortion. We consider a class of two-stage mechanisms which a) send information to allow the reconstruction of the sensor's samples within sufficient accuracy, and then b) use these reconstructions to estimate the entire field. To implement the first stage, the heavy correlation between the sensor samples suggests the use of distributed coding schemes to reduce the total rate. Our main contribution is to demonstrate the existence of a distributed block coding scheme that achieves, for a given fidelity criterion for the sensor's measurements, a total information rate that is within a constant, independent of N, of the minimum information rate required by an encoder that has access to all the sensor measurements simultaneously. The constant in general depends on the autocorrelation function of the field and the desired distortion criterion for the sensor samples.
Citation:
Akshay Kashyap, Luis Alfonso Lastras-Monta?, Cathy Xia, Zhen Liu, "Distributed Source Coding in Dense Sensor Networks," dcc, pp.13-22, Data Compression Conference (DCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.