Advertisement

Real-Time Systems

, Volume 35, Issue 1, pp 33–58 | Cite as

A statistics-based sensor selection scheme for continuous probabilistic queries in sensor networks

  • Song HanEmail author
  • Edward Chan
  • Reynold Cheng
  • Kam-Yiu Lam
Article

Abstract

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 where continuous queries are executed. Moreover, some sensors may not be working properly and their readings need to be discarded. In this paper, we propose a statistical approach to decide which sensor nodes to be used to answer a query. In particular, we propose to solve the problem with the aid of continuous probabilistic query (CPQ), 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 requirement on the query, we present methods to select an appropriate set of sensors and provide reliable answers for several common aggregate queries. Our statistics-based sensor node selection algorithm is demonstrated in a number of simulation experiments, which shows that a small number of sensor nodes can provide accurate and robust query results.

Keywords

Sensor networks Continuous probabilistic queries Data uncertainty Sensor selection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cheng R, Kalashnikov D, Prabhakar S (2003) Evaluating probabilistic queries over imprecise data. In: Proc. of the ACM SIGMOD intl conf on management of dataGoogle Scholar
  2. Deshpande A, Guestrin C, Madden SR, Hellerstein JM, Hong W (2004) Model-driven data acquisition in sensor networks. In: Proc. of the 30thVLDB conference, Toronto, CanadaGoogle Scholar
  3. Dubois-Ferriere H, Estrin D (2004) Efficient and practical query scoping in sensor networks. CENS Technical Report #39Google Scholar
  4. Elnahrawy E, Nath B (2003) Cleaning and querying noisy sensors. In: ACM WSNA’03, San Diego, CaliforniaGoogle Scholar
  5. Ertin E, Fisher J, Potter L (2003) Maximum mutual information principle for dynamic sensor query problems. In: Proc. IPSN’03, Palo Alto, CAGoogle Scholar
  6. Kumar V (2003) Sensor: The atomic computing particle. In: SIGMOD Record 32(4)Google Scholar
  7. Krishnamachari B, Iyengar S (2004) Distributed bayesian algorithms for fault-tolerant event region detection in wireless sensor networks. IEEE Trans Comput 53(3):241–250CrossRefGoogle Scholar
  8. Lam KY, Cheng R, Liang BY, Chau J (2004) Sensor node selection for execution of continuous probabilistic queries in wireless sensor networks. In: Proc. of ACM 2nd international workshop on video surveillance and sensor networks, New York, USAGoogle Scholar
  9. Lam KY, Pang HCW (2004) Correct execution of continuous monitoring queries in wireless sensor systems. In: Proc. of the second international workshop on mobile distributed computing (MDC’2004), Tokyo, JapanGoogle Scholar
  10. Liu J, Reich J, Zhao F (2003) Collaborative in-network processing for target tracking. EURASIP JASP: Spl Issue Sens Netw 2003(4):378–391Google Scholar
  11. Madden S, Franklin MJ, Hellerstein J, Hong W (2002) Tiny aggregate queries in ad-hoc sensor networks. In: Proc. of the 5th symposium on operating systems design and implementation (OSDI), Boston, USAGoogle Scholar
  12. Niculescu D, Nath B (2004) Error characteristics of ad hoc positioning systems. In: Proc. of the ACM Mobihoc 2004, Tokyo, JapanGoogle Scholar
  13. Sharaf MA, Beaver J, Labrinidis A, Chrysanthis P (2003) TiNA: A scheme for temporal coherency-aware in-network aggregation. In: Proc. of 2003 international workshop in mobile data engineeringGoogle Scholar
  14. The national institute of standards and technology. Wireless ad hoc networks: smart sensor networks. URL: http://w3.antd.nist.gov/wahn_ssn.shtml
  15. Wang H, Yao K, Pottie G, Estrin D (2004a) Entropy-based sensor selection heuristic for localization. In: Proc. 3rd international workshop on information processing in sensor networks (IPSN’04)Google Scholar
  16. Wang H, Yip L, Yao K, Estrin D (2004b) Lower bounds of localization uncertainty in sensor networks. In: Proc. of IEEE international conference on acoustics, speechGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Song Han
    • 1
    Email author
  • Edward Chan
    • 1
  • Reynold Cheng
    • 2
  • Kam-Yiu Lam
    • 1
  1. 1.Department of Computer ScienceCity University of Hong KongKowloon TongHong Kong
  2. 2.Department of ComputingHong Kong Polytechnic UniversityHunghom, KowloonHong Kong

Personalised recommendations