Efficient and fast distributed top-k query protocol in wireless sensor networks

In this paper, we focus on designing efficient query of top-k data produced by sensor nodes in a wireless sensor network (WSN). Assume that we are given a connected WSN of diameter D, consisting of n nodes with maximum node degree Δ. Two different models are studied. In the first model, each node holds a numeric element, the goal is to determine the top-k smallest (or biggest) of these elements from all nodes. In the second model, there are m objects in set ℒ, each node v<sub>i</sub>, 1 ≤ i ≤ n holds a numeric value S<sub>j</sub>(v<sub>i</sub>) for each object L<sub>j</sub> ∈ ℒ,1 ≤ j ≤ m, the goal is to find the k objects in ℒ with the k smallest (or biggest) aggregated values /(s<sub>j</sub>(u<sub>1</sub>), S<sub>j</sub>(v<sub>2</sub>), ..., S<sub>j</sub>(v<sub>n</sub>)), where f is an aggregation function given in advance. We propose both fast and message efficient methods for conducting top-k queries in the two aforementioned models. Following that we study the minimum delay and messages required by any distributed method for top-k queries in both models. Our analysis shows that our methods are almost optimum. We conducted extensive experiments in both testbed and simulations to study the practical performances of our methods.

[1]  Christopher Olston,et al.  Distributed top-k monitoring , 2003, SIGMOD '03.

[2]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS.

[3]  Ping Xu,et al.  Delay and energy efficiency tradeoffs for data collections and aggregation in large scale wireless sensor networks , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[4]  Kamesh Munagala,et al.  A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[5]  Jianliang Xu,et al.  Monitoring Top-k Query inWireless Sensor Networks , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[6]  Roger Wattenhofer,et al.  Tight bounds for distributed selection , 2007, SPAA '07.

[7]  Man Lung Yiu,et al.  Efficient top-k aggregation of ranked inputs , 2007, TODS.

[8]  Chonggang Wang,et al.  Continuous multi-dimensional top-k query processing in sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[9]  Ronald Fagin,et al.  Combining Fuzzy Information from Multiple Systems , 1999, J. Comput. Syst. Sci..

[10]  Weifa Liang,et al.  Energy-efficient top-k query processing in wireless sensor networks , 2010, CIKM '10.

[11]  Jeffrey Considine,et al.  Robust Aggregation in Sensor Networks , 2005, IEEE Data Eng. Bull..

[12]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[13]  Seung-won Hwang,et al.  Minimal probing: supporting expensive predicates for top-k queries , 2002, SIGMOD '02.

[14]  Samuel Madden,et al.  PAQ: Time Series Forecasting for Approximate Query Answering in Sensor Networks , 2006, EWSN.

[15]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[16]  Ying Zhang,et al.  Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[17]  Patrick Valduriez,et al.  Best Position Algorithms for Top-k Queries , 2007, VLDB.

[18]  Jun Yang,et al.  Constraint chaining: on energy-efficient continuous monitoring in sensor networks , 2006, SIGMOD Conference.

[19]  Dariusz R. Kowalski,et al.  Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks , 2005, Second Annual Conference on Wireless On-demand Network Systems and Services.

[20]  Ronald Fagin,et al.  Combining fuzzy information from multiple systems (extended abstract) , 1996, PODS.

[21]  Jianliang Xu,et al.  Top-k Monitoring in Wireless Sensor Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.

[22]  Mohamed A. Soliman,et al.  Top-k Query Processing in Uncertain Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[23]  Luis Gravano,et al.  Evaluating top-k queries over Web-accessible databases , 2002, Proceedings 18th International Conference on Data Engineering.

[24]  Boaz Patt-Shamir.  A note on efficient aggregate queries in sensor networks , 2007, Theor. Comput. Sci..

[25]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[26]  Kyriakos Mouratidis,et al.  Continuous monitoring of top-k queries over sliding windows , 2006, SIGMOD Conference.

[27]  Dimitrios Gunopulos,et al.  Ad-hoc Top-k Query Answering for Data Streams , 2007, VLDB.

[28]  Seung-won Hwang,et al.  Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates , 2007, IEEE Transactions on Knowledge and Data Engineering.

[29]  Rajeev Rastogi,et al.  Efficient gossip-based aggregate computation , 2006, PODS.

[30]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[31]  Shaojie Tang,et al.  Canopy closure estimates with GreenOrbs: sustainable sensing in the forest , 2009, SenSys '09.

[32]  Kay Römer,et al.  An Adaptive Strategy for Quality-Based Data Reduction in Wireless Sensor Networks , 2006 .