ACM Home Page
Please provide us with feedback. Feedback
Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Full text PdfPdf (298 KB)
Source International Conference on Management of Data archive
Proceedings of the 2006 ACM SIGMOD international conference on Management of data table of contents
Chicago, IL, USA
SESSION: Sensor networks table of contents
Pages: 157 - 168  
Year of Publication: 2006
ISBN:1-59593-434-0
Authors
Adam Silberstein  Duke University, Durham, NC
Rebecca Braynard  Duke University, Durham, NC
Jun Yang  Duke University, Durham, NC
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 107,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Wireless sensor networks have created new opportunities for data collection in a variety of scenarios, such as environmental and industrial, where we expect data to be temporally and spatially correlated. Researchers may want to continuously collect all sensor data from the network for later analysis. Suppression, both temporal and spatial, provides opportunities for reducing the energy cost of sensor data collection. We demonstrate how both types can be combined for maximal benefit. We frame the problem as one of monitoring node and edge constraints. A monitored node triggers a report if its value changes. A monitored edge triggers a report if the difference between its nodes' values changes. The set of reports collected at the base station is used to derive all node values. We fully exploit the potential of this global inference in our algorithm, CONCH, short for constraint chaining. Constraint chaining builds a network of constraints that are maintained locally, but allow a global view of values to be maintained with minimal cost. Network failure complicates the use of suppression, since either causes an absence of reports. We add enhancements to CONCH to build in redundant constraints and provide a method to interpret the resulting reports in case of uncertainty. Using simulation we experimentally evaluate CONCH's effectiveness against competing schemes in a number of interesting scenarios.


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
K. Chintalapudi and R. Govindan. Localized edge detection in sensor fields. In Proc. of the 2003 IEEE Sensor Network Protocols and Applications, May 2003.
 
2
 
3
Chuck Conner. Modeling Heat Transfer in Parallel. http://www.cas.usf.edu/~cconnor/parallel/2dheat/2dheat.html.
 
4
 
5
Crossbow Inc. MPR-Mote Processor Radio Board User's Manual.
6
 
7
8
 
9
10
11
 
12
X. Meng, L. Li, T. Nandagopal, and S. Lu. Event contour: An efficient and robust mechanism for tasks in sensor networks. Technical report, UCLA, 2004.
13
 
14
D. Petrovic, R. Shah, K. Ramchandran, and J. Rabaey. Data funneling: Routing with aggregation and compression for wireless sensor networks. In Proc. of the 2003 IEEE Sensor Network Protocols and Applications, May 2003.
15
16
 
17
18
19
 
20
Z. Zhou, S. Das, and H. Gupta. Connected k-coverage problem in sensor networks. In Proc. of the 2004 IEEE Intl. Conf. on Computer Communications and Networks, Oct. 2004.

CITED BY  13

Collaborative Colleagues:
Adam Silberstein: colleagues
Rebecca Braynard: colleagues
Jun Yang: colleagues