Robust Sensor Placements at Informative and Communication-Efficient Locations

被引:41
作者
Krause, Andreas [1 ]
Guestrin, Carlos [2 ]
Gupta, Anupam [2 ]
Kleinberg, Jon [3 ]
机构
[1] CALTECH, Dept Engn & Appl Sci, Pasadena, CA 91125 USA
[2] Carnegie Mellon Univ, Dept Comp Sci, Pittsburgh, PA 15213 USA
[3] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
基金
美国国家科学基金会;
关键词
Algorithms; Measurement; Sensor networks; communication cost; link quality; information theory; spatial monitoring; sensor placement; approximation algorithms; Gaussian processes; ALGORITHM;
D O I
10.1145/1921621.1921625
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:33
相关论文
共 47 条
[1]  
[Anonymous], 2004, Wireless Sensor Networks, First Edition: An Information Processing Approach
[2]  
[Anonymous], 1991, STAT SPATIAL DATA
[3]  
[Anonymous], 2006, ADAPT COMPUT MACH LE
[4]  
[Anonymous], P 9 ACM INT C MOB CO
[5]  
[Anonymous], P INT S MOD OPT MOB
[6]   New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen [J].
Awerbuch, B ;
Azar, Y ;
Blum, A ;
Vempala, S .
SIAM JOURNAL ON COMPUTING, 1998, 28 (01) :254-262
[7]  
Bai X., 2006, P ACM INT S MOB AD H
[8]  
BIAN F, 2006, P 5 INT C INF PROC S
[9]   The polymatroid Steiner problems [J].
Calinescu, G ;
Zelikovsky, A .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 9 (03) :281-294
[10]   OPTIMAL MONITORING NETWORK DESIGNS [J].
CASELTON, WF ;
ZIDEK, JV .
STATISTICS & PROBABILITY LETTERS, 1984, 2 (04) :223-227