Kam-Yiu Lam
ABSTRACT
Due to the error-prone properties of sensors, it is important to use multiple low-cost sensors to improve the reliability of query results. However, using multiple sensors to generate the value for a data item can be expensive, especially in wireless environments where continuous queries are executed. Further, we need to distinguish effectively which sensors are not working properly and discard them from being used. In this paper, we propose a <i>probabilistic</i> approach to decide what sensor nodes to be used to answer a query. In particular, we propose to solve the problem with the aid of <i>continuous probabilistic query (CPQ)</i>, which is originally used to manage uncertain data and is associated with a probabilistic guarantee on the query result. Based on the historical data values from the sensor nodes, the query type, and the probabilistic requirement on the query result, we derive a simple method to select an appropriate set of sensors to provide reliable answers. We examine a wide range of common <i>aggregate queries</i>: average, sum, minimum, maximum, and range count query, but we believe our method can be extended to other query types. Our goal is to minimize sensor data aggregation workload in a network environment and at the same time meet the probabilistic requirement of the CPQ.
- R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, June 2003. Google Scholar
Digital Library
- E. Elnahrawy and B. Nath. Cleaning and Querying Noisy Sensors. In ACM WSNA'03, September 2003, San Diego, California. Google ScholarDigital Library
- E. Ertin, J. Fisher, and L. Potter. Maximum mutual information principle for dynamic sensor query problems. In Proc. IPSN'03, Palo Alto, CA, April 2003. Google ScholarDigital Library
- H. Dubois-Ferriere and D. Estrin. Efficient and Practical Query Scoping in Sensor Networks. CENS Technical Report #39, April 2004.Google Scholar
- S. Madden, M. J. Franklin, J. Hellerstein, and W. Hong. Tiny aggregate queries in ad-hoc sensor networks. In: Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI), Boston, USA (2002). Google ScholarDigital Library
- V. Kumar. Sensor: The Atomic Computing Particle. In SIGMOD Record, Vol. 32, No. 4, December 2003. Google ScholarDigital Library
- K. Y. Lam and H. C. W. Pang, Correct Execution of Continuous Monitoring Queries in Wireless Sensor Systems. In Proceedings of the Second International Workshop on Mobile Distributed Computing (MDC'2004), Tokyo, Japan, March 2004. Google ScholarDigital Library
- J. Liu, J. Reich, and F. Zhao. Collaborative in-network processing for target tracking. In EURASIP JASP: Special Issues on Sensor Networks, 2003(4):378--391, March 2003. Google ScholarDigital Library
- The National Institute of Standards and Technology. Wireless Ad Hoc Networks: Smart Sensor Networks. URL: http://w3.antd.nist.gov/wahn_ssn.shtmlGoogle Scholar
- D. Niculescu and B. Nath. Error characteristics of adhoc positioning systems. In Proceedings of the ACM Mobihoc 2004, Tokyo, Japan, May 2004. Google ScholarDigital Library
- M. A. Sharaf, J. Beaver, A. Labrinidis, P. Chrysanthis. TiNA: A Scheme for Temporal Coherency-Aware in-Network Aggregation. In Proceedings of 2003 International Workshop in Mobile Data Engineering. Google ScholarDigital Library
- V. Bychkovskiy, S. Megeriam, D. Estrin. and M. Potkonjak. A collaborative approach to in-place sensor calibration. In Proceedings of IPSN'03 (2003). Google ScholarDigital Library
- H. Wang, K. Yao, G. Pottie, and D. Estrin. Entropy-based Sensor Selection Heuristic for Localization. In 3rd International Workshop on Information Processing in Sensor Networks (IPSN'04), April 2004. Google ScholarDigital Library
- H. Wang, L. Yip, K. Yao and D. Estrin. Lower Bounds of Localization Uncertainty in Sensor Networks. In Proceedings of IEEE International Conference on Acoustics, Speech, May 2004.Google Scholar
Index Terms
- Sensor node selection for execution of continuous probabilistic queries in wireless sensor networks
Recommendations
A statistics-based sensor selection scheme for continuous probabilistic queries in sensor networks
A common approach to improve the reliability of query results based on error-prone sensors is to introduce redundant sensors. However, using multiple sensors to generate the value for a data item can be expensive, especially in wireless environments ...
Continuous probabilistic count queries in wireless sensor networks
SSTD'11: Proceedings of the 12th international conference on Advances in spatial and temporal databasesCount queries in wireless sensor networks (WSNs) report the number of sensor nodes whose measured values satisfy a given predicate. However, measurements in WSNs are typically imprecise due, for instance, to limited accuracy of the sensor hardware. In ...
Processing Ad-Hoc Queries in Wireless Sensor Networks
ITNG '08: Proceedings of the Fifth International Conference on Information Technology: New GenerationsA wireless sensor network (WSN) consists of a large number of sensor nodes that can measure and process data while communicating through wireless channels. In this paper, we propose a hybrid query processing (HQP) algorithm for user queries submitted to ...
Comments