Probabilistic Top-k query processing in distributed sensor networks

In this paper, we propose the notion of sufficient set for distributed processing of probabilistic Top-k queries in cluster-based wireless sensor networks. Through the derivation of sufficient boundary, we show that data items ranked lower than sufficient boundary are not required for answering the...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) pp. 585 - 588
Main Authors Mao Ye, Xingjie Liu, Wang-Chien Lee, Dik Lun Lee
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2010
Subjects
Amplitude modulation
Bandwidth
Clustering algorithms
Computer science
Data communication
Delay
Distributed processing
Query processing
Temperature sensors
Wireless sensor networks
Online AccessGet full text
ISBN142445445X
9781424454457
ISSN1063-6382
DOI10.1109/ICDE.2010.5447875

Cover

More Information
Summary:In this paper, we propose the notion of sufficient set for distributed processing of probabilistic Top-k queries in cluster-based wireless sensor networks. Through the derivation of sufficient boundary, we show that data items ranked lower than sufficient boundary are not required for answering the probabilistic top-k queries, thus are subject to local pruning. Accordingly, we develop the sufficient set-based (SSB) algorithm for inter-cluster query processing. Experimental results show that the proposed algorithm reduces data transmissions significantly.
ISBN:142445445X
9781424454457
ISSN:1063-6382
DOI:10.1109/ICDE.2010.5447875