TY - JOUR
T1 - Top-k monitoring in wireless sensor networks
AU - Wu, Minji
AU - Xu, Jianliang
AU - Tang, Xueyan
AU - Lee, Wang Chien
N1 - Funding Information:
The authors would like to thank the editor and the anonymous reviewers for their valuable suggestions, which improved the quality of this paper. This work was partially supported by grants from the Research Grants Council of the Hong Kong SAR, China (Project nos. HKBU 211505, HKBU211206, and FRG/05-06/II-65). Xueyan Tang’s work was supported in part by the Nanyang Technological University Grant RG47/06. Wang-Chien Lee’s work was supported in part by the National Science Foundation Grants CNS-0626709, IIS-0534343, and IIS-0328881. A preliminary report of this work appeared in the Proceedings of the International Conference on Data Engineering as a poster paper [34].
PY - 2007/7
Y1 - 2007/7
N2 - Top-k monitoring is important to many wireless sensor applications. This paper exploits the semantics of top-k query and proposes an energy-efficient monitoring approach called FILA. The basic idea is to install a filter at each sensor node to suppress unnecessary sensor updates. Filter setting and query reevaiuation upon updates are two fundamental issues to the correctness and efficiency of the FILA approach. We develop a query reevaiuation algorithm that is capable of handling concurrent sensor updates. In particular, we present optimization techniques to reduce the probing cost. We design a skewed filter setting scheme, which aims to balance energy consumption and prolong network lifetime. Moreover, two filter update strategies, namely, eager and lazy, are proposed to favor different application scenarios. We also extend the algorithms to several variants of top-k query, that is, orderinsensitive, approximate, and value monitoring. The performance of the proposed FILA approach is extensively evaluated using real data traces. The results show that FILA substantially outperforms the existing TAG-based approach and range caching approach in terms of both network lifetime and energy consumption under various network configurations.
AB - Top-k monitoring is important to many wireless sensor applications. This paper exploits the semantics of top-k query and proposes an energy-efficient monitoring approach called FILA. The basic idea is to install a filter at each sensor node to suppress unnecessary sensor updates. Filter setting and query reevaiuation upon updates are two fundamental issues to the correctness and efficiency of the FILA approach. We develop a query reevaiuation algorithm that is capable of handling concurrent sensor updates. In particular, we present optimization techniques to reduce the probing cost. We design a skewed filter setting scheme, which aims to balance energy consumption and prolong network lifetime. Moreover, two filter update strategies, namely, eager and lazy, are proposed to favor different application scenarios. We also extend the algorithms to several variants of top-k query, that is, orderinsensitive, approximate, and value monitoring. The performance of the proposed FILA approach is extensively evaluated using real data traces. The results show that FILA substantially outperforms the existing TAG-based approach and range caching approach in terms of both network lifetime and energy consumption under various network configurations.
UR - http://www.scopus.com/inward/record.url?scp=34249805447&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34249805447&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2007.1038
DO - 10.1109/TKDE.2007.1038
M3 - Article
AN - SCOPUS:34249805447
SN - 1041-4347
VL - 19
SP - 962
EP - 976
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 7
ER -