TY - GEN
T1 - Similarity based optimization for multiple query processing in wireless sensor networks
AU - Ling, Hui
AU - Znati, Taieb
PY - 2009
Y1 - 2009
N2 - Wireless sensor networks (WSNs) have been proposed for a large variety of applications. As the number of applications of sensor networks continue to grow, the number of users in sensor networks increases as well. Consequently, it is not uncommon that base station often needs to process multiple queries simultaneously. Furthermore, these queries often need to collect data from some particular sets of sensors such as the sensors in a hot spot. To reduce the communication cost of multiple query processing in WSNs, this paper proposes a new optimization technique based on similarities among multiple queries. Given a set of queries, Q, the proposed scheme constructs a set of shared intermediate views (SIVs) from Q. Each SIV identifies a set of shared data among queries in Q. The SIVs, are processed only once, but reused by at least two queries in Q. The queries in Q, are rewritten into a different set of queries, Q. The collected sensor data from Q and SIVs, are aggregated and returned as the processing results for the original set of queries in Q. The simulation results show that the proposed technique can effectively reduce the communication cost of multiple query processing in WSNs.
AB - Wireless sensor networks (WSNs) have been proposed for a large variety of applications. As the number of applications of sensor networks continue to grow, the number of users in sensor networks increases as well. Consequently, it is not uncommon that base station often needs to process multiple queries simultaneously. Furthermore, these queries often need to collect data from some particular sets of sensors such as the sensors in a hot spot. To reduce the communication cost of multiple query processing in WSNs, this paper proposes a new optimization technique based on similarities among multiple queries. Given a set of queries, Q, the proposed scheme constructs a set of shared intermediate views (SIVs) from Q. Each SIV identifies a set of shared data among queries in Q. The SIVs, are processed only once, but reused by at least two queries in Q. The queries in Q, are rewritten into a different set of queries, Q. The collected sensor data from Q and SIVs, are aggregated and returned as the processing results for the original set of queries in Q. The simulation results show that the proposed technique can effectively reduce the communication cost of multiple query processing in WSNs.
UR - http://www.scopus.com/inward/record.url?scp=68749094469&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=68749094469&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02085-8_9
DO - 10.1007/978-3-642-02085-8_9
M3 - Conference contribution
AN - SCOPUS:68749094469
SN - 3642020844
SN - 9783642020841
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 117
EP - 130
BT - Distributed Computing in Sensor Systems - 5th IEEE International Conference, DCOSS 2009, Proceedings
T2 - 5th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2009
Y2 - 8 June 2009 through 10 June 2009
ER -