Data-aware top-k monitoring in wireless sensor networks

Authors:
Myungho Yeo;Dongook Seong;Jaesoo Yoo
Affiliations:
Department of Information and Communication Engineering, Chungbuk National University, Cheongju, Korea;Department of Information and Communication Engineering, Chungbuk National University, Cheongju, Korea;Department of Information and Communication Engineering, Chungbuk National University, Cheongju, Korea
Venue:
RWS'09 Proceedings of the 4th international conference on Radio and wireless symposium
Year:
2009

Citing 4
Cited 0

Habitat monitoring with sensor networks

Communications of the ACM - Wireless sensor networks
An analysis of a large scale habitat monitoring application

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Top-k Monitoring in Wireless Sensor Networks

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Top-k queries are important to many wireless sensor applications. Conventional Top-k query processing algorithms install a filter at each sensor node and suppress unnecessary sensor updates. However, they have some drawbacks that the sensor nodes consume energy extremely to probe sensor reading or update filters. Especially, it becomes worse, when the variation ratio of top-k result is higher. In this paper, we propose a novel top-k query processing algorithm for energy-efficiency. First, each sensor determines its priority as the order of data gathering. Next, sensor nodes that have higher priority transmit their sensor readings to the base station until gathering k sensor readings. In order to show the superiority of our query processing algorithm, we simulate the performance with the existing query processing algorithms. As a result, our experimental results show that the network lifetime of our method is prolonged largely over the existing method.