poster

Exploiting local node cache in top-k queries within wireless sensor networks

Authors:

Johannes Niedermayer,

Mario A. Nascimento,

Matthias Renz,

Peer Kröger,

Hans-Peter KriegelAuthors Info & Claims

GIS '10: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems

Pages 434 - 437

https://doi.org/10.1145/1869790.1869855

Published: 02 November 2010 Publication History

Get Access

Abstract

Top-k queries are a popular type of query in wireless sensor networks. Typical solutions rely on coordinated root-to-nodes and nodes-to-root messages and on maintaining filters at the nodes, aiming at suppressing unnecessary messages, hence saving energy and furthering the network's lifetime. In this paper, we exploit the capability of a sensor node to cache a few recently observed values in order to determine "trends" for the observed values. Those trends can be used to further restrict the number of messages that need to be exchanged in the network, thus ultimately extending the network's lifetime. We compare our approach to the most recently proposed solutions in the literature using real and synthetic datasets, and we show that our approach is able to improve the network's lifetime by up to 28% without any loss in the quality of the answer.

References

[1]

S. Madden et al. TAG: a tiny aggregation service for ad-hoc sensor networks. SIGOPS Oper. Syst. Rev., 36:131--146, 2002.

Digital Library

Google Scholar

[2]

B. Malhotra, M. A. Nascimento, and I. Nikolaidis. Exact top-k queries in wireless sensor networks. Technical Report TR 09--16, Dept. of Computing Science, Univ. of Alberta, 2009. To appear at IEEE TKDE.

Google Scholar

[3]

J. Niedermayer et al. Exploiting local node cache in top-k queries within wireless sensor networks. Technical Report TR 10--03, Dept. of Computing Science, Univ. of Alberta, 2010.

Digital Library

Google Scholar

[4]

M. H. Thanh et al. Processing top-k monitoring queries in wireless sensor networks. In 3rd Intl. Conf. on Sensor Technologies and Applications, 2009.

Digital Library

Google Scholar

[5]

M. Wu et al. Monitoring top-k query in wireless sensor networks. IEEE TKDE, 19:962--976, 2007.

Digital Library

Google Scholar

[6]

X. Yan and X. Gang Su. Linear regression analysis: theory and computing. World Scientific Co. Pte. Ltd., 2009.

Digital Library

Google Scholar

Cited By

View all

Sarode PReshmi T(2019)Study on Query-Based Information Extraction in IoT-Integrated Wireless Sensor NetworksCountering Cyber Attacks and Preserving the Integrity and Availability of Critical Systems10.4018/978-1-5225-8241-0.ch007(142-156)Online publication date: 2019
https://doi.org/10.4018/978-1-5225-8241-0.ch007
Amagata DHara TSasaki YNishio S(2017)Efficient cluster-based top-k query routing with data replication in MANETsSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-015-1867-221:15(4161-4178)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s00500-015-1867-2
Amagata DSasaki YHara TNishio SWang STao YChen LLee C(2014)CTRProceedings of the 12th International Conference on Advances in Mobile Computing and Multimedia10.1145/2684103.2684104(225-234)Online publication date: 8-Dec-2014
https://dl.acm.org/doi/10.1145/2684103.2684104
Show More Cited By

Index Terms

Exploiting local node cache in top-k queries within wireless sensor networks

Recommendations

Relay Node Placement in Wireless Sensor Networks

A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy ...
Active node determination for correlated data gathering in wireless sensor networks

In wireless sensor network applications where data gathered by different sensor nodes is correlated, not all sensor nodes need to be active for the wireless sensor network to be functional. Given that the sensor nodes that are selected as active form a ...
Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks

In this paper, we introduce the notion of sufficient set and necessary set for distributed processing of probabilistic top-k queries in cluster-based wireless sensor networks. These two concepts have very nice properties that can facilitate localized ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

GIS '10: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 2010

566 pages

ISBN:9781450304283

DOI:10.1145/1869790

General Chairs:
Divyakant Agrawal
University of California at Santa Barbara
,
Pusheng Zhang
Microsoft Corporation
,
Program Chairs:
Amr El Abbadi
University of California, Santa Barbara
,
Mohamed Mokbel
University of Minnesota

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 November 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

GIS '10

Sponsor:

SIGSPATIAL

GIS '10: 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 2 - 5, 2010

California, San Jose

Acceptance Rates

Overall Acceptance Rate 257 of 1,238 submissions, 21%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
158
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sarode PReshmi T(2019)Study on Query-Based Information Extraction in IoT-Integrated Wireless Sensor NetworksCountering Cyber Attacks and Preserving the Integrity and Availability of Critical Systems10.4018/978-1-5225-8241-0.ch007(142-156)Online publication date: 2019
https://doi.org/10.4018/978-1-5225-8241-0.ch007
Amagata DHara TSasaki YNishio S(2017)Efficient cluster-based top-k query routing with data replication in MANETsSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-015-1867-221:15(4161-4178)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s00500-015-1867-2
Amagata DSasaki YHara TNishio SWang STao YChen LLee C(2014)CTRProceedings of the 12th International Conference on Advances in Mobile Computing and Multimedia10.1145/2684103.2684104(225-234)Online publication date: 8-Dec-2014
https://dl.acm.org/doi/10.1145/2684103.2684104
Winter FKröger PNiedermayer JRenz M(2013)Autonomous clustering for wireless sensor networksProceedings of the 25th International Conference on Scientific and Statistical Database Management10.1145/2484838.2484841(1-4)Online publication date: 29-Jul-2013
https://dl.acm.org/doi/10.1145/2484838.2484841

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Relay Node Placement in Wireless Sensor Networks

Active node determination for correlated data gathering in wireless sensor networks

Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks