Published February 2011 | Version public
Journal Article

Robust Sensor Placements at Informative and Communication-Efficient Locations

  • 1. ROR icon California Institute of Technology
  • 2. ROR icon Carnegie Mellon University
  • 3. ROR icon Cornell University

Abstract

When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this article, we present a data-driven approach that addresses the three central aspects of this problem: measuring the predictive quality of a set of sensor locations (regardless of whether sensors were ever placed at these locations), predicting the communication cost involved with these placements, and designing an algorithm with provable quality guarantees that optimizes the NP-hard trade-off. Specifically, we use data from a pilot deployment to build nonparametric probabilistic models called Gaussian Processes (GPs) both for the spatial phenomena of interest and for the spatial variability of link qualities, which allows us to estimate predictive power and communication cost of unsensed locations. Surprisingly, uncertainty in the representation of link qualities plays an important role in estimating communication costs. Using these models, we present a novel, polynomial-time, data-driven algorithm, PSPIEL, which selects Sensor Placements at Informative and communication-Efficient Locations. Our approach exploits two important properties of this problem: submodularity, formalizing the intuition that adding a node to a small deployment can help more than adding a node to a large deployment; and locality, under which nodes that are far from each other provide almost independent information. Exploiting these properties, we prove strong approximation guarantees for our PSPIEL approach. In addition, we show how our placements can be made robust against changes in the environment, and how PSPIEL can be used to plan informative paths for information gathering using mobile robots. We also provide extensive experimental validation of this practical approach on several real-world placement problems, and built a complete system implementation on 46 Tmote Sky motes, demonstrating significant advantages over existing methods.

Additional Information

© 2011 ACM. Received December 2008; revised June 2010; accepted June 2010. This submission is an extended version of Krause et al. [2006] "Near-Optimal sensor placements: Maximizing information while minimizing communication cost" in Proceedings of the Conference on Information Processing in Sensor Networks (ISPN'06). This work was supported by NSF Grant Nos. CNS-0509383, CNS-0625518, CNS-0932392, ANI-00331481, CCR-0120778, CCF-0448095, CCF-0729022, CCF-0325453, IIS-0329064, CNS-0403340, CCR-0122581, by the Office of Naval Research Grant N000140911044 and gifts from Intel Corporation and Microsoft Corporation. A. Krause was partly supported by a Microsoft Research Graduate Fellowship. A. Gupta and C. Guestrin were partly supported by Alfred P. Sloan Fellowships. C. Guestrin was also partly supported by an IBM Faculty Fellowship and an ONR Young Investigator Award. J. Kleinberg was supported by a David and Lucile Packard Foundation Fellowship. We would like to thank A. Perrig for providing us with motes and V. Singhvi for helping with the deployment.

Additional details

Identifiers

Eprint ID
23102
Resolver ID
CaltechAUTHORS:20110324-140512412

Funding

NSF
CNS-0509383
NSF
CNS-0625518
NSF
CNS-0932392
NSF
ANI-00331481
NSF
CCR-0120778
NSF
CCF-0448095
NSF
CCF-0729022
NSF
CCF-0325453
NSF
IIS-0329064
NSF
CNS-0403340
NSF
CCR-0122581
Office of Naval Research (ONR)
N000140911044
Alfred P. Sloan Foundation
IBM Faculty Fellowship
David and Lucile Packard Foundation
Microsoft Research

Dates

Created
2011-03-29
Created from EPrint's datestamp field
Updated
2021-11-09
Created from EPrint's last_modified field