This Article 
 Bibliographic References 
 Add to: 
Querying Uncertain Minimum in Wireless Sensor Networks
Dec. 2012 (vol. 24 no. 12)
pp. 2274-2287
Mao Ye, Pennsylvania State University, University Park
Ken C.K. Lee, University of Massachusetts Dartmouth, North Dartmouth
Wang-Chien Lee, Pennsylvania State University, University Park
Xingjie Liu, Pennsylvania State University, University Park
Meng-Chang Chen, Academia Sinica, Taipei
In this paper, we introduce two types of probabilistic aggregation queries, namely, Probabilistic Minimum Value Queries (PMVQ)s and Probabilistic Minimum Node Queries (PMNQ)s. A PMVQ determines possible minimum values among all imprecise sensed data, while a PMNQ identifies sensor nodes that possibly provide minimum values. However, centralized approaches incur a lot of energy from battery-powered sensor nodes and well-studied in-network aggregation techniques that presume precise sensed data are not practical to inherently imprecise sensed data. Thus, to answer PMVQs and PMNQs energy-efficiently, we devised suites of in-network algorithms. For PMVQs, our in-network minimum value screening algorithm (MVS) filters candidate minimum values; and our in-network minimum value aggregation algorithm (MVA) conducts in-network probability calculation. PMNQs requires possible minimum values to be determined a prior, inevitably consuming more energy to evaluate than PMVQs. Accordingly, our one-phase and two-phase in-network algorithms are devised. We also extend the algorithms to answer PMNQ variants. We evaluate all our proposed approaches through cost analysis and simulations.
Index Terms:
Base stations,Algorithm design and analysis,Routing,Probabilistic logic,Probability,Equations,Optimization,algorithms and performance,Wireless sensor network,uncertain data,data aggregation,minimum queries
Mao Ye, Ken C.K. Lee, Wang-Chien Lee, Xingjie Liu, Meng-Chang Chen, "Querying Uncertain Minimum in Wireless Sensor Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 12, pp. 2274-2287, Dec. 2012, doi:10.1109/TKDE.2011.166
Usage of this product signifies your acceptance of the Terms of Use.