Issue No. 01 - Jan. (2013 vol. 25)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.145
Mao Ye , Penn State University, University Park
Wang-Chien Lee , Penn State University, University Park
Dik Lun Lee , Hong Kong University of Science and Technology, Hong Kong
Xingjie Liu , Penn. State, University Park
In this paper, we introduce the notion of sufficient set and necessary set for distributed processing of probabilistic top-k queries in cluster-based wireless sensor networks. These two concepts have very nice properties that can facilitate localized data pruning in clusters. Accordingly, we develop a suite of algorithms, namely, sufficient set-based (SSB), necessary set-based (NSB), and boundary-based (BB), for intercluster query processing with bounded rounds of communications. Moreover, in responding to dynamic changes of data distribution in the network, we develop an adaptive algorithm that dynamically switches among the three proposed algorithms to minimize the transmission cost. We show the applicability of sufficient set and necessary set to wireless sensor networks with both two-tier hierarchical and tree-structured network topologies. Experimental results show that the proposed algorithms reduce data transmissions significantly and incur only small constant rounds of data communications. The experimental results also demonstrate the superiority of the adaptive algorithm, which achieves a near-optimal performance under various conditions.
Sensors, Wireless sensor networks, Probabilistic logic, Query processing, Base stations, Distributed databases, Semantics, wireless sensor networks, Top-k queries, distributed data management, probabilistic databases
D. L. Lee, W. Lee, M. Ye and X. Liu, "Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 25, no. , pp. 76-91, 2013.