ACM Home Page
Please provide us with feedback. Feedback
The impact of spatial correlation on routing with compression in wireless sensor networks
Full text PdfPdf (221 KB)
Source Information Processing In Sensor Networks archive
Proceedings of the 3rd international symposium on Information processing in sensor networks table of contents
Berkeley, California, USA
SESSION: Oral presentation session 1: In network modeling, processing, & optimization table of contents
Pages: 28 - 35  
Year of Publication: 2004
ISBN:1-58113-846-6
Authors
Sundeep Pattem  University of Southern California, Los Angeles, CA
Bhaskar Krishnamachari  University of Southern California, Los Angeles, CA
Ramesh Govindan  University of Southern California, Los Angeles, CA
Sponsor
SIGBED: ACM Special Interest Group on Embedded Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 117,   Citation Count: 36
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/984622.984627
What is a DOI?

ABSTRACT

The efficacy of data aggregation in sensor networks is a function of the degree of spatial correlation in the sensed phenomenon. While several data aggregation (i.e., routing with data compression) techniques have been proposed in the literature, an understanding of the performance of various data aggregation schemes across the range of spatial correlations is lacking. We analyze the performance of routing with compression in wireless sensor networks using an application-independent measure of data compression (an empirically obtained approximation for the joint entropy of sources as a function of the distance between them) to quantify the size of compressed information, and a bit-hop metric to quantify the total cost of joint routing with compression. Analytical modeling and simulations reveal that while the nature of optimal routing with compression does depend on the correlation level, surprisingly, there exists a practical static clustering scheme which can provide near-optimal performance for a wide range of spatial correlations. This result is of great practical significance as it shows that a simple cluster-based system design can perform as well as sophisticated adaptive schemes for joint routing and compression.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Ashish Goel, Deborah Estrin, "Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk," SODA 2003, p. 499--505.
 
3
 
4
5
 
6
 
7
B. Bonfils and P. Bonnet, "Adaptive and Decentralized Operator Placement for In-Network Query Processing," Workshop on Information Processing in Sensor Networks (IPSN), April 2003.
 
8
P. Bonnet, J. Gehrke, P. Seshadri, " Querying the Physical World," IEEE Personal Communications Special Issue on Networking the Physical World, October 2000.
 
9
 
10
 
11
 
12
 
13
M. Widmann and C. Bretherton, "50 km resolution daily preciptation for the Pacific Northwest, 1949-94," Cimate Data Archive, Joint Institute for the Study of the Atmosphere and the Ocean, 1999. Online data-set located at http://www.jisao.washington.edu/data sets/widmann

CITED BY  38

Collaborative Colleagues:
Sundeep Pattem: colleagues
Bhaskar Krishnamachari: colleagues
Ramesh Govindan: colleagues