ACM Home Page
Please provide us with feedback. Feedback
Asynchronous in-network prediction: Efficient aggregation in sensor networks
Full text PdfPdf (1.50 MB)
Source
ACM Transactions on Sensor Networks (TOSN) archive
Volume 4 ,  Issue 4  (August 2008) table of contents
Article No. 25  
Year of Publication: 2008
ISSN:1550-4859
Authors
Pavan Edara  Indian Institute of Technology Bombay
Ashwin Limaye  Indian Institute of Technology Bombay
Krithi Ramamritham  Indian Institute of Technology Bombay
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 222,   Citation Count: 0
Additional Information:

abstract   references   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/1387663.1387671
What is a DOI?

ABSTRACT

Given a sensor network and aggregate queries over the values sensed by subsets of nodes in the network, how do we ensure that high quality results are served for the maximum possible time? The issues underlying this question relate to the fidelity of query results and lifetime of the network. To maximize both, we propose a novel technique called asynchronous in-network prediction incorporating two computationally efficient methods for in-network prediction of partial aggregate values. These values are propagated via a tree whose construction is cognizant of (a) the coherency requirements associated with the queries, (b) the remaining energy at the sensors, and (c) the communication and message processing delays. Finally, we exploit in-network filtering and in-network aggregation to reduce the energy consumption of the nodes in the network. Experimental results over real world data support our claim that, for aggregate queries with associated coherency requirements, a prediction-based, asynchronous scheme provides higher quality results for a longer amount of time than a synchronous scheme. Also, whereas aggregate dissemination techniques proposed so far for sensor networks appear to have to trade-off quality of data for energy efficiency, we demonstrate that this is not always necessary.


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
 
3
4
 
5
6
7
 
8
Inventory of U.S. Globec Georges Bank Data, Project: AL9508. 1995. http://jgof.wh.whoi.edu/jg/serv/globec/gb/brdscale/al_shipdata.html1%7Bdir=globec.whoi.edu/jg/dir/globec/gb/broadscale/, info=globec.whoi.edu/jg/info/globec/gb/broadscale/alongtrack%7D?cruise_id%20eq%20al9508.
 
9
Kaiser, W. J. 2000. WINS NG 1.0 Transceiver Power Dissipation Specifications. Sensoria Corp.
10
 
11
12
13
14
15
16
 
17
 
18
19
 
20
TinyOS Website. http://www.tinyos.net.
 
21
Trigoni, N., Yao, Y., Demers, A. J., Gehrke, J., and Rajaraman, R. 2005. Multi-query optimization for sensor networks. In Proceedings of the 1st IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS'05). 307--321.
22
23
 
24

Collaborative Colleagues:
Pavan Edara: colleagues
Ashwin Limaye: colleagues
Krithi Ramamritham: colleagues