Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 1, 2006 | public
Journal Article Open

Lossy network correlated data gathering with high-resolution coding

Abstract

Sensor networks measuring correlated data are considered, where the task is to gather data from the network nodes to a sink. A specific scenario is addressed, where data at nodes are lossy coded with high-resolution, and the information measured by the nodes has to be reconstructed at the sink within both certain total and individual distortion bounds. The first problem considered is to find the optimal transmission structure and the rate-distortion allocations at the various spatially located nodes, such as to minimize the total power consumption cost of the network, by assuming fixed nodes positions. The optimal transmission structure is the shortest path tree and the problems of rate and distortion allocation separate in the high-resolution case, namely, first the distortion allocation is found as a function of the transmission structure, and second, for a given distortion allocation, the rate allocation is computed. The second problem addressed is the case when the node positions can be chosen, by finding the optimal node placement for two different targets of interest, namely total power minimization and network lifetime maximization. Finally, a node placement solution that provides a tradeoff between the two metrics is proposed.

Additional Information

© Copyright 2006 IEEE. Reprinted with permission. Manuscript received March 12, 2005; revised February 8, 2006. [Posted online: 2006-06-05] The material in this correspondence was presented in part at IPSN 2005, Los Angeles, CA, April 2005. Communicated by R. W. Yeung, Guest Editor. The authors wish to thank M. Vetterli for useful discussions.

Files

CRIieeetit06b.pdf
Files (284.1 kB)
Name Size Download all
md5:6c718b7a2ded439102f6376d4dc31cd3
284.1 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023